OJ Board

i failed to understand your logic.but I can tell you how i solved this problem.you can get more help by browsing the topics in this forum on p-10515. 1.one digit of m & two digits of n is required. 2. the only one digit of m can be any digit from 0-9 3.try to find out 0^i to 9^i,obviously you will f...

dont use

while(scanf("%d",&test)==1)
{
while(test)
{
test--;
}
}

instead use

scanf("%d",&test);

while(test)
{
test--;
}

but thus u can escape from tle,but still your code holds a bug and getting WA.check it out.

got accepted.thankx

thankx riyad.
I already code it.I solved 10140-prime distance using segment seive.but am getting WA.can you give me some sample input/output for 10140?

thankx riyad.
I already code it.I solved 10140-prime distance using segment seive.but am getting WA.can you give me some sample input/output for 10140?

I solved the problem and getting WA.but failed to find my bug.
wud anyone plz give me some sample input/output?help in advance

thanx for reply.but i tried it and got TLE. I am telling my idea here,plz tell me where is the bug input:m & n is given output:i have to determine whether m divides n! my idea: if(m==0) ....................then NO if(n==0 || n==1) { if(m==1).................YES else.........................NO } if(m...

say i have to find out whether a=2^31 is prime or not. but i cant do it by testing if a is divided by the primes between sqrt(a),cause it results in TLE.what should i do then? is there any efficient method to find primes within a range?can we use seive to find primes in [a,b] ?i mean we should not s...

say i have to find out whether a=2^31 is prime or not. but i cant do it by testing if a is divided by the primes between sqrt(a),cause it results in TLE.what should i do then? is there any efficient method to find primes within a range?can we use seive to find primes in [a,b] ?i mean we should not s...

in this problem
n can be a prime number closer to 2^31.
so i have to run sieve for 2^31.
but for this i have to keep an array of length 2^31.it is not supported.what can I do?plz help me.

thank u very much shamim. I got accepted.

wud anyone plz check my code?

code has been removed

wud anybody plz provide me some tricky inputs for the problem 442??

yes, its a good idea. i will try it. thank u very much

special thankx to Caesum ,LPH & UFP2161 .following ur suggesstions atlast i got AC.i cant get the hints provided by junjieliang. wud u plz make it easier for me?thanks to all again