Anyone with an UVA account can take part in the contest.

You can ask questions that actually make sense, for example. Because this one doesn't.

If it happens at the same time as the real contest, look here for your timezone:

http://www.timeanddate.com/worldclock/fixedtime.html?iso=20140913T14&p1=652&ah=5

G — using bitmask+bfs:

You have only ten letters, for all of them, you can either use it only lowercase or only uppercase. You can use a bitmask to represent this, each bit 0 = using lower, 1 = using upper.

Iterate all possible bitmasks, then for each one try to do a BFS following that rule.

This is O((2^L)*N), but since L=10 and N=100^2 it's ok. (edit: N=100^2, not 100)

-- E:

We could not solve it during contest time and we were thinking about the same approach. Try this test case on your solution, maybe this is what fails (our approach was failing cases similar to this):

4 10
1 1 1 1 1
1 2 2 2 1
1 2 1 2 2
2 2 2 2 1

Answer should be 20

Try everything! Translate the olives to have the first starting at 0. Let's say the size of the pizza is X=C/N. Fix the start of the first slice at point -X and check if the solution is correct, then try with -X+1, -X+2, ... until 0, where things are repeated again and you stop (the first slice is now the second one..). You will try C/N times and check if the N olives fit, this yields a runtime of O(C/N*N) = O(C).

Also, if it helps, the tricky test case is when you have 2 olives right next to each other in the beginning.

Let's say, you have 3 slices on a pizza with size 12 and olives on 1, 2, 8. This is possible. (This was the type of test case that many people that asked me about it after the contest was failing to solve).