C. Engineer Artem I solved this pathetic excuse of a 2000R problem yesterday. I have been trying to find the relation of this problem with FFT and CRT. The guide doesn't say anything related to CRT or FFT. Can anyone explain
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | Radewoosh | 3415 |
| 8 | Um_nik | 3376 |
| 9 | maroonrk | 3361 |
| 10 | XVIII | 3345 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 145 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 132 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: May/17/2026 18:25:19 (g1).
Desktop version, switch to mobile version.
Supported by
In many such problems, tags are given wrong (for example, in roughly $$$80 \%$$$ of problems tagged as dp/greedy, there is no relation to dp/greedy at all). This is one of the things which I feel should be improved about codeforces. I would like to hear your thoughts on this.
Really $$$80$$$% ?.
Most of the problems tagged as DP do have a DP solution as much as I have observed.
Many times some other kind solution is more obvious and easy to click, but that doesn't means there is no DP solution of the problems.