For some reason my code isn't working on CodeForces but outputs the correct answer on my machine; I attached the code.91654081
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | awoo | 158 |
4 | cry | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 152 |
10 | maroonrk | 151 |
Name |
---|
Check this out.
What difference will the left shift make than multiplying by 2 here?
You should rather google it before posting it on a thread that way you could get your problem solved faster and without increasing the number of "compiler difference" posts. It's because your local system and codeforces don't obey to the same rules. Your local machine might initialise a vector of size n with zeroes but codeforces might do the same with some garbage value. Same with the case of overflows and underflows.