2025 USACO.Guide Informatics Tournament
12 problems from 2025 USACO.Guide Informatics Tournament (contest 105786), difficulty -. 1/12 solutions verified against sample I/O.
2025 USACO.Guide Informatics Tournament
Special | 12 problems | 1/12 verified | Difficulty - | 11m 44s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Shortest Substring | 25s | ||||
| B | Alya and Permutation Revisited | 23s | ||||
| C | Combination Lock | 26s | ||||
| D | Strictly Increasing | 38s | ✓ | |||
| E | Good Array | 2m 19s | ||||
| F | 7s | 26s | ||||
| G | Miyamura and Cake | 24s | ||||
| H | Shortest Subarray | 19s | ||||
| I | GCD Splicing | 25s | ||||
| J | Making 0s | 5m 16s | ||||
| K | Hydra | 20s | ||||
| L | Quicksort | 23s |