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.
# | User | Rating |
---|---|---|
1 | tourist | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 158 |
5 | atcoder_official | 156 |
6 | Qingyu | 154 |
7 | djm03178 | 152 |
7 | adamant | 152 |
9 | luogu_official | 150 |
10 | awoo | 147 |
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.
Name |
---|
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.