[Mirror] Bach Khoa Coding Challenge #3
Bài
| # | Bài | Time limit | Memory limit |
|---|---|---|---|
| A | Arcane Crystal Fusion | 2.0 | 512M |
| B | Botanical Garden | 2.0 | 512M |
| C | Candies For The Children | 5.0 | 512M |
| D | Data Normalization | 2.0 | 1G |
| E | Efficient Arrangement | 1.0 | 256M |
| F | Farmer's Field | 2.0 | 256M |
| G | Guessing game | 1.0 | 256M |
| H | Harmonization Module | 1.0 | 256M |
| I | Intervals of the Sequence | 6.0 | 1G |
| J | Jewels of Illumination | 1.0 | 256M |
| K | King of the Casino | 3.0 | 256M |
| L | Lumberjack | 1.5 | 256M |
| M | Military Base | 3.0 | 512M |
Thông báo
| Thời gian | Tiêu đề | Mô tả |
|---|---|---|
| Tháng 12 6, 2025, 14:27 | Problem - F |
The sum of m in all testcases does not exceed 200000. |
Đang tải...