|
|
9222 |
codeforces#P1912G __NO_TITLE__
|
0 / 0 |
(无) |
|
|
9221 |
codeforces#P1912H Hypercatapult Commute
|
0 / 0 |
9 |
|
|
9220 |
codeforces#P1912I __NO_TITLE__
|
0 / 0 |
(无) |
|
|
9219 |
codeforces#P1912J __NO_TITLE__
|
0 / 0 |
(无) |
|
|
9218 |
codeforces#P1912K Kim's Quest
|
0 / 0 |
6 |
|
|
9217 |
codeforces#P1912L LOL Lovers
|
0 / 0 |
3 |
|
|
9288 |
codeforces#P1913A Rating Increase
|
0 / 0 |
3 |
|
|
9287 |
codeforces#P1913B Swap and Delete
|
0 / 0 |
3 |
|
|
9286 |
codeforces#P1913C Game with Multiset
|
0 / 0 |
4 |
|
|
9285 |
codeforces#P1913D Array Collapse
|
0 / 0 |
7 |
|
|
9284 |
codeforces#P1913E Matrix Problem
|
0 / 0 |
9 |
|
|
9283 |
codeforces#P1913F Palindromic Problem
|
0 / 0 |
10 |
|
|
9282 |
codeforces#P1914A Problemsolving Log
|
0 / 0 |
3 |
|
|
9281 |
codeforces#P1914B Preparing for the Contest
|
0 / 0 |
3 |
|
|
9280 |
codeforces#P1914C Quests
|
0 / 0 |
3 |
|
|
9279 |
codeforces#P1914D Three Activities
|
0 / 0 |
4 |
|
|
9278 |
codeforces#P1914E1 Game with Marbles (Easy Version)
|
0 / 0 |
4 |
|
|
9277 |
codeforces#P1914E2 Game with Marbles (Hard Version)
|
0 / 0 |
4 |
|
|
9276 |
codeforces#P1914F Programming Competition
|
0 / 0 |
6 |
|
|
9275 |
codeforces#P1914G1 Light Bulbs (Easy Version)
|
0 / 0 |
7 |
|
|
9274 |
codeforces#P1914G2 Light Bulbs (Hard Version)
|
0 / 0 |
8 |
|
|
9273 |
codeforces#P1915A Odd One Out
|
0 / 1 |
3 |
|
|
9272 |
codeforces#P1915B Not Quite Latin Square
|
0 / 0 |
3 |
|
|
9271 |
codeforces#P1915C Can I Square?
|
1 / 3 |
3 |
|
|
9270 |
codeforces#P1915D Unnatural Language Processing
|
0 / 0 |
3 |
|
|
9269 |
codeforces#P1915E Romantic Glasses
|
0 / 0 |
4 |
|
|
9268 |
codeforces#P1915F Greetings
|
0 / 0 |
5 |
|
|
9267 |
codeforces#P1915G Bicycles
|
1 / 2 |
6 |
|
|
9266 |
codeforces#P1916A 2023
|
1 / 1 |
3 |
|
|
9265 |
codeforces#P1916B Two Divisors
|
1 / 1 |
3 |
|
|
9264 |
codeforces#P1916C Training Before the Olympiad
|
1 / 1 |
4 |
|
|
9263 |
codeforces#P1916D Mathematical Problem
|
0 / 0 |
5 |
|
|
9262 |
codeforces#P1916E Happy Life in University
|
1 / 1 |
8 |
|
|
9261 |
codeforces#P1916F Group Division
|
2 / 2 |
10 |
|
|
9260 |
codeforces#P1916G Optimizations From Chelsu
|
0 / 0 |
10 |
|
|
9259 |
codeforces#P1916H1 Matrix Rank (Easy Version)
|
1 / 1 |
10 |
|
|
9258 |
codeforces#P1916H2 Matrix Rank (Hard Version)
|
1 / 1 |
10 |
|
|
9257 |
codeforces#P1917A Least Product
|
1 / 1 |
3 |
|
|
9256 |
codeforces#P1917B Erase First or Second Letter
|
1 / 1 |
3 |
|
|
9255 |
codeforces#P1917C Watering an Array
|
1 / 1 |
5 |
|
|
9254 |
codeforces#P1917D Yet Another Inversions Problem
|
1 / 2 |
8 |
|
|
9253 |
codeforces#P1917E Construct Matrix
|
1 / 1 |
9 |
|
|
9252 |
codeforces#P1917F Construct Tree
|
1 / 6 |
9 |
|
|
9343 |
codeforces#P1918A Brick Wall
|
1 / 1 |
10 |
|
|
9342 |
codeforces#P1918B Minimize Inversions
|
1 / 1 |
10 |
|
|
9341 |
codeforces#P1918C XOR-distance
|
1 / 1 |
10 |
|
|
9340 |
codeforces#P1918D Blocking Elements
|
1 / 1 |
10 |
|
|
9339 |
codeforces#P1918E ace5 and Task Order
|
1 / 1 |
10 |
|
|
9338 |
codeforces#P1918F Caterpillar on a Tree
|
0 / 0 |
(无) |
|
|
9337 |
codeforces#P1918G Permutation of Given
|
0 / 0 |
(无) |
