OJ Board

... 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... (i got...

i like to solve recurrences most, recursion, backtrack and DP all i love so much ...
...
...
NOW I AM THE WORSHIPER OF
HURISTICS!!!!

RSS

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...

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]...

please help meeeeeee!!!!!!!!!!

hello...
i can't figure out of RTE...
would u please help??????? thanks.

i amm getting WA(i checked the above once... okk)
so i need some MORE
please helppppppp
thanks

I LIKE GN wrote: a terrific backtrack would get TL...

No "a terrific backtrack" would NEVER 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.

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

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 = ...

well i change my code a bit
but still wa...
here is my code thanks...

hello please help meeeeeeeee!!!!!!!!!!!!!!!!!
tell me where amm i wrong...
or would me mail me a soln?????????????

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

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