|
|
34580 |
codeforces#P1956D
Nene and the Mex Operator
|
0 / 0 |
7 |
|
|
34586 |
codeforces#P1957C
How Does the Rook Move?
|
0 / 0 |
5 |
|
|
34587 |
codeforces#P1957D
A BIT of an Inequality
|
0 / 0 |
6 |
|
|
34588 |
codeforces#P1957E
Carousel of Combinations
|
0 / 0 |
9 |
|
|
34591 |
codeforces#P1958A
1-3-5
|
0 / 0 |
3 |
|
|
34598 |
codeforces#P1958H
Composite Spells
|
0 / 0 |
10 |
|
|
34612 |
codeforces#P1967C
Fenwick Tree
|
0 / 0 |
(无) |
|
|
34614 |
codeforces#P1967E1
Again Counting Arrays (Easy Version)
|
0 / 0 |
(无) |
|
|
34615 |
codeforces#P1967E2
Again Counting Arrays (Hard Version)
|
0 / 0 |
(无) |
|
|
34623 |
codeforces#P1968G1
Division + LCP (easy version)
|
0 / 0 |
(无) |
|
|
34624 |
codeforces#P1968G2
Division + LCP (hard version)
|
0 / 0 |
(无) |
|
|
34627 |
codeforces#P1969C
Minimizing the Sum
|
0 / 0 |
(无) |
|
|
34629 |
codeforces#P1969E
Unique Array
|
0 / 0 |
(无) |
|
|
34630 |
codeforces#P1969F
Card Pairing
|
0 / 0 |
(无) |
|
|
34639 |
codeforces#P1970C3
Game on Tree (Hard)
|
0 / 0 |
(无) |
|
|
34643 |
codeforces#P1970E1
Trails (Easy)
|
0 / 0 |
(无) |
|
|
34644 |
codeforces#P1970E2
Trails (Medium)
|
0 / 0 |
(无) |
|
|
34645 |
codeforces#P1970E3
Trails (Hard)
|
0 / 0 |
(无) |
|
|
34650 |
codeforces#P1970G2
Min-Fund Prison (Medium)
|
0 / 0 |
(无) |
|
|
34651 |
codeforces#P1970G3
Min-Fund Prison (Hard)
|
0 / 0 |
(无) |
|
|
34662 |
codeforces#P1973A
Chess For Three
|
0 / 0 |
3 |
|
|
34667 |
codeforces#P1973F
Maximum GCD Sum Queries
|
0 / 0 |
10 |
|
|
34672 |
codeforces#P1974E
Money Buys Happiness
|
0 / 0 |
6 |
|
|
34678 |
codeforces#P1975D
Paint the Tree
|
0 / 0 |
(无) |
|
|
34680 |
codeforces#P1975F
Set
|
0 / 0 |
(无) |
|
|
34683 |
codeforces#P1975I
Mind Bloom
|
0 / 0 |
(无) |
|
|
34689 |
codeforces#P1976F
Remove Bridges
|
0 / 0 |
(无) |
|
|
34692 |
codeforces#P1977C
Nikita and LCM
|
0 / 0 |
(无) |
|
|
34699 |
codeforces#P1978E
Computing Machine
|
0 / 0 |
(无) |
|
|
34720 |
codeforces#P1981F
Turtle and Paths on a Tree
|
1 / 1 |
10 |
|
|
34723 |
codeforces#P1982C
Boring Day
|
0 / 0 |
(无) |
|
|
34725 |
codeforces#P1982E
Number of k-good subarrays
|
0 / 0 |
(无) |
|
|
34729 |
codeforces#P1983C
Have Your Cake and Eat It Too
|
0 / 0 |
(无) |
|
|
34733 |
codeforces#P1983G
Your Loss
|
0 / 0 |
(无) |
|
|
34736 |
codeforces#P1984C1
Magnitude (Easy Version)
|
0 / 0 |
4 |
|
|
34737 |
codeforces#P1984C2
Magnitude (Hard Version)
|
0 / 0 |
5 |
|
|
34739 |
codeforces#P1984E
Shuffle
|
0 / 0 |
9 |
|
|
34740 |
codeforces#P1984F
Reconstruction
|
0 / 0 |
9 |
|
|
34742 |
codeforces#P1984H
Tower Capturing
|
0 / 0 |
10 |
|
|
34751 |
codeforces#P1985H2
Maximize the Largest Component (Hard Version)
|
0 / 0 |
(无) |
|
|
34755 |
codeforces#P1986D
Mathematical Problem
|
0 / 0 |
(无) |
|
|
34762 |
codeforces#P1987C
Basil's Garden
|
0 / 0 |
(无) |
|
|
34763 |
codeforces#P1987D
World is Mine
|
1 / 1 |
10 |
|
|
34764 |
codeforces#P1987E
Wonderful Tree!
|
0 / 2 |
10 |
|
|
34765 |
codeforces#P1987F1
Interesting Problem (Easy Version)
|
0 / 0 |
(无) |
|
|
34766 |
codeforces#P1987F2
Interesting Problem (Hard Version)
|
0 / 0 |
(无) |
|
|
34767 |
codeforces#P1987G1
Spinning Round (Easy Version)
|
0 / 0 |
(无) |
|
|
34768 |
codeforces#P1987G2
Spinning Round (Hard Version)
|
0 / 0 |
(无) |
|
|
34770 |
codeforces#P1988A
Split the Multiset
|
0 / 0 |
(无) |
|
|
34773 |
codeforces#P1988D
The Omnipotent Monster Killer
|
0 / 0 |
(无) |
