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.
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 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | adamant | 152 |
| 3 | Proof_by_QED | 146 |
| 3 | Um_nik | 146 |
| 5 | Dominater069 | 144 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
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.