|
|
8597 |
codeforces#P1794E Labeling the Tree with Distances
|
0 / 0 |
(无) |
|
|
8562 |
codeforces#P1795E Explosions?
|
0 / 0 |
(无) |
|
|
8561 |
codeforces#P1795F Blocking Chips
|
0 / 0 |
(无) |
|
|
8594 |
codeforces#P1796C Maximum Set
|
0 / 0 |
5 |
|
|
8593 |
codeforces#P1796D Maximum Subarray
|
0 / 0 |
7 |
|
|
8592 |
codeforces#P1796E Colored Subgraphs
|
0 / 0 |
9 |
|
|
8643 |
codeforces#P1798D Shocking Arrangement
|
0 / 0 |
(无) |
|
|
8642 |
codeforces#P1798E Multitest Generator
|
0 / 0 |
(无) |
|
|
8641 |
codeforces#P1798F Gifts from Grandfather Ahmed
|
1 / 1 |
10 |
|
|
8587 |
codeforces#P1799D1 Hot Start Up (easy version)
|
0 / 0 |
(无) |
|
|
8586 |
codeforces#P1799D2 Hot Start Up (hard version)
|
0 / 0 |
(无) |
|
|
8585 |
codeforces#P1799E City Union
|
0 / 0 |
(无) |
|
|
8584 |
codeforces#P1799F Halve or Subtract
|
0 / 0 |
(无) |
|
|
8583 |
codeforces#P1799G Count Voting
|
0 / 0 |
(无) |
|
|
8582 |
codeforces#P1799H Tree Cutting
|
0 / 0 |
(无) |
|
|
8608 |
codeforces#P1801C Music Festival
|
0 / 0 |
(无) |
|
|
8607 |
codeforces#P1801D The way home
|
0 / 0 |
(无) |
|
|
8605 |
codeforces#P1801F Another n-dimensional chocolate bar
|
0 / 0 |
(无) |
|
|
8614 |
codeforces#P1804E Routing
|
0 / 0 |
(无) |
|
|
8611 |
codeforces#P1804H Code Lock
|
0 / 0 |
(无) |
|
|
8675 |
codeforces#P1805D A Wide, Wide Graph
|
0 / 0 |
(无) |
|
|
8622 |
codeforces#P1806D DSU Master
|
0 / 0 |
(无) |
|
|
8627 |
codeforces#P1807G1 Subsequence Addition (Easy Version)
|
0 / 0 |
(无) |
|
|
8626 |
codeforces#P1807G2 Subsequence Addition (Hard Version)
|
0 / 0 |
(无) |
|
|
8651 |
codeforces#P1808C Unlucky Numbers
|
0 / 0 |
6 |
|
|
8649 |
codeforces#P1808E1 Minibuses on Venus (easy version)
|
0 / 0 |
8 |
|
|
8648 |
codeforces#P1808E2 Minibuses on Venus (medium version)
|
0 / 0 |
9 |
|
|
8647 |
codeforces#P1808E3 Minibuses on Venus (hard version)
|
0 / 0 |
10 |
|
|
8637 |
codeforces#P1809D Binary String Sorting
|
1 / 1 |
10 |
|
|
8636 |
codeforces#P1809E Two Tanks
|
1 / 1 |
10 |
|
|
8634 |
codeforces#P1809G Prediction
|
0 / 0 |
(无) |
|
|
8655 |
codeforces#P1810G The Maximum Prefix
|
0 / 0 |
10 |
|
|
8682 |
codeforces#P1811E Living Sequence
|
0 / 0 |
(无) |
|
|
8680 |
codeforces#P1811G1 Vlad and the Nice Paths (easy version)
|
0 / 0 |
(无) |
|
|
8679 |
codeforces#P1811G2 Vlad and the Nice Paths (hard version)
|
0 / 0 |
(无) |
|
|
8688 |
codeforces#P1814E Chain Chips
|
0 / 0 |
(无) |
|
|
8697 |
codeforces#P1815D XOR Counting
|
0 / 0 |
10 |
|
|
8696 |
codeforces#P1815E Bosco and Particle
|
0 / 0 |
10 |
|
|
8706 |
codeforces#P1819C The Fox and the Complete Tree Traversal
|
0 / 0 |
(无) |
|
|
8705 |
codeforces#P1819D Misha and Apples
|
0 / 0 |
(无) |
|
|
8703 |
codeforces#P1819F Willy-nilly, Crack, Into Release!
|
0 / 0 |
(无) |
|
|
8710 |
codeforces#P1821E Rearrange Brackets
|
0 / 0 |
(无) |
|
|
8709 |
codeforces#P1821F Timber
|
0 / 0 |
(无) |
|
|
8717 |
codeforces#P1822F Gardening Friends
|
0 / 0 |
(无) |
|
|
8724 |
codeforces#P1823E Removing Graph
|
0 / 0 |
(无) |
|
|
8723 |
codeforces#P1823F Random Walk
|
0 / 0 |
(无) |
|
|
8757 |
codeforces#P1824B1 LuoTianyi and the Floating Islands (Easy Version)
|
0 / 0 |
(无) |
|
|
8756 |
codeforces#P1824B2 LuoTianyi and the Floating Islands (Hard Version)
|
0 / 0 |
(无) |
|
|
8755 |
codeforces#P1824C LuoTianyi and XOR-Tree
|
0 / 0 |
(无) |
|
|
8747 |
codeforces#P1826D Running Miles
|
0 / 0 |
(无) |
