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.
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 143 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 135 |
| 8 | maroonrk | 133 |
| 9 | BledDest | 132 |
| 10 | qwexd | 129 |
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. | Язык | Кто | Когда | Δ | Комментарий | |
|---|---|---|---|---|---|---|
| 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) |
| Название |
|---|


