I have found that this solution is skipped 8255696.
why is that? what is the reason behind?
though this solution gets accepted after resubmitting!
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | Dominater069 | 154 |
8 | awoo | 154 |
10 | luogu_official | 150 |
I have found that this solution is skipped 8255696.
why is that? what is the reason behind?
though this solution gets accepted after resubmitting!
Name |
---|
Because that solution looks similar as this one 8255446. Thus it got skipped as the verdict.
It is very surprising. The contestants kifayat and rodeo_kt have same solutions for problem B and C.
http://codeforces.net/profile/kifayat
http://codeforces.net/contest/478/submission/8255696
http://codeforces.net/contest/478/submission/8258568
http://codeforces.net/profile/rodeo_kt
http://codeforces.net/contest/478/submission/8255446
http://codeforces.net/contest/478/submission/8257730
ehhh= =isn't this common in simple language tasks?
Bitwise equivalence of source code does not happen that easy even in simple tasks. People tend to have different coding styles (e.g. spacing), put statements in different order, add or remove empty lines for clarity, name variables differently, evaluate expressions in different order depending on how they got to the solution.
The only problem I can think of where bitwise equivalence may actually happen with a good probability is "print integer four and ignore input".