Can someone suggest a website where I can host a private contest for particular users for free.

Or some PC application that will do the same job (besides e-judge).

Thanks in advance.

This is just to remind that tomorrow on November 8 the ACM-ICPC Subregional contest will be held in Georgia, Armenia, Kazakhstan, Uzbekistan, Russia (St. Petersburg, Novosibirsk, Vladivostok). Good luck to all teams...!!!

I am trying to solve the problem 320B - Ping-Pong (Easy Version) with BFS, but getting wrong answer. The idea is as follows: If we add a pair (a,b) to our set, then I check the ways with remaining pairs in my massive "mark". So if we can move from pair x to y than mark[x][y]=1. Otherwise it equals 0.

In case of checking way form x to y I am using BFS. I starting to seek from peak x until y will be found. Otherwise I print No.

Please someone help me to find the mistake in my 3956387 solution.

Thanks.