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 | 3773 |
| 3 | Radewoosh | 3646 |
| 4 | ecnerwala | 3624 |
| 5 | jqdai0815 | 3620 |
| 5 | Benq | 3620 |
| 7 | orzdevinwang | 3612 |
| 8 | Geothermal | 3569 |
| 8 | cnnfls_csy | 3569 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | awoo | 161 |
| 2 | maomao90 | 160 |
| 3 | nor | 157 |
| 4 | atcoder_official | 156 |
| 4 | cry | 156 |
| 6 | -is-this-fft- | 155 |
| 7 | maroonrk | 154 |
| 7 | adamant | 154 |
| 9 | Um_nik | 152 |
| 10 | djm03178 | 146 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 01.09.2024 09:37:50 (l1).
Десктопная версия, переключиться на мобильную.
При поддержке
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.