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.
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) |