I was practicing and came across 2025E while practicing, a 2200 problem from an educational div2.
If you want, try the problem yourself. Then suppose $$$m = 1000, n = 1000$$$, and see if you can solve it in faster than cubic.
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 154 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 146 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 135 |
| 9 | maroonrk | 133 |
| 10 | cry | 130 |
Solving 2200 rated div2 problem with FFT
I was practicing and came across 2025E while practicing, a 2200 problem from an educational div2.
If you want, try the problem yourself. Then suppose $$$m = 1000, n = 1000$$$, and see if you can solve it in faster than cubic.
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en5 |
|
greateric | 2026-04-10 06:38:31 | 32 | post (published) | |
| en4 |
|
greateric | 2026-04-10 06:36:18 | 27 | finish | |
| en3 |
|
greateric | 2026-04-10 06:30:17 | 1394 | write more | |
| en2 |
|
greateric | 2026-04-10 06:17:13 | 2983 | write stuff | |
| en1 |
|
greateric | 2026-04-10 05:54:42 | 316 | Initial revision (saved to drafts) |
| Name |
|---|


