Search found 57 matches
- Sat Sep 02, 2006 2:34 pm
- Forum: Volume 100 (10000-10099)
- Topic: 10036 - Divisibility
- Replies: 37
- Views: 12283
Re: 10036(DIVISIBILTY) WA , mad judge?
... what I think is absolutely right. I read all the previous posts... i did not go through ur code but if u r too sure u r doing the right job, i would like to advice u to make a "random" input file and take a view of how ur program responses. also check the tribial case of only 1 number...
- Thu Aug 31, 2006 3:42 pm
- Forum: Off topic (General chit-chat)
- Topic: What kinds of problems do you solve most ?
- Replies: 25
- Views: 77632
- Fri Jan 06, 2006 12:12 pm
- Forum: Volume 106 (10600-10699)
- Topic: 10637 - Coprimes
- Replies: 16
- Views: 6898
Can somebody provide some tricky I/O. I'm getting WA. I print nothing if number_of_partition>sum. Thanks. I need I/O, could you do me a favor. Thanks a lot. lonely well i send some information to both of U. so if u r still confused keep mailing. again about the timing, it was 0:00.264 and what i re...
- Tue Oct 25, 2005 12:51 pm
- Forum: Volume 5 (500-599)
- Topic: 536 - Tree Recovery
- Replies: 19
- Views: 8793
- Wed Sep 21, 2005 12:50 pm
- Forum: Volume 103 (10300-10399)
- Topic: 10329 - Combinatorial Expression
- Replies: 11
- Views: 6372
here is my wa soln. #include <stdio.h> #include <math.h> #include <string.h> #define Max_2(a,b) ( ((a)>(b))?(a):(b) ) #define Max_3(a,b,c) Max_2(a, Max_2(b,c) ) const int LIMIT = 5005, SIZE = 700, MAX = 500*10; int primes[SIZE], prime_num; int left[SIZE]; bool is_prime[LIMIT]; char a[MAX/10], b[MAX]...
- Tue Sep 20, 2005 4:37 pm
- Forum: Volume 5 (500-599)
- Topic: 536 - Tree Recovery
- Replies: 19
- Views: 8793
- Fri Sep 16, 2005 6:24 pm
- Forum: Volume 5 (500-599)
- Topic: 536 - Tree Recovery
- Replies: 19
- Views: 8793
RTEEEEE
hello...
i can't figure out of RTE...
would u please help???????
thanks.
i can't figure out of RTE...
would u please help???????
Code: Select all
ACed...// removed
- Fri Sep 16, 2005 6:13 pm
- Forum: Volume 103 (10300-10399)
- Topic: 10329 - Combinatorial Expression
- Replies: 11
- Views: 6372
WAAAAAAAAAAAAAAAAAA
i amm getting WA(i checked the above once... okk)
so i need some MORE
please helppppppp
thanks
so i need some MORE
please helppppppp
thanks
- Fri Sep 16, 2005 5:43 pm
- Forum: Volume 101 (10100-10199)
- Topic: 10164 - Number Game
- Replies: 32
- Views: 11670
ACCCCCCCC
No "a terrific backtrack" would NEVER get TL...I LIKE GN wrote: a terrific backtrack would get TL...
but a very simple "search all possibility" recursion now solves the problem
in 0.035 sec
also it needs MEMOIZATION( and MOD operation to help MEMO...)
thanks to all of uuuuu.
- Fri Sep 16, 2005 5:24 pm
- Forum: Volume 105 (10500-10599)
- Topic: 10551 - Basic Remains
- Replies: 11
- Views: 6251
ACCCCCCCCCC
sorry to bother...
i forgot to add this case in my modified code but as far i remember it was
on my previous WA soln...
any way thanks a lot to all of uuuuuuuu
i forgot to add this case in my modified code but as far i remember it was
on my previous WA soln...
any way thanks a lot to all of uuuuuuuu
- Fri Sep 09, 2005 3:59 pm
- Forum: Volume 104 (10400-10499)
- Topic: 10405 - Longest Common Subsequence
- Replies: 103
- Views: 32266
hello
hello here is an ACC soln #include <stdio.h> #include <string.h> const int MAX = 1005; char x[MAX]={'a'}, y[MAX]={'a'}; int c[MAX][MAX]; void LCS_Length(){ int m = strlen(x)-1, n = strlen(y)-1, i,j; for(i = 1; i<=m; i++) c[i][0] = 0; for(j = 0; j<=n; j++) c[0][j] = 0; for(i = 1; i<=m; i++){ for(j = ...
- Fri Sep 09, 2005 2:38 pm
- Forum: Volume 105 (10500-10599)
- Topic: 10551 - Basic Remains
- Replies: 11
- Views: 6251
WAAAAAAAA
well i change my code a bit
but still wa...
here is my code
thanks...
but still wa...
here is my code
Code: Select all
ACCCd cut offf
- Tue Sep 06, 2005 10:41 pm
- Forum: Volume 1 (100-199)
- Topic: 155 - All Squares
- Replies: 11
- Views: 2375
HELLLLLLLLOOOOOOOOOOOO!!!!!!
hello please help meeeeeeeee!!!!!!!!!!!!!!!!!
tell me where amm i wrong...
or would me mail me a soln?????????????
tell me where amm i wrong...
or would me mail me a soln?????????????
- Tue Sep 06, 2005 9:29 pm
- Forum: Off topic (General chit-chat)
- Topic: What's your sex?
- Replies: 17
- Views: 7633
BE MY FRIEND!!!!!!!!!!
also i would like have
MORE MORE friendship FORM BOTH MALE/FEMALE
i amm
SHYAMA PRASHAD BHATTACHARYYA(ARJUNA BHATTACHARYYA in the ranklist)
mail me: nikhil_119@yahoo.com
i amm asian.
thank UUUUUUU
my friends.............
wating for ur friendly touch of heart

MORE MORE friendship FORM BOTH MALE/FEMALE
i amm
SHYAMA PRASHAD BHATTACHARYYA(ARJUNA BHATTACHARYYA in the ranklist)
mail me: nikhil_119@yahoo.com
i amm asian.
thank UUUUUUU
my friends.............
wating for ur friendly touch of heart









- Tue Sep 06, 2005 9:07 pm
- Forum: Volume 8 (800-899)
- Topic: 884 - Factorial Factors
- Replies: 49
- Views: 28596
SO FASTER!!!!!!!!!!!!!!!!!!!!!!!!
yaa i amm really CONFUSED how people got bellow 2 sec
please HELPPPPPPPPPPPPPPPPP
P.S. i amm used some per-calc then O(1) indexing
please HELPPPPPPPPPPPPPPPPP
P.S. i amm used some per-calc then O(1) indexing