| agc025_b |
RGB Coloring |
AtCoder |
— |
2000ms / 256MB |
| agc025_c |
Interval Game |
AtCoder |
— |
2000ms / 256MB |
| agc025_d |
Choosing Points |
AtCoder |
— |
2000ms / 256MB |
| agc025_e |
Walking on a Tree |
AtCoder |
— |
2000ms / 256MB |
| agc025_f |
Addition and Andition |
AtCoder |
— |
2000ms / 256MB |
| agc026_a |
Colorful Slimes 2 |
AtCoder |
— |
2000ms / 256MB |
| agc026_b |
rng_10s |
AtCoder |
— |
2000ms / 256MB |
| agc026_c |
String Coloring |
AtCoder |
— |
3000ms / 256MB |
| agc026_d |
Histogram Coloring |
AtCoder |
— |
2000ms / 256MB |
| agc026_e |
Synchronized Subsequence |
AtCoder |
— |
2000ms / 256MB |
| agc026_f |
Manju Game |
AtCoder |
— |
2000ms / 256MB |
| agc027_a |
Candy Distribution Again |
AtCoder |
— |
2000ms / 256MB |
| agc027_b |
Garbage Collector |
AtCoder |
— |
2000ms / 256MB |
| agc027_c |
ABland Yard |
AtCoder |
— |
2000ms / 256MB |
| agc027_d |
Modulo Matrix |
AtCoder |
— |
2000ms / 256MB |
| agc027_e |
ABBreviate |
AtCoder |
— |
2000ms / 256MB |
| agc027_f |
Grafting |
AtCoder |
— |
5000ms / 256MB |
| agc028_a |
Two Abbreviations |
AtCoder |
— |
2000ms / 256MB |
| agc028_b |
Removing Blocks |
AtCoder |
— |
2000ms / 256MB |
| agc028_c |
Min Cost Cycle |
AtCoder |
— |
2000ms / 256MB |
| agc028_d |
Chords |
AtCoder |
— |
2000ms / 256MB |
| agc028_e |
High Elements |
AtCoder |
— |
2000ms / 256MB |
| agc028_f |
Reachable Cells |
AtCoder |
— |
4000ms / 256MB |
| agc028_f2 |
F2 - Reachable Cells |
AtCoder |
— |
9000ms / 256MB |
| agc029_a |
Irreversible operation |
AtCoder |
— |
2000ms / 256MB |
| agc029_b |
Powers of two |
AtCoder |
— |
2000ms / 256MB |
| agc029_c |
Lexicographic constraints |
AtCoder |
— |
2000ms / 256MB |
| agc029_d |
Grid game |
AtCoder |
— |
2000ms / 256MB |
| agc029_e |
Wandering TKHS |
AtCoder |
— |
2000ms / 256MB |
| agc029_f |
Construction of a tree |
AtCoder |
— |
4000ms / 256MB |
| agc030_a |
Poisonous Cookies |
AtCoder |
— |
2000ms / 256MB |
| agc030_b |
Tree Burning |
AtCoder |
— |
2000ms / 256MB |
| agc030_c |
Coloring Torus |
AtCoder |
— |
2000ms / 256MB |
| agc030_d |
Inversion Sum |
AtCoder |
— |
3000ms / 256MB |
| agc030_e |
Less than 3 |
AtCoder |
— |
2000ms / 256MB |
| agc030_f |
Permutation and Minimum |
AtCoder |
— |
3000ms / 256MB |
| agc031_a |
Colorful Subsequence |
AtCoder |
— |
2000ms / 256MB |
| agc031_b |
Reversi |
AtCoder |
— |
2000ms / 256MB |
| agc031_c |
Differ by 1 Bit |
AtCoder |
— |
2000ms / 256MB |
| agc031_d |
A Sequence of Permutations |
AtCoder |
— |
2000ms / 256MB |
| agc031_e |
Snuke the Phantom Thief |
AtCoder |
— |
5000ms / 256MB |
| agc031_f |
Walk on Graph |
AtCoder |
— |
2000ms / 256MB |
| agc032_a |
Limited Insertion |
AtCoder |
— |
2000ms / 256MB |
| agc032_b |
Balanced Neighbors |
AtCoder |
— |
2000ms / 256MB |
| agc032_c |
Three Circuits |
AtCoder |
— |
2000ms / 256MB |
| agc032_d |
Rotation Sort |
AtCoder |
— |
2000ms / 256MB |
| agc032_e |
Modulo Pairing |
AtCoder |
— |
2000ms / 256MB |
| agc032_f |
One Third |
AtCoder |
— |
2000ms / 256MB |
| agc033_a |
Darker and Darker |
AtCoder |
— |
1000ms / 256MB |
| agc033_b |
LRUD Game |
AtCoder |
— |
2000ms / 256MB |