Search found 60 matches

by ayeshapakhi
Thu Jul 20, 2006 2:44 pm
Forum: Volume 102 (10200-10299)
Topic: 10299 - Relatives
Replies: 57
Views: 14571

10299 relatives TLE

thanks .......
i got ac.
the isprime function was the culprit......
by ayeshapakhi
Thu Jul 20, 2006 2:38 pm
Forum: Volume 100 (10000-10099)
Topic: 10009 - All Roads Lead Where?
Replies: 60
Views: 14921

10009 All roads lead where Wrong Ans

I dont understand why it is WA.
pls help me. and send some i/o if possible.
thanks .

Code: Select all

removed after getting AC;
by ayeshapakhi
Thu Jul 20, 2006 2:32 pm
Forum: Volume 103 (10300-10399)
Topic: 10323 - Factorial! You Must be Kidding!!!
Replies: 106
Views: 32917

10323 factorial u must kidding

Always the judge's reply is.... Compilation error. Anyone pls pls help me fixing that; here's my code: #include <stdio.h> #include <math.h> void main() { long long n,fact,i; while( scanf("%lld",&n)==1) { if(n < 0) { fact=-n; if( fact > 13) { if( fact % 2 == 0)printf("Overflow!\n"); else printf("Unde...
by ayeshapakhi
Thu Jul 06, 2006 2:55 pm
Forum: Volume 105 (10500-10599)
Topic: 10533 - Digit Primes
Replies: 108
Views: 32414

10533 digit primes WA

i wonder wheres the mistake! pls help!!! thanks for any help;;; #include <stdio.h> // 10533 submit #include <math.h> #define L 1 #define U 1000005 #define D 1000005 bool all[D]; bool digit[D]; inline void seive(void); long count[D]; *********removed after AC /* 12 1 999999 1 1 1 10 9 12 240320 24035...
by ayeshapakhi
Thu Jul 06, 2006 2:50 pm
Forum: Volume 100 (10000-10099)
Topic: 10042 - Smith Numbers
Replies: 75
Views: 23664

10042 smith number wa>>>>

hi.. pls help me finding the bug>>> thanks for any help... #include <stdio.h> //10042 Submit ### #include <math.h> #define U 47001 #define N 5000 bool tag[U]; long primes[N],c=0; inline bool isprime(long n); inline void seive(void); void main() { long num,all[N],i,j,k,intg,real,sumd,sumpd,test,l; se...
by ayeshapakhi
Sun Jul 02, 2006 3:02 pm
Forum: Volume 4 (400-499)
Topic: 406 - Prime Cuts
Replies: 187
Views: 23584

406 prime cuts WA

i got at least 5 WA. plz help me /* !NOT ACCEPTED!!!!!!!!Primes Cut 406*/ //Submit again #include <stdio.h> #include <math.h> #define L 1 #define U 100001 #define N 50000 long primes[N]; long c=0; bool all[U]; long count[U]; void seive(void); void main() { freopen("406.in","r",stdin); freopen("out40...
by ayeshapakhi
Wed May 31, 2006 7:02 am
Forum: Volume 3 (300-399)
Topic: 386 - Perfect Cubes
Replies: 53
Views: 7497

hello all.....
thanks a lot.......
thanks for ur help & for ur time....
.........
by ayeshapakhi
Tue May 30, 2006 2:53 pm
Forum: Volume 3 (300-399)
Topic: 386 - Perfect Cubes
Replies: 53
Views: 7497

hi there!
anyway,i got accepted .....
made a silly mistake in the spelling of "Triple"..
thanks a lot.....
by ayeshapakhi
Tue May 30, 2006 10:42 am
Forum: Volume 1 (100-199)
Topic: 160 - Factors and Factorials
Replies: 205
Views: 25924

160 WA

dear fellows...... pls help abt 160...it would be better if u can provide me some test cases... or if there's any mistake abt the formatting pls help me fixing.... #include <stdio.h> #define size 25 void main() { //freopen("in.txt","r",stdin); //freopen("Mout.txt","w",stdout); long int prime[size]={...
by ayeshapakhi
Tue May 30, 2006 8:53 am
Forum: Volume 1 (100-199)
Topic: 102 - Ecological Bin Packing
Replies: 485
Views: 52476

dear tan_Yui...
Thanks a tonnn for ur help.......
i got accepted at last!!!!! :D
i missed that point......
thanks again..
:D
by ayeshapakhi
Mon May 29, 2006 8:21 pm
Forum: Volume 101 (10100-10199)
Topic: 10189 - Minesweeper
Replies: 418
Views: 70424

hi there! i didnt run ur code but probably u r getting out of array boundary by these lines......... for(i=0 ; i<mrow ; i++) { for(j=0 ; j<mcol ; j++) { if (arr [j] < 0) { arr[i-1][j-1] ++; arr[i-1][j] ++; arr[i-1][j+1] ++; arr [j-1] ++; arr [j] ++; arr [j+1] ++; arr[i+1][j-1] ++; arr[i+1][j] ++; ar...
by ayeshapakhi
Mon May 29, 2006 8:01 pm
Forum: Volume 3 (300-399)
Topic: 355 - The Bases Are Loaded
Replies: 74
Views: 23210

355 getting WA everytime..........

please help.......... /* 355 not accepted*/ #include <stdio.h> #include <math.h> #include <string.h> long toten(char a); char tento(long a); void rev(char a[]); void main() { // freopen("input.txt","r",stdin); long len,frbase,tobase,i,temp,intg,tenval; char num[1000],final[1000],zero[10]="0"; bool t...
by ayeshapakhi
Mon May 29, 2006 7:56 pm
Forum: Volume 3 (300-399)
Topic: 386 - Perfect Cubes
Replies: 53
Views: 7497

386 wa, it seems ok but......

please show me the mistake...
thanks.........

Code: Select all

the code is removed.
by ayeshapakhi
Mon May 29, 2006 7:06 pm
Forum: Volume 1 (100-199)
Topic: 102 - Ecological Bin Packing
Replies: 485
Views: 52476

102 WA pls tell me where is the problem??????

here's the code........... Thanks for any help. the code is removed after getting AC #include <stdio.h> #include <string.h> for(i=0; i<N; i++) { if(allcomb[i]<min) { strcpy(glass,col[i]); min=allcomb[i]; } else if(allcomb[i]==min) { if( strcmp(glass,col[i])==1) strcpy(glass,col[i]); } } printf("%s %...
by ayeshapakhi
Sun May 28, 2006 10:01 pm
Forum: Volume 101 (10100-10199)
Topic: 10161 - Ant on a Chessboard
Replies: 10
Views: 5394

10161WA.......pls help

would anyone pls send me some test cases? source code is here...i dont understand why it's getting WA..... #include <stdio.h> #include <math.h> void main() { long time,row,col,temp,flo,cei,aux; double num; while(scanf("%ld",&time)==1 && time) { num=(double)sqrt(time); flo=(long)floor(num); cei=(long...

Go to advanced search