Search found 29 matches
- Fri Oct 29, 2004 11:58 am
- Forum: Volume 105 (10500-10599)
- Topic: 10515 - Powers Et Al.
- Replies: 124
- Views: 32939
10515-reply
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 wi...
- Fri Sep 17, 2004 9:32 pm
- Forum: Volume 106 (10600-10699)
- Topic: 10608 - Friends
- Replies: 75
- Views: 28997
10608
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.
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.
- Fri Aug 06, 2004 6:17 pm
- Forum: Algorithms
- Topic: prime numbers
- Replies: 10
- Views: 4120
thankx
got accepted.thankx 

- Fri Aug 06, 2004 11:34 am
- Forum: Algorithms
- Topic: prime numbers
- Replies: 10
- Views: 4120
prime number
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 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?
- Fri Aug 06, 2004 11:33 am
- Forum: Algorithms
- Topic: prime numbers
- Replies: 10
- Views: 4120
prime number
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 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?
- Fri Aug 06, 2004 11:28 am
- Forum: Volume 101 (10100-10199)
- Topic: 10140 - Prime Distance
- Replies: 17
- Views: 7820
10140-prime distance
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
wud anyone plz give me some sample input/output?help in advance
- Fri Jul 30, 2004 8:25 pm
- Forum: Volume 101 (10100-10199)
- Topic: 10139 - Factovisors
- Replies: 80
- Views: 30793
getting tle
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 } ...
- Fri Jul 30, 2004 8:02 pm
- Forum: Algorithms
- Topic: prime numbers
- Replies: 2
- Views: 1351
prime numbers
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...
- Fri Jul 30, 2004 7:53 pm
- Forum: Algorithms
- Topic: prime numbers
- Replies: 10
- Views: 4120
prime numbers
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...
- Thu Jul 29, 2004 10:30 am
- Forum: Volume 101 (10100-10199)
- Topic: 10139 - Factovisors
- Replies: 80
- Views: 30793
10139
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.
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.
- Mon Jun 28, 2004 6:57 pm
- Forum: Volume 106 (10600-10699)
- Topic: 10668 - Expanding Rods
- Replies: 38
- Views: 21168
thankx
thank u very much shamim. I got accepted. 

- Mon Jun 28, 2004 11:17 am
- Forum: Volume 106 (10600-10699)
- Topic: 10668 - Expanding Rods
- Replies: 38
- Views: 21168
10668
wud anyone plz check my code?
code has been removed
code has been removed
- Sun Jun 13, 2004 2:44 pm
- Forum: Volume 4 (400-499)
- Topic: 442 - Matrix Chain Multiplication
- Replies: 21
- Views: 4024
442 - Matrix Chain Multiplication
wud anybody plz provide me some tricky inputs for the problem 442??
- Fri Nov 21, 2003 4:51 pm
- Forum: Other words
- Topic: prime generation
- Replies: 10
- Views: 2560
thankx junjieliang
yes, its a good idea. i will try it. thank u very much 

- Thu Nov 20, 2003 5:11 pm
- Forum: Other words
- Topic: prime generation
- Replies: 10
- Views: 2560
got AC
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 
