Why this solution got AC ?! I couldn't understand. Can someone hack this solution ?!
# | User | Rating |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
1 | maomao90 | 161 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | atcoder_official | 148 |
5 | -is-this-fft- | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
10 | TheScrasse | 142 |
Why this solution got AC ?! I couldn't understand. Can someone hack this solution ?!
Name |
---|
This is a totally normal solution
AC solution with random ?!
During the contest I wanted to do this and I wrote the solution but I was afraid to submit it :D
I think that nobody can hack a randomized solution purposely.
In fact rand() % n must be less than 32767, because codeforces is in WINDOWS. And the solution does this 3000000 times, the probability that [0,32767) is perfectly covered is very high, according to the editorial, either of the number of two candies will be less than
, also less than 32767, therefore the solution is correct and cannot be hacked.
(2016.09.08 updated — now rand() in win10 will yield numbers in [0, 2^31)).
elin sokdunay jigim
Perfect solution XD
tohdon has already explained what's going here, I'll add that when you are using proper random generator such as
mt19937
, this solution fails on third test with TL (original 10606822) or WA (10606853, number of attempts divided by 4).