## Search found 96 matches

Sat Feb 11, 2012 9:24 am
Forum: Volume 105 (10500-10599)
Topic: 10533 - Digit Primes
Replies: 108
Views: 31227

Sat Feb 11, 2012 5:52 am
Forum: Volume 114 (11400-11499)
Topic: 11428 - Cubes
Replies: 64
Views: 16906

### Re: 11428 - Cubes (about 7 times TLE and 3 times WA)

Thanks a lot.
Thanks a lot boss.
Finally I got it AACC.
Fri Feb 10, 2012 12:47 pm
Forum: Volume 118 (11800-11899)
Replies: 32
Views: 9961

Please, Anyone will help me I am getting wrong answer. Please give me some critical i/o test cases so that I can get rid of this problem. Here is my code: #include <cstdio> int main() { long n; while(scanf("%ld",&n)==1) { if(n==0) break; long station[10000],I,J,fag=0; for(I=0 ; I<n ; I++) { scanf("%...
Fri Feb 10, 2012 12:37 pm
Forum: Volume 119 (11900-11999)
Topic: 11946 - Code Number
Replies: 49
Views: 8711

### Re: 11946- Code Number

Thanks a lot.
Thanks a lot.
Thanks a lot boss.
Finally, I got it AC.
Thu Feb 09, 2012 8:10 pm
Forum: Volume 5 (500-599)
Topic: 530 - Binomial Showdown
Replies: 137
Views: 33052

### Re: 530 Binomial Showdown Time limit exceeded

Hi brianfry713, thanks for helping. But it's now WA. Here is my modified code please check it, please. #include <cstdio> #include <cctype> #include <cmath> #include <iostream> using namespace std; int main() { long double n, m; while(scanf("%Lf %Lf",&n,&m)==2) { long double t=0.0, t_fact=1.0, m_fact...
Thu Feb 09, 2012 7:45 pm
Forum: Volume 120 (12000-12099)
Topic: 12015 - Google is Feeling Lucky
Replies: 8
Views: 7574

Thank you
Thank you
Thank you brother
Actually I am very disappointed with my eyes. It is my real life problem.
Thanks a lot brother
Thu Feb 09, 2012 7:37 pm
Forum: Volume 6 (600-699)
Topic: 686 - Goldbach's Conjecture (II)
Replies: 41
Views: 18595

### Re: 686 - Goldbach's Conjecture (II)

Thanks a lot
Thanks a lot
Thanks a lot
Thanks a lot
Thanks a lot
Finally I got it aaaccc.
Thu Feb 02, 2012 10:14 pm
Forum: Volume 6 (600-699)
Topic: 686 - Goldbach's Conjecture (II)
Replies: 41
Views: 18595

### Re: 686 - Goldbach's Conjecture (II)

Why I am getting Runtime error? please help me here is my code: #include <cstdio> bool sieve[100000]={0}; unsigned long long prim[100000]; int main() { unsigned long long i,j,n, k=0; sieve[0]=1; sieve[1]=1; // 1 = non-prime for(i=4 ; i<=40000 ; i+=2) sieve[i]=1; for(i=3 ; i<40000 ; i+=2) { if(sieve[...
Sat Jan 28, 2012 7:26 pm
Forum: Volume 118 (11800-11899)
Topic: 11849 - CD
Replies: 24
Views: 5336

Hi,
Brother
Thanks a lots.
Thanks a lots.
Thanks a lots.
Finally I got it ACCCCCCCCCCCC.
Sat Jan 28, 2012 10:47 am
Forum: Volume 120 (12000-12099)
Topic: 12015 - Google is Feeling Lucky
Replies: 8
Views: 7574

### 12015 - Google is Feeling Lucky

Why I am getting WA in 12015? Anyone will help me so that I would get rid of this problem. Please, give me some critical test cases. Here code is here:

Code: Select all

/* Removed */
Sat Jan 28, 2012 10:40 am
Forum: Volume 105 (10500-10599)
Topic: 10533 - Digit Primes
Replies: 108
Views: 31227

I am still getting TLE. Please, help me. My updated code is here: #include<cstdio> #include<cstring> bool sieve[10001011]={0}; long rev( long I ) { long sum=0,num=I,tmp; while(num!=0) { tmp=num%10; num=num/10; sum=sum+tmp; } return sum; } int main() { long t1,t2; long i,j; sieve[0]=1; sieve[1]=1; fo...
Wed Jan 25, 2012 3:17 pm
Forum: Volume 109 (10900-10999)
Topic: 10945 - Mother bear
Replies: 65
Views: 16521

### Re: 10945 - Mother Bear WA why? Anyone help me please

Hi, brother
Thank you, Thank you, Thank you
Thank you very much
Thanks a lot...
Wed Jan 25, 2012 9:02 am
Forum: Volume 102 (10200-10299)
Topic: 10235 - Simply Emirp
Replies: 150
Views: 30822

### Re: WA in 10235

Hi, brother
Thanks a lots..
Thanks a lots..
Thanks a lots..
Thanks a lots..
................
..............
Fri Jan 20, 2012 6:43 am
Forum: Volume 102 (10200-10299)
Topic: 10235 - Simply Emirp
Replies: 150
Views: 30822

Anyone will help me with kindly please why I am getting RE in my program?
Here, is my code:

Code: Select all

/* Removed */
Thu Jan 19, 2012 7:54 pm
Forum: Volume 118 (11800-11899)
Topic: 11849 - CD
Replies: 24
Views: 5336