OJ Board

infact you do not even need to find primes at all.

Would you please explain in more detail?

Thanks all of you to response.
I haven’t worked yet.
As far as I know sieve method is efficient for generating primes upto 1 million (1000000) only. But in this problem L and U are chosen such that 1<=L<=U<=1000000000.
Should I use sieve method for this problem?

I got runtime error. Please help me.
I have precalculated prime numbers. Then computed the divisors for n where n =p1^e1* p2^e2* ... *pn^en equals (e1+1)*(e2+1)*...*(en+1).


#include<math.h>
#include<stdio.h>

int Isprime(int I);

int primes[10000]={2};
long double lu;
unsigned long max,sum,j,p,N ...

Thanks a lot!

I have checked the code several times but cannot find out the error. Could anybody suggest?

Thank you.
It is now accepted.

deleted

Would you explain in more details?
Should I use string operations? I have read few threads in this forum regarding 727 after I got WA. Many of them get accepted using sqrtl() with long double. As I expected sqrtl() surprisingly solves the problem. Then what is wrong with my code?

Can anybody tell me, why WA?
[c]
#include<stdio.h>
#include<math.h>

void main()
{
int n,i;
long double x,y;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%Lf",&y);
x=sqrtl(y);
printf("%.0Lf\n\n",x);
}
}

[/c]

Why my program is getting run time error? Is it for stack overflow? How can I handle multiple input? Can anybody help?

I have solved many problems. But my statistics shows only few solved problems from today. How can I soved the problem? Can anybody suggest?