Search found 22 matches
- Fri Sep 26, 2003 8:17 pm
- Forum: Volume 105 (10500-10599)
- Topic: 10549 - Russian Dolls
- Replies: 19
- Views: 8323
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...
- Thu Sep 25, 2003 7:45 pm
- Forum: Volume 105 (10500-10599)
- Topic: 10550 - Combination Lock
- Replies: 24
- Views: 22448
- Thu Sep 25, 2003 7:44 pm
- Forum: Volume 105 (10500-10599)
- Topic: 10549 - Russian Dolls
- Replies: 19
- Views: 8323
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...
- Fri Aug 01, 2003 12:25 am
- Forum: Other words
- Topic: small habit
- Replies: 4
- Views: 1221
- Tue Jul 29, 2003 10:45 am
- Forum: Other words
- Topic: What is "USACO"?
- Replies: 6
- Views: 1858
- Tue Jul 29, 2003 8:49 am
- Forum: Volume 105 (10500-10599)
- Topic: 10536 - Game of Euler
- Replies: 10
- Views: 4331
- Mon Jul 28, 2003 2:21 am
- Forum: Other words
- Topic: What is "USACO"?
- Replies: 6
- Views: 1858
- Sun Jul 27, 2003 1:31 am
- Forum: Other words
- Topic: What is "USACO"?
- Replies: 6
- Views: 1858
- Sat Apr 26, 2003 5:55 am
- Forum: Volume 104 (10400-10499)
- Topic: 10419 - Sum-up the Primes
- Replies: 51
- Views: 19043
10419 Sum-up the Primes2
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...
- Fri Aug 02, 2002 1:09 am
- Forum: Volume 101 (10100-10199)
- Topic: 10165 - Stone Game
- Replies: 6
- Views: 3137
10165 - Stone Game
Hi,
Can someone explain the solution to this problem ?
it looks similar to the NIM-game.
Thank you.
Can someone explain the solution to this problem ?
it looks similar to the NIM-game.
Thank you.
- Wed Jul 17, 2002 10:26 pm
- Forum: Volume 101 (10100-10199)
- Topic: 10157 - Expressions
- Replies: 23
- Views: 12885
10157 - Expressions
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...
- Fri Jun 21, 2002 12:40 am
- Forum: Volume 8 (800-899)
- Topic: 847 - A Multiplication Game
- Replies: 41
- Views: 21797
847 - A Multiplication Game
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...
- Mon May 27, 2002 3:46 am
- Forum: Volume 4 (400-499)
- Topic: 429 - Word Transformation
- Replies: 82
- Views: 19944
forget this
so now I have to worry about blank lines??
forget this problem.
forget this problem.
- Sun May 26, 2002 10:27 pm
- Forum: Volume 4 (400-499)
- Topic: 429 - Word Transformation
- Replies: 82
- Views: 19944
how?
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 ...
- Sun May 26, 2002 10:24 pm
- Forum: Other words
- Topic: Programming Competition
- Replies: 4
- Views: 2407
thats ok
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...