OJ Board

My spaces did not appear in the post. What I wrote was


For instance:
aaa
___aaaaaaaaaaaaaaaaaa<assume 73 chars>
aaa


turns into:

aaa

aaaaaaaaaaaaaaaaaa<assume 73 chars>
aaa

..where _ means space

I just solved this problem after much trouble. It appears that the test data for this problem is possibly wrong. The straightforward greedy method does not optimize the line lengths, but the test data seems to be based on this algorithm. To answer your question, if you have spaces and then a 73 char...

IMO, floyd warshall is the best algorithm to use here. It's easier to type in than any of the sinle souce shortest path algorithms, and it is fast enough.

Shouldn't there be a link to the default time limit, stack size, and total memory size available somewhere on the main problemset page?

Why is it that when I try to have a 2xxx problem judged via the online submitter linked to from the main acm.uva.es page, I get "can't be judged", but if I hit the little submit button by the problem on acm.uva.es/archive, my submissions are able to be judged? Is this going to be fixed soo...

Right, that works, but it is odd that my simple code above breaks their compiler.

When submitting the code below for problem 10033, I get a SIGSEGV runtime error, which I think means a segfault. [cpp] #include <iostream> #include <cstdio> #include <sstream> #include <algorithm> #include <string> using namespace std; int main(){ int tests; string temp; istringstream iss; getline(c...