|
|
9593 |
codeforces#P1956E2 Nene vs
|
0 / 0 |
10 |
|
|
9592 |
codeforces#P1956F Nene and the Passing Game
|
0 / 0 |
10 |
|
|
9591 |
codeforces#P1957A Stickogon
|
0 / 0 |
3 |
|
|
9590 |
codeforces#P1957B A BIT of a Construction
|
0 / 0 |
3 |
|
|
9589 |
codeforces#P1957C How Does the Rook Move?
|
0 / 0 |
5 |
|
|
9588 |
codeforces#P1957D A BIT of an Inequality
|
0 / 0 |
6 |
|
|
9587 |
codeforces#P1957E Carousel of Combinations
|
0 / 0 |
9 |
|
|
9586 |
codeforces#P1957F1 Frequency Mismatch (Easy Version)
|
0 / 0 |
10 |
|
|
9585 |
codeforces#P1957F2 Frequency Mismatch (Hard Version)
|
0 / 0 |
10 |
|
|
9652 |
codeforces#P1958A 1-3-5
|
0 / 0 |
3 |
|
|
9651 |
codeforces#P1958B Clock in the Pool
|
0 / 0 |
4 |
|
|
9650 |
codeforces#P1958C Firewood
|
0 / 0 |
5 |
|
|
9649 |
codeforces#P1958D Staircase
|
0 / 0 |
5 |
|
|
9648 |
codeforces#P1958E Yet Another Permutation Constructive
|
0 / 0 |
6 |
|
|
9647 |
codeforces#P1958F Narrow Paths
|
0 / 0 |
7 |
|
|
9646 |
codeforces#P1958G Observation Towers
|
0 / 0 |
9 |
|
|
9645 |
codeforces#P1958H Composite Spells
|
0 / 0 |
10 |
|
|
9644 |
codeforces#P1958I Equal Trees
|
0 / 0 |
10 |
|
|
9643 |
codeforces#P1958J Necromancer
|
0 / 0 |
10 |
|
|
9584 |
codeforces#P1965A Everything Nim
|
0 / 0 |
4 |
|
|
9583 |
codeforces#P1965B Missing Subsequence Sum
|
0 / 0 |
6 |
|
|
9582 |
codeforces#P1965C Folding Strip
|
0 / 0 |
8 |
|
|
9581 |
codeforces#P1965D Missing Subarray Sum
|
0 / 0 |
10 |
|
|
9580 |
codeforces#P1965E Connected Cubes
|
0 / 0 |
10 |
|
|
9579 |
codeforces#P1965F Conference
|
0 / 0 |
10 |
|
|
9578 |
codeforces#P1966A Card Exchange
|
0 / 0 |
3 |
|
|
9577 |
codeforces#P1966B Rectangle Filling
|
0 / 0 |
3 |
|
|
9576 |
codeforces#P1967A Permutation Counting
|
0 / 0 |
(无) |
|
|
9575 |
codeforces#P1967B1 Reverse Card (Easy Version)
|
0 / 0 |
(无) |
|
|
9574 |
codeforces#P1967B2 Reverse Card (Hard Version)
|
0 / 0 |
(无) |
|
|
9573 |
codeforces#P1967C Fenwick Tree
|
0 / 0 |
(无) |
|
|
9572 |
codeforces#P1967D Long Way to be Non-decreasing
|
0 / 0 |
(无) |
|
|
9571 |
codeforces#P1967E1 Again Counting Arrays (Easy Version)
|
0 / 0 |
(无) |
|
|
9570 |
codeforces#P1967E2 Again Counting Arrays (Hard Version)
|
0 / 0 |
(无) |
|
|
9569 |
codeforces#P1967F Next and Prev
|
0 / 0 |
(无) |
|
|
9568 |
codeforces#P1968A Maximize?
|
1 / 1 |
10 |
|
|
9567 |
codeforces#P1968B Prefiquence
|
0 / 0 |
(无) |
|
|
9566 |
codeforces#P1968C Assembly via Remainders
|
0 / 0 |
(无) |
|
|
9565 |
codeforces#P1968D Permutation Game
|
0 / 0 |
(无) |
|
|
9564 |
codeforces#P1968E Cells Arrangement
|
0 / 0 |
(无) |
|
|
9563 |
codeforces#P1968F Equal XOR Segments
|
0 / 0 |
(无) |
|
|
9562 |
codeforces#P1968G1 Division + LCP (easy version)
|
0 / 0 |
(无) |
|
|
9561 |
codeforces#P1968G2 Division + LCP (hard version)
|
0 / 0 |
(无) |
|
|
9560 |
codeforces#P1969A Two Friends
|
0 / 1 |
10 |
|
|
9559 |
codeforces#P1969B Shifts and Sorting
|
0 / 0 |
(无) |
|
|
9558 |
codeforces#P1969C Minimizing the Sum
|
0 / 0 |
(无) |
|
|
9557 |
codeforces#P1969D Shop Game
|
0 / 0 |
(无) |
|
|
9556 |
codeforces#P1969E Unique Array
|
0 / 0 |
(无) |
|
|
9555 |
codeforces#P1969F Card Pairing
|
0 / 0 |
(无) |
|
|
9554 |
codeforces#P1970A1 Balanced Shuffle (Easy)
|
0 / 0 |
(无) |
