11614 - Etruscan Warriors Never Play Chess

[crazy]

it gave me wrong answer ...

Code: Select all

#include<stdio.h>
#include<math.h>
int main()
{
long int x,n,m,k,i;
scanf("%ld",&k);
for(i=0;i<k;i++)
{
    scanf("%ld",&n);
{
    m=(1+8*n)-1;
    x=sqrt(m)/2;
printf("%ld\n",x);
}}
return 0;
}

[brianfry713]

Doesn't match the sample I/O.

[tarsun]

Why gave time limit exceed??

#include<stdio.h>

int main()
{
long int n,i,sum,f,x,test,t1;
scanf("%ld",&test);
for(t1=1;t1<=test;t1++)
{ sum=0;
scanf("%ld",&n);
for(i=1;;i++)
{
sum=sum+i;
if(sum==n)
{
printf("%ld",i);
break;
}
if(sum>n)
{
x=i-1;
printf("%ld",x);
break;
}

}
}
return 0;

}

[brianfry713]

Input:

Code: Select all

1
100000000000000

AC output:

Code: Select all

14142135

[tarsun]

is it correct code?
which datatype used for this program?

[helloneo]

I used 'unsigned long long'

[raj]

Code: Select all

Accepted
and Thanks Brianfry:)

[brianfry713]

There is a formula, I didn't precompute anything.

[raj]

Code: Select all

removed

[brianfry713]

Don't double post.

[ssavi]

Why It is getting TLE ?? Is there any correction ???

Code: Select all

#include<stdio.h>
int main()
{
    long long int n, i, t, sum;
    scanf("%lld",&t);
    while(t--)
    {
        scanf("%lld",&n);
        sum=0; i=1;
        while(sum<n)
        {
            sum=sum+i;
            i++;
        }
        if(n<sum)
           {printf("%lld\n",i-2);}
        else if(n==sum)
            printf("%lld\n",i-1);
    }
    return 0;
}

[brianfry713]

You can solve each test case in constant time.

[ssavi]

You can solve each test case in constant time.

I dont get your words .

[brianfry713]

Your algorithm is too slow, it runs in O(n) for each test case. To solve it within the time limit, you can use a O(1) formula.