| # | 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 |
How to break this hash function on arrays?
My hash has 3 fields
f1 = size of interval f2 = sum of array elements over interval(a[i] +a[i+1]...a[j]) f2 = sum of squares of array elements over interval(a[i]^2 + a[i+1]^2 .. a[j]^2).
if all 3 matches, then elements are indeed same.
Can this be broken?
P.S. While in attempt to solve D from previous contest(https://mirror.codeforces.com/contest/1284/problem/D). I was looking for this question.
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
gagannagpal68 | 2020-01-05 07:15:55 | 6 | ||
| en1 |
|
gagannagpal68 | 2020-01-05 07:15:07 | 450 | Initial revision (published) |
