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.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3821 |
3 | Benq | 3736 |
4 | Radewoosh | 3631 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3388 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
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.
Name |
---|