| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
Hello codeforces community,
My submission Contest of DIV2A failed in system tests whereas it passed in practice after making one change Link.The only change i made was that i changed if(n-s.size()<0) to if(n<s.size()).I am unable to understand why the initial code didnt work.
Any help would be appreciated.
size() function always returns unsigned int and if u try to store negative numbers then it rotates the cycle and hence -1 is stored as 4294967295(Unsigned int MAX),-2 is stored as 4294967294(Unsigned int MAX-1),....
In test 12 s.size() returns 13 due to which becomes -s.size() becomes 4294967283. now n — s.size() = n + (-s.size()) = 1 + 4294967283 = 4294967284.
Happy coding :)