OJ Board

Lain: my original idea was indeed flawed, but i fixed it up. the new algorithm is just as fast, but uses slightly more memory. we change the original recurrence relation, and introduce a new one. first, let us distinguish between the 2 sequences we're trying to find by calling them primary, and seco...

you're probably rotating clockwise instead of counter-clockwise.
and vice versa.

I think LIS stands for Longest Increasing Subsequence. this approach doesn't look promising though, say we have N=100 and the longest inc. subseq. has length 150, how do you decide which 50 dolls to throw out so that they fit into the other sequence? this is just as hard as the original problem. Any...

I would also suggest that when people post a msg about a new problem that they include the problem NAME, and not just the number.
it's a lot easier to recognize problems by name, rather than by somewhat large integers.

its been years since i've been there, but my guess is the problem id is "ride". there is no need to guess though, everything is explained clearly in the text files; try to read them more carefully.

the correct term is MEMOIZATION, not memorization.
it's a form of Dynamic Programming (top-down instead of bottom-up).

usually about 4 times per year.

http://ace.delos.com/usacogate
http://www.usaco.org

Hi, I've been working on this problem for several hours and I always get Time Limit Exceeded when I submit my solution. I solved this problem using DP. consider an array char can[801][64][13]; can[n][k][t] = is it possible to sum to n, using numbers from among the first k primes, using exactly t num...

Hi,
Can someone explain the solution to this problem ?
it looks similar to the NIM-game.

Thank you.

I can't figure out why my solution is wrong for this problem. here is my code: [cpp] #include <stdio.h> long long ways[400][200]; long long sum[400][200]; long long getways( int n, int d ); long long anyN( int k, int f ){ long long m=0; if ( k<0 || f<0 ) return 0; if ( sum[k][f] != -1 ) return sum[k...

Hi, I came up with a O( 9lg(n) ) algorithm for this problem, but it's not one of the fastest programs on the ranklist. It runs in 0.06seconds whereas most people do it in 0.00. Can someone please explain how to solve this problem differently from the way i solved it (i just used basic dynamic progra...

so now I have to worry about blank lines??
forget this problem.

the problem statement states that after the pairs of words there is a EOF so how can you have multiple input?? assuming its possible to have multiple input how can you distinguish between the end of the pairs of words section and the start of a new data set? you can answer this by modifying my code ...

yeah, you have to be 18 to get paid but I think this is a blessing in disguise. when you know that you're not going to get any money you don't stress during the contest and as a result perform better and learn more. so by the time you're old enough to make money you'll have had a lot of practice and...