Search found 3 matches
Search found 3 matches • Page 1 of 1
- Sat Sep 17, 2005 7:57 pm
- Forum: Volume 100 (10000-10099)
- Topic: 10003 - Cutting Sticks
- Replies: 59
- Views: 24617
Hey, I implemented a solution similar to matrix-chain multiplication. Because it is an O(n^3) algorithm, and n is at most 51, I shouldn't have to worry about anything else, right? I have no idea what is wrong. Here is my code: // Headers, etc... #define in cin using namespace std; vector<int> CutSpo...
- Sat Jun 25, 2005 2:14 am
- Forum: Algorithms
- Topic: Question about an ACM-ICPC live archive problem
- Replies: 0
- Views: 744
This one, 3079 - Anti-prime sequences, is from the East Central (North America) regionals. My friend and I decided to take a backtracking approach, but apparently it isn't fast enough. What is the correct algorithm, and what did we do wrong? #include <iostream> #include <fstream> #include <string> #...