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 | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 150 |
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.