How can I find out whether the problem is a Special Judge Problem or NOT ? Do there are any common condition or specification for identifying this type of problem ? 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 |
How can I find out whether the problem is a Special Judge Problem or NOT ? Do there are any common condition or specification for identifying this type of problem ? Thanks in advance.
Название |
---|
What does special judge problem mean?
I think he means Interactive Problems. Although I could be wrong.
What is Interactive Problem?
A problem with many different possible solutions . ( May Be)
Oh. There's no specification for that. Those problems can be found readily on CodeForces only. Just go to a2oj.com, start doing any A/B/C ladder, and you'll find a heck lot of problems having many possible solutions, and we got to print any one of them.
It's usually written in the statement.
I didn't get it written in CF 359 B -_-
Note
Note that you don't have to minimize the number of operations. Any solution that performs at most 20 000 operations is allowed.
Except it is.