ID 题目 显示标签 隐藏标签 AC / 尝试 难度
134 P1808E2   Minibuses on Venus (medium version) 0 / 0 9
133 P1808E3   Minibuses on Venus (hard version) 0 / 0 10
132 P1809A   Garland 0 / 0 3
131 P1809B   Points on Plane 0 / 0 3
130 P1809C   Sum on Subarrays 0 / 0 5
129 P1809D   Binary String Sorting 0 / 0 6
128 P1809E   Two Tanks 0 / 0 9
127 P1809F   Traveling in Berland 0 / 0 9
126 P1809G   Prediction 0 / 0 10
125 P1810A   Beautiful Sequence 0 / 0 3
124 P1810B   Candies 0 / 0 3
123 P1810C   Make It Permutation 0 / 0 4
122 P1810D   Climbing the Tree 0 / 0 5
121 P1810E   Monsters 0 / 0 7
120 P1810F   M-tree 0 / 0 10
119 P1810G   The Maximum Prefix 0 / 0 10
118 P1810H   Last Number 0 / 0 10
117 P1811A   Insert Digit 0 / 0 3
116 P1811B   Conveyor Belts 0 / 0 3
115 P1811C   Restore the Array 0 / 0 3
114 P1811D   Umka and a Long Flight 0 / 0 5
113 P1811E   Living Sequence 0 / 0 5
112 P1811F   Is It Flower? 0 / 0 7
111 P1811G1   Vlad and the Nice Paths (easy version) 0 / 0 7
110 P1811G2   Vlad and the Nice Paths (hard version) 0 / 0 8
109 P1814A   Coins 0 / 0 3
108 P1814B   Long Legs 0 / 0 5
107 P1814C   Search in Parallel 0 / 0 5
106 P1814D   Balancing Weapons 0 / 0 9
105 P1814E   Chain Chips 0 / 0 8
104 P1814F   Communication Towers 0 / 0 10
103 P1815A   Ian and Array Sorting 0 / 0 4
102 P1815B   Sum Graph 0 / 0 7
101 P1815C   Between 0 / 0 8
100 P1815D   XOR Counting 0 / 0 10
99 P1815E   Bosco and Particle 0 / 0 10
98 P1815F   OH NO1 (-2-3-4) 0 / 0 10
97 P1816A   Ian Visits Mary 0 / 0 3
96 P1816B   Grid Reconstruction 0 / 0 3
95 P1817A   Almost Increasing Subsequence 0 / 0 5
94 P1817B   Fish Graph 0 / 0 6
93 P1817C   Similar Polynomials 0 / 0 9
92 P1817D   Toy Machine 0 / 0 10
91 P1817E   Half-sum 0 / 0 10
90 P1817F   Entangled Substrings 0 / 0 10
89 P1818A   Politics 0 / 0 3
88 P1818B   Indivisible 0 / 0 3
87 P1819A   Constructive Problem 0 / 0 4
86 P1819B   The Butcher 0 / 0 6
85 P1819C   The Fox and the Complete Tree Traversal 0 / 0 9

分类

手气不错

根据当前过滤条件随机选择一道题