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.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 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.
There was already finished NEERC in Armenia,Uzbekistan,Georgia and Kazakhstan. Here are final standings.Team that solved most of all from this countries is from Armenia (8 problems).Results
Название |
---|