OJ Board

I am getting WA :( I think this problem should be solving by finding grundy number for each row, then applying nim on them as if they are piles size. I could not code efficient grundy, so through small brute force, i thought grundy of row will be equal to: sum of powers for all prime numbers in a ro...

Hmmm, How to handle the infinity case?, My Gaussian either says (we have sol, no sol, infinite ones)
I passed all the samples with wrong judging on infinity case.

I figured out the solution, thx

I have solved the problem using hashing, but do not know how to modify KMP to find answer. What I understood, solving following the problem will be the solution : Given String, Find longest prefix that is palindrome. Correct me if i am wrong. Also it is same as given string A, and its reversed one B...

Hi, When you have an Array, and required to find Sub-Array with certain criteria, usually this is done by "sliding window". sliding window means with a window with a size on input. E.g. imagine array 1 2 3 4 5 6, and we move with FIXED size window 3. in 1st iteration, window cover 1 2 3 in 2nd itera...

Thx so much.
I discovered my bug.

Hi, this is already how i did it, but last simple is not right. while(cin>>EV1>>EV2>>AT>>D && (EV1+EV2+D+AT)) { clr(vis, 0); cout.setf(ios::fixed|ios::showpoint ); cout.precision(1); double n1 = EV1/D, n2 = EV2/D; double p1, p2; if(AT == 3) { p1 = n1/(n1+n2); p2 = n2/(n1+n2); } else { // won't work ...

I still can not figure out how to solve it. Can any one gives more explanation.

Can you please give me more details? What is the approach for solving this problem?
and please elaborate more on "Gambler ruin"

The Hints here is not enough for me, Can some one go more in details. All what I realized alone that given input like: a0 b0 c0 a1 b1 c1 a2 c2 b2 and target ration at bt ct We can have matrix as following in relation AX = Y = factor * Y' A = a0 a1 a2 b0 b1 b2 c0 c1 c2 X = // This is the factor matri...

Thanks so much for your reply. I got it AC. I did not understand ur 2, 2.1, 2.2 points, BUT point 1 helped me to convert my N^4 to N^3 My idea was 1. PRECOMPUTE lis [j], which is the length of longest increasing seqeunce at row i (only), starting from j. -> O(N^3) 2. For each 2 column, assume ur new...

Can any body give me hints for this problem. I stopped coding as I realized my order is big. I thought in trying all rectangles (each rectangle start at first row & end at last col), and for each rectangle I do a sliding window in Order (rectangle size). But I believe this is much. for (int c1 = 0; ...

Hi again;

I got AC, after figuring out my stupid typo.

In ur code, no problems except the case I mentioned above. This case answer should be ZERO.

Otherwise, the problem is direct in its input & output.

GoodLuck

Hi, I have tried it now. I also got WA.
our codes is same way, but i think u have another bug.

When u START searching from i, j, you do not mark this position as visited, so it may be used again

If i am right, then your code will fail in this case

Hi all, I need some help in this problem, I am suffering from TLE. My code use only arrays, and i implement double linked list ( using 2 arrays L, R). I also use scanf, printf. What else I can do?!!!! Please if any one has Hints, I will be happy. Edit: Passed 1.3s, I called function f(str a, str b) ...