UMN CPP FFT 2025-11 (v2)
Problems
| Name | Solved / Tries | Average tries | Average tries to solve | |
|---|---|---|---|---|
| A | Naïve Convolution | 0/0 (0%) | -- | -- |
| B | A+B Problem | 0/0 (0%) | -- | -- |
| C | K-Inversions | 0/0 (0%) | -- | -- |
| D | Alien Codebreaking | 0/0 (0%) | -- | -- |
| E | Binary Voting | 0/0 (0%) | -- | -- |
| F | Number Theoretic Transform | 0/0 (0%) | -- | -- |