| agc021_f |
Trinity |
AtCoder |
— |
6000ms / 256MB |
| agc022_a |
Diverse Word |
AtCoder |
— |
2000ms / 256MB |
| agc022_b |
GCD Sequence |
AtCoder |
— |
2000ms / 256MB |
| agc022_c |
Remainder Game |
AtCoder |
— |
2000ms / 256MB |
| agc022_d |
Shopping |
AtCoder |
— |
2000ms / 256MB |
| agc022_e |
Median Replace |
AtCoder |
— |
2000ms / 256MB |
| agc022_f |
Checkers |
AtCoder |
— |
2000ms / 256MB |
| agc023_a |
Zero-Sum Ranges |
AtCoder |
— |
2000ms / 256MB |
| agc023_b |
Find Symmetries |
AtCoder |
— |
2000ms / 256MB |
| agc023_c |
Painting Machines |
AtCoder |
— |
2000ms / 256MB |
| agc023_d |
Go Home |
AtCoder |
— |
2000ms / 256MB |
| agc023_e |
Inversions |
AtCoder |
— |
3000ms / 256MB |
| agc023_f |
01 on Tree |
AtCoder |
— |
2000ms / 256MB |
| agc024_a |
Fairness |
AtCoder |
— |
2000ms / 256MB |
| agc024_b |
Backfront |
AtCoder |
— |
2000ms / 256MB |
| agc024_c |
Sequence Growing Easy |
AtCoder |
— |
2000ms / 256MB |
| agc024_d |
Isomorphism Freak |
AtCoder |
— |
2000ms / 256MB |
| agc024_e |
Sequence Growing Hard |
AtCoder |
— |
2000ms / 256MB |
| agc024_f |
Simple Subsequence Problem |
AtCoder |
— |
2000ms / 256MB |
| agc025_a |
Digits Sum |
AtCoder |
— |
2000ms / 256MB |
| 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 |