http://mirror.codeforces.com/contest/460/submission/7541409
When i run the code on my machine, it gives the correct output whereas here it shows different
# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 163 |
2 | maomao90 | 160 |
3 | adamant | 159 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 150 |
6 | atcoder_official | 148 |
6 | SecondThread | 148 |
8 | nor | 147 |
9 | TheScrasse | 146 |
10 | Petr | 144 |
http://mirror.codeforces.com/contest/460/submission/7541409
When i run the code on my machine, it gives the correct output whereas here it shows different
Name |
---|
First,
with help of Taylor series. It is not 100% accurate, for example,
pow(x, y)
on GNU C++ 4.7 compiler calculates something likepow(5, 2)
may return something like25.0000000000001
or24.9999999999999
. So you can write your own function that calculates xy for integer x and y, or you can useround
function. Also some C++ compilers provide overloadpow(double, long long)
, which will work as intended, because it is binary exponentiation and double type stores integers less than 253 without errors.Second, you declare
d
asint
, but 104·815 + 104 > 109, so overflow will happen.And third, you don't check, whether d < 109.
AC: 7545312