Why this solution got AC ?! I couldn't understand. Can someone hack this solution ?!
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 161 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
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).