COJ Forum

What happens with the COJ server? Is this a blackout???

It's a great idea!!! Thank you...

http://coj.uci.cu/24h/problem.xhtml?abb=1129 I have proved, by using assert(n<=50) that in this problem, the data test has parts of sticks with more than 50 units long, and that's not possible according to the problem, please fix this as soon as possible, and on the other hand you should specify th...

Thanks mukel, I've been looking for it a long time, I'll let you know if I translate it, anyway some days ago I found this one, but I don't know wether it works or not ;) #include <iostream> #include <cstring> using namespace std; const int nMax = 250; const bool black = false; const bool red = true...

I think there should be a forum for posting references of books and related articles in order to gain knowledge, and maybe some downloads site, managed by the administrators...

It's true, the same happen't to me Or we misunderstood the problem, or the data tests are completely wrong....

Does anybody know about an efficient implementation of an algorithm for solving this problem? I mean an implementation short enough to be written during a contest...

I have a question, does anybody know where to find the acm-icpc finals data tests, because I can only find the 2011's one. And my other question is if there is some kind of official solution for the same competition??