Tasks
| Task Name | Time Limit | Memory Limit | |
|---|---|---|---|
| A | Rearranging ABC | 2 sec | 1024 MiB |
| B | Adjacent Squares | 2 sec | 1024 MiB |
| C | Weak Password | 2 sec | 1024 MiB |
| D | Hammer | 2 sec | 1024 MiB |
| E | Neo-lexicographic Ordering | 2 sec | 1024 MiB |
| F | Ameba | 2 sec | 1024 MiB |
| G | Polynomial division | 2 sec | 1024 MiB |
| H | Defect-free Squares | 2 sec | 1024 MiB |
| I | Problem where +s Separate Digits | 2 sec | 1024 MiB |