If you use formula in C++, you don't need the long arithmetics. Use long double and you'll get AC.

bits/stdc++.h -> TLE on Test #4
cstdio        -> TLE on Test #4
stdio.h       -> AC

Compiled with: G++ 4.9 C++11

Can anyone give an explanation?

var podschet,a,b,i:integer;
begin
a:=1;
for i:=1 to 10 do
begin
readln(b);
a:=a*b;
end;
for i:=1 to a do
begin
if a mod i=0 then podschet:=podschet+1;
end;
if podschet>9 then podschet:=podschet div 10;
writeln(podschet);
end.

Edited by author 11.12.2014 15:46

Here's my code:
import math
a = input()
a = a.replace('\n', ' ')
a = a.split()
a.reverse()
for i in a:
    print(math.sqrt(float(i)))

Edited by author 10.05.2014 16:59

#include<iostream>
using namespace std;
int main()
{
    long int N,i,sum=0;

    cin >> N;

     if (N > 10000 || N < -10000) {
        cout<<sum;
        return 0;
    }

    if(N>0)
    for(i= N; i>= 1; i-- )
        sum=sum+i;

    if(N<0)
        for(i= N; i<=1; i++)
        sum=sum+i;



    cout<<sum;
}

What kind of projection? Orthographic or perspective?

Edited by author 15.02.2015 14:43

import java.util.*;

public class TurnForMEGA {

    public static void main(String[] args) {
      Scanner in=new Scanner(System.in);
      int k=in.nextInt();
      int n=in.nextInt();
      int sum=0,temp=0;
      int result=0;
      int[] array =new int[100];
      for(int i=0;i<n;i++){
          array[i]=in.nextInt();
      }
      for(int i=0;i<n;i++)
      {
       temp=array[i]-k;
       if(temp>0)
       {
       array[i+1]+=temp;
       }
      }
      result=array[n-1]-k;
     if(result<=0)
     {
         result=0;
     }
          System.out.print(result);
    }

}

Edited by author 15.02.2015 12:16

Edited by author 15.02.2015 12:16

#include <iostream>
using namespace std;
int main(){
    int a,b,c,d,k=0;
    cin >> a >> b >> c >> d;
    while(a<c){
        if(k==0){
            k = 1;
            a += b;
            cout << a << " ";
        } else {
            k = 0;
            c -= d;
            cout << c << " ";
        }
    }
    cout << a ;
    return 0;
}

can anyone provides some testcases?

#include <iostream>
using namespace std;

int main() {

    int arr[4] = {10, 670, 55252, 4816030};
    short m;

    cin >> m;
    cout << arr[m / 2 - 1];
    return 0;
}

//hey; can you guess how i got these values?(think of the simplest solution)

Edited by author 15.02.2013 04:31

I'm using KMP I don't know why I get TLE?



#include <iostream>



int main(int argc, const char * argv[]) {

    long long int NumofChars;
    long long int finAns=-1;

    scanf("%lld",&NumofChars);

    char lettersS[2*NumofChars];
    char lettersT[NumofChars];
    char letter_tmp;





    for (long long int i=0;i<NumofChars;i++)
    {
        scanf(" %c",&letter_tmp);
        lettersT[i]=letter_tmp;
    }

    for (long long int i=0;i<NumofChars;i++)
    {
        scanf(" %c",&letter_tmp);
        lettersS[i]=letter_tmp;
        lettersS[i+NumofChars]=letter_tmp;
    }




    long long int prefix[NumofChars];
    prefix[0]=0;
    prefix[1]=0;

    long long int pi=0;
    long long int pj=1;

    while(pj<NumofChars-1)
    {
        if(lettersT[pi]==lettersT[pj])
        {
            prefix[pj+1]=prefix[pj]+1;

            pi++;
            pj++;

        }
        else
        {

            pi=0;
            if(lettersT[pi]==lettersT[pj])
            {
                prefix[pj+1]=1;

                pi++;
                pj++;


            }
            else
            {
                prefix[pj+1]=0;

                pj++;

            }

        }
    }







    finAns=-1;

    long long int i=0;
    while(i<NumofChars)
    {


        long long int Matchcount=0;
        long long int j_init=0;
        for (long long int j=j_init;j<NumofChars;j++)
        {
            if(lettersS[i+j]==lettersT[j])
            {
                Matchcount++;
            }
            else
            {
                if(j-prefix[j]>0)
                {
                    i=i+j-prefix[j];
                    j_init=prefix[j];

                }
                else
                {
                    i++;
                }

                break;
            }
        }


        if(Matchcount==NumofChars)
        {
            finAns=i;

            break;
        }
    }
    std::cout<<finAns;
    return 0;
}

Whoever thought of this problem haven't fried steaks in real life.

The only way to get an acceptable solution to 1820 is to cook the steaks somewhat similar to this order:
Minute 1: St1A, St2A
Minute 2: St1B, St3A
Minute 3: St2B, St3B
(where there are three steaks: St1, St2 and St3, and each having side A and side B).

The problem with this is:
After St2A side is cooked, it will be taken off the heat and cool down for one minute before cooking the other side, thus in the end the steak will be less cooked than stake 1 and 3. That's all sorts of wrong, you'll be ruining a good steak!

:-D

For those who get TLE #17 try to use scanf/printf instead of cin/cout

Explain me please, why if n=4, the answer is 204.
I get 2513.

Here is my code:
-----
[The code was here]
-----
I've got the point. Thank you.

Edited by author 17.07.2011 18:48

/*
    Machine: Class4_B2
    System: Windows7 SP1 32bit
*/
[code deleted]

Edited by moderator 19.11.2019 23:15