|
33603 |
codeforces#P1792F1
Graph Coloring (easy version)
|
0 / 0 |
(无) |
|
33608 |
codeforces#P1793D
Moscow Gorillas
|
0 / 0 |
(无) |
|
33609 |
codeforces#P1793E
Velepin and Marketing
|
0 / 0 |
(无) |
|
33610 |
codeforces#P1793F
Rebrending
|
1 / 1 |
10 |
|
33614 |
codeforces#P1794D
Counting Factorizations
|
0 / 0 |
(无) |
|
33615 |
codeforces#P1794E
Labeling the Tree with Distances
|
0 / 0 |
(无) |
|
33620 |
codeforces#P1795E
Explosions?
|
0 / 0 |
(无) |
|
33621 |
codeforces#P1795F
Blocking Chips
|
0 / 0 |
(无) |
|
33625 |
codeforces#P1796C
Maximum Set
|
0 / 0 |
5 |
|
33626 |
codeforces#P1796D
Maximum Subarray
|
0 / 0 |
7 |
|
33627 |
codeforces#P1796E
Colored Subgraphs
|
0 / 0 |
9 |
|
33632 |
codeforces#P1798D
Shocking Arrangement
|
0 / 0 |
(无) |
|
33633 |
codeforces#P1798E
Multitest Generator
|
0 / 0 |
(无) |
|
33634 |
codeforces#P1798F
Gifts from Grandfather Ahmed
|
1 / 1 |
10 |
|
33638 |
codeforces#P1799D1
Hot Start Up (easy version)
|
0 / 0 |
(无) |
|
33639 |
codeforces#P1799D2
Hot Start Up (hard version)
|
1 / 1 |
10 |
|
33640 |
codeforces#P1799E
City Union
|
0 / 0 |
(无) |
|
33641 |
codeforces#P1799F
Halve or Subtract
|
1 / 1 |
10 |
|
33642 |
codeforces#P1799G
Count Voting
|
0 / 0 |
(无) |
|
33643 |
codeforces#P1799H
Tree Cutting
|
0 / 0 |
(无) |
|
33655 |
codeforces#P1801C
Music Festival
|
0 / 0 |
(无) |
|
33656 |
codeforces#P1801D
The way home
|
0 / 0 |
(无) |
|
33658 |
codeforces#P1801F
Another n-dimensional chocolate bar
|
0 / 0 |
(无) |
|
33666 |
codeforces#P1804E
Routing
|
0 / 0 |
(无) |
|
33669 |
codeforces#P1804H
Code Lock
|
0 / 0 |
(无) |
|
33673 |
codeforces#P1805D
A Wide, Wide Graph
|
0 / 0 |
(无) |
|
33680 |
codeforces#P1806D
DSU Master
|
0 / 0 |
(无) |
|
33690 |
codeforces#P1807G1
Subsequence Addition (Easy Version)
|
0 / 0 |
(无) |
|
33691 |
codeforces#P1807G2
Subsequence Addition (Hard Version)
|
0 / 0 |
(无) |
|
33694 |
codeforces#P1808C
Unlucky Numbers
|
0 / 0 |
6 |
|
33696 |
codeforces#P1808E1
Minibuses on Venus (easy version)
|
0 / 0 |
8 |
|
33697 |
codeforces#P1808E2
Minibuses on Venus (medium version)
|
0 / 0 |
9 |
|
33698 |
codeforces#P1808E3
Minibuses on Venus (hard version)
|
0 / 0 |
10 |
|
33702 |
codeforces#P1809D
Binary String Sorting
|
1 / 1 |
10 |
|
33703 |
codeforces#P1809E
Two Tanks
|
1 / 1 |
10 |
|
33705 |
codeforces#P1809G
Prediction
|
0 / 0 |
(无) |
|
33712 |
codeforces#P1810G
The Maximum Prefix
|
0 / 0 |
10 |
|
33718 |
codeforces#P1811E
Living Sequence
|
0 / 0 |
(无) |
|
33720 |
codeforces#P1811G1
Vlad and the Nice Paths (easy version)
|
0 / 0 |
(无) |
|
33721 |
codeforces#P1811G2
Vlad and the Nice Paths (hard version)
|
0 / 0 |
(无) |
|
33736 |
codeforces#P1814E
Chain Chips
|
0 / 0 |
(无) |
|
33741 |
codeforces#P1815D
XOR Counting
|
0 / 0 |
10 |
|
33742 |
codeforces#P1815E
Bosco and Particle
|
0 / 0 |
10 |
|
33756 |
codeforces#P1819C
The Fox and the Complete Tree Traversal
|
0 / 0 |
(无) |
|
33757 |
codeforces#P1819D
Misha and Apples
|
0 / 0 |
(无) |
|
33759 |
codeforces#P1819F
Willy-nilly, Crack, Into Release!
|
0 / 0 |
(无) |
|
33766 |
codeforces#P1821E
Rearrange Brackets
|
0 / 0 |
(无) |
|
33767 |
codeforces#P1821F
Timber
|
0 / 0 |
(无) |
|
33773 |
codeforces#P1822F
Gardening Friends
|
0 / 0 |
(无) |
|
33780 |
codeforces#P1823E
Removing Graph
|
0 / 0 |
(无) |