| # | 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 |
Who can hack me in 1307D ???
I passed 1307D - Cow and Fields with code which is obviously wrong! Because I solve the promble in this way: - if k<7000 using the $$$O(n^2)$$$ algorithm. - else use a obviously fake algorithm which should be hacked.
Submission is here : 71566996
Who can hack me?
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
JinhaiChen | 2020-02-21 20:51:38 | 2 | Tiny change: 'his way:\n- if k<7' -> 'his way:\n\n- if k<7' | |
| en1 |
|
JinhaiChen | 2020-02-21 20:51:03 | 303 | Initial revision (published) |
