https://codeforces.net/contest/1175/submission/238928196 For judging whether an array of length n is a 1~n permutation, I judged its sum{i^1} sum{i^2} sum{i^3} sum{i^4} and passed. Can anyone hack this solution or prove it correct? please help me :(
# | 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 |
https://codeforces.net/contest/1175/submission/238928196 For judging whether an array of length n is a 1~n permutation, I judged its sum{i^1} sum{i^2} sum{i^3} sum{i^4} and passed. Can anyone hack this solution or prove it correct? please help me :(
Name |
---|
It's incorrect.
Try this:
Maybe it will be difficult to construct a counterexample if you compute powers up to like $$$100$$$ and do some hashing.