| arc187_e |
Replace Triplets |
AtCoder |
— |
2000ms / 256MB |
| arc188_a |
ABC Symmetry |
AtCoder |
— |
2000ms / 256MB |
| arc188_b |
Symmetric Painting |
AtCoder |
— |
2000ms / 256MB |
| arc188_c |
Honest or Liar or Confused |
AtCoder |
— |
2000ms / 256MB |
| arc188_d |
Mirror and Order |
AtCoder |
— |
2000ms / 256MB |
| arc188_e |
Gravity Sort |
AtCoder |
— |
2000ms / 256MB |
| arc189_a |
Reversi 2 |
AtCoder |
— |
2000ms / 256MB |
| arc189_b |
Minimize Sum |
AtCoder |
— |
2000ms / 256MB |
| arc189_c |
Balls and Boxes |
AtCoder |
— |
3000ms / 256MB |
| arc189_d |
Takahashi is Slime |
AtCoder |
— |
5000ms / 256MB |
| arc189_e |
Straight Path |
AtCoder |
— |
2000ms / 256MB |
| arc190_a |
Inside or Outside |
AtCoder |
— |
2000ms / 256MB |
| arc190_b |
L Partition |
AtCoder |
— |
2000ms / 256MB |
| arc190_c |
Basic Grid Problem with Updates |
AtCoder |
— |
5000ms / 256MB |
| arc190_d |
Matrix Pow Sum |
AtCoder |
— |
2000ms / 256MB |
| arc190_e |
Gaps of 1 or 2 |
AtCoder |
— |
5000ms / 256MB |
| arc191_a |
Replace Digits |
AtCoder |
— |
2000ms / 256MB |
| arc191_b |
XOR = MOD |
AtCoder |
— |
2000ms / 256MB |
| arc191_c |
A^n - 1 |
AtCoder |
— |
2000ms / 256MB |
| arc191_d |
Moving Pieces on Graph |
AtCoder |
— |
2000ms / 256MB |
| arc191_e |
Unfair Game |
AtCoder |
— |
2000ms / 256MB |
| arc192_a |
ARC Arc |
AtCoder |
— |
2000ms / 256MB |
| arc192_b |
Fennec VS. Snuke 2 |
AtCoder |
— |
2000ms / 256MB |
| arc192_c |
Range Sums 2 |
AtCoder |
— |
2000ms / 256MB |
| arc192_d |
Fraction Line |
AtCoder |
— |
2000ms / 256MB |
| arc192_e |
Snuke's Kyoto Trip |
AtCoder |
— |
2000ms / 256MB |
| arc193_a |
Complement Interval Graph |
AtCoder |
— |
2000ms / 256MB |
| arc193_b |
Broken Wheel |
AtCoder |
— |
2000ms / 256MB |
| arc193_c |
Grid Coloring 3 |
AtCoder |
— |
4000ms / 256MB |
| arc193_d |
Magnets |
AtCoder |
— |
2000ms / 256MB |
| arc194_a |
Operations on a Stack |
AtCoder |
— |
2000ms / 256MB |
| arc194_b |
Minimum Cost Sort |
AtCoder |
— |
2000ms / 256MB |
| arc194_c |
Cost to Flip |
AtCoder |
— |
2000ms / 256MB |
| arc194_d |
Reverse Brackets |
AtCoder |
— |
2000ms / 256MB |
| arc194_e |
Swap 0^X and 1^Y |
AtCoder |
— |
2000ms / 256MB |
| arc195_a |
Twice Subsequence |
AtCoder |
— |
2000ms / 256MB |
| arc195_b |
Uniform Sum |
AtCoder |
— |
5000ms / 256MB |
| arc195_c |
Hamiltonian Pieces |
AtCoder |
— |
2000ms / 256MB |
| arc195_d |
Swap and Erase |
AtCoder |
— |
2000ms / 256MB |
| arc195_e |
Random Tree Distance |
AtCoder |
— |
2000ms / 256MB |
| arc196_a |
Adjacent Delete |
AtCoder |
— |
2000ms / 256MB |
| arc196_b |
Torus Loop |
AtCoder |
— |
2000ms / 256MB |
| arc196_c |
Strongly Connected |
AtCoder |
— |
4000ms / 256MB |
| arc196_d |
Roadway |
AtCoder |
— |
3000ms / 256MB |
| arc197_a |
Union of Grid Paths |
AtCoder |
— |
2000ms / 256MB |
| arc197_b |
Greater Than Average |
AtCoder |
— |
2000ms / 256MB |
| arc197_c |
Removal of Multiples |
AtCoder |
— |
4000ms / 256MB |
| arc197_d |
Ancestor Relation |
AtCoder |
— |
2000ms / 256MB |
| arc197_e |
Four Square Tiles |
AtCoder |
— |
2000ms / 256MB |
| arc198_a |
I hate 1 |
AtCoder |
— |
2000ms / 256MB |