OJ Board

I don't see how Stan can achieve a 7 for the sample test. For every vertical line he chooses, Olie can push him below 7 ?!

Marian or everybody else,

Do you know some good books about Grundy-Sprague numbers?

Thanks

Exatcly including all headers that define functions used in my source code is the point. Sometimes I forget the include files, compile the program with g++, the compiler does not complain because the needed include files are included from somewhere else and then I get a compile error from the judge ...

What conservation of energy do you mean and how do you use it to solve the problem? I have been thinking the following way:

Bond will reach its downmost position when the force pulling him up becomes equal to the force pulling him down:

w*9.81 = k*dl

Thus, we determine dl - how much the rope is ...

The n^2 algorithm most probably won't do. Is there a n*log(n) algorithm for this problem?

I use g++ to compile my programs. With g++ it's not necessary to include all the needed header files from the standard library. This often causes compile errors. What option should I compile my programs with in order to enforce checking that all the necessary header files are included?

Thanks

Thank you guys

How is this problem solved? It appears everybody but me solved it

Thanks guys,

I am still curious for some more info. With regard to speed, I wonder whether I come up with just too long solutions in order to write and debug them in less than half an hour. For example, for the last contest the number of lines for my programs (C++) are as follows:

A - 59 lines
B ...

Hi guys,

I just wondered how you were able to solve all the problems so quickly. Did you use code that was written before or you solved the problems from scratch? Did you know the problems beforehand?

The problems were not that difficult but still what you did was really admirable. The winner ...

I like this problem but unfortunately don't know how to solve it. Could you explain the idea of the solution?

I am also getting constantly WA altough I read everything in the forum very carefully. I tested my convex hull algorithm also with several other problems but I get only one answer here - WA.

2nibbler & 2eduard:

Don't use floating point arithmetic. You can do everything with integer arithmetic.

Hi guys,

I have recently wondered about efficient algorithms concerning three algorithmic problems:

1. Given a directed graph G = (V, E) find the symmetric complement G = (V, E') such that if (u,v) is in E then (u,v) and (v,u) are in E'. For any two vertices u, v in V there can be at most one edge ...

Isn't there a reference for the kth shortest path after all?