|
|
8156 |
P1749E
Cactus Wall
|
0 / 0 |
9 |
|
|
8155 |
P1749F
Distance to the Path
|
0 / 0 |
10 |
|
|
8154 |
P1750A
Indirect Sort
|
0 / 0 |
3 |
|
|
8153 |
P1750B
Maximum Substring
|
0 / 0 |
3 |
|
|
8152 |
P1750C
Complementary XOR
|
0 / 0 |
4 |
|
|
8151 |
P1750D
Count GCD
|
0 / 0 |
6 |
|
|
8150 |
P1750E
Bracket Cost
|
0 / 0 |
9 |
|
|
8149 |
P1750F
Majority
|
0 / 0 |
10 |
|
|
8148 |
P1750G
Doping
|
0 / 0 |
10 |
|
|
8147 |
P1750H
BinaryStringForces
|
0 / 0 |
10 |
|
|
8146 |
P1753A1
Make Nonzero Sum (easy version)
|
0 / 0 |
4 |
|
|
8145 |
P1753A2
Make Nonzero Sum (hard version)
|
0 / 0 |
5 |
|
|
8144 |
P1753B
Factorial Divisibility
|
0 / 0 |
5 |
|
|
8143 |
P1753C
Wish I Knew How to Sort
|
0 / 0 |
7 |
|
|
8142 |
P1753D
The Beach
|
0 / 0 |
9 |
|
|
8141 |
P1753E
N Machines
|
0 / 0 |
10 |
|
|
8140 |
P1753F
Minecraft Series
|
0 / 0 |
10 |
|
|
8139 |
P1754A
Technical Support
|
0 / 0 |
3 |
|
|
8138 |
P1754B
Kevin and Permutation
|
0 / 0 |
3 |
|
|
8137 |
P1758A
SSeeeeiinngg DDoouubbllee
|
0 / 0 |
3 |
|
|
8136 |
P1758B
XOR = Average
|
0 / 0 |
3 |
|
|
8135 |
P1758C
Almost All Multiples
|
0 / 0 |
4 |
|
|
8134 |
P1758D
Range = √Sum
|
0 / 0 |
6 |
|
|
8133 |
P1758E
Tick, Tock
|
0 / 0 |
9 |
|
|
8132 |
P1758F
Decent Division
|
0 / 0 |
10 |
|
|
8131 |
P1759A
Yes-Yes?
|
0 / 0 |
3 |
|
|
8130 |
P1759B
Lost Permutation
|
0 / 0 |
3 |
|
|
8129 |
P1759C
Thermostat
|
0 / 0 |
3 |
|
|
8128 |
P1759D
Make It Round
|
0 / 0 |
4 |
|
|
8127 |
P1759E
The Humanoid
|
0 / 0 |
5 |
|
|
8126 |
P1759F
All Possible Digits
|
0 / 0 |
6 |
|
|
8125 |
P1759G
Restore the Permutation
|
0 / 0 |
6 |
|
|
8124 |
P1760A
Medium Number
|
0 / 0 |
3 |
|
|
8123 |
P1760B
Atilla's Favorite Problem
|
0 / 0 |
3 |
|
|
8122 |
P1760C
Advantage
|
0 / 0 |
3 |
|
|
8121 |
P1760D
Challenging Valleys
|
0 / 0 |
3 |
|
|
8120 |
P1760E
Binary Inversions
|
0 / 0 |
3 |
|
|
8119 |
P1760F
Quests
|
0 / 0 |
5 |
|
|
8118 |
P1760G
SlavicG's Favorite Problem
|
0 / 0 |
5 |
|
|
8117 |
P1761A
Two Permutations
|
0 / 0 |
3 |
|
|
8116 |
P1761B
Elimination of a Ring
|
0 / 0 |
3 |
|
|
8115 |
P1761C
Set Construction
|
0 / 0 |
4 |
|
|
8114 |
P1761D
Carry Bit
|
0 / 0 |
7 |
|
|
8113 |
P1761E
Make It Connected
|
0 / 0 |
9 |
|
|
8112 |
P1761F1
Anti-median (Easy Version)
|
0 / 0 |
10 |
|
|
8111 |
P1761F2
Anti-median (Hard Version)
|
0 / 0 |
10 |
|
|
8110 |
P1761G
Centroid Guess
|
0 / 0 |
10 |
|
|
8252 |
P1762A
Divide and Conquer
|
0 / 0 |
3 |
|
|
8251 |
P1762B
Make Array Good
|
0 / 0 |
3 |
|
|
8250 |
P1762C
Binary Strings are Fun
|
0 / 0 |
4 |
|
|
8249 |
P1762D
GCD Queries
|
0 / 0 |
7 |
|
|
8248 |
P1762E
Tree Sum
|
0 / 0 |
10 |
|
|
8247 |
P1762F
Good Pairs
|
0 / 0 |
10 |
|
|
8246 |
P1762G
Unequal Adjacent Elements
|
0 / 0 |
10 |
|
|
8244 |
P1763A
Absolute Maximization
|
0 / 0 |
3 |
|
|
8245 |
P1763B
Incinerate
|
0 / 0 |
4 |
|
|
8243 |
P1763C
Another Array Problem
|
0 / 0 |
7 |
|
|
8242 |
P1763D
Valid Bitonic Permutations
|
0 / 0 |
8 |
|
|
8241 |
P1763E
Node Pairs
|
0 / 0 |
8 |
|
|
8240 |
P1763F
Edge Queries
|
0 / 0 |
10 |
|
|
8109 |
P1764A
Doremy's Paint
|
0 / 0 |
3 |
|
|
8108 |
P1764B
Doremy's Perfect Math Class
|
0 / 0 |
3 |
|
|
8107 |
P1764C
Doremy's City Construction
|
0 / 0 |
4 |
|
|
8106 |
P1764D
Doremy's Pegging Game
|
0 / 0 |
7 |
|
|
8105 |
P1764E
Doremy's Number Line
|
0 / 0 |
9 |
|
|
8104 |
P1764F
Doremy's Experimental Tree
|
0 / 0 |
9 |
|
|
8103 |
P1764G1
Doremy's Perfect DS Class (Easy Version)
|
0 / 0 |
10 |
|
|
8102 |
P1764G2
Doremy's Perfect DS Class (Medium Version)
|
0 / 0 |
10 |
|
|
8101 |
P1764G3
Doremy's Perfect DS Class (Hard Version)
|
0 / 0 |
10 |
|
|
8100 |
P1764H
Doremy's Paint 2
|
0 / 0 |
10 |
|
|
8099 |
P1765A
Access Levels
|
0 / 0 |
9 |
|
|
8098 |
P1765B
Broken Keyboard
|
0 / 0 |
3 |
|
|
8097 |
P1765C
Card Guessing
|
0 / 0 |
10 |
|
|
8096 |
P1765D
Watch the Videos
|
0 / 0 |
5 |
|
|
8095 |
P1765E
Exchange
|
0 / 0 |
3 |
|
|
8094 |
P1765F
Chemistry Lab
|
0 / 0 |
8 |
|
|
8093 |
P1765G
Guess the String
|
0 / 0 |
10 |
|
|
8092 |
P1765H
Hospital Queue
|
0 / 0 |
8 |
|
|
8091 |
P1765I
Infinite Chess
|
0 / 0 |
10 |
|
|
8090 |
P1765J
Hero to Zero
|
0 / 0 |
10 |
|
|
8089 |
P1765K
Torus Path
|
0 / 0 |
5 |
|
|
8088 |
P1765L
Project Manager
|
0 / 0 |
9 |
|
|
8087 |
P1765M
Minimum LCM
|
0 / 0 |
3 |
|
|
8086 |
P1765N
Number Reduction
|
0 / 0 |
5 |
|
|
8238 |
P1766A
Extremely Round
|
0 / 0 |
3 |
|
|
8239 |
P1766B
Notepad#
|
0 / 0 |
3 |
|
|
8237 |
P1766C
Hamiltonian Wall
|
0 / 0 |
4 |
|
|
8236 |
P1766D
Lucky Chains
|
0 / 0 |
5 |
|
|
8235 |
P1766E
Decomposition
|
0 / 0 |
8 |
|
|
8234 |
P1766F
MCF
|
0 / 0 |
10 |
|
|
8233 |
P1767A
Cut the Triangle
|
0 / 0 |
3 |
|
|
8232 |
P1767B
Block Towers
|
0 / 0 |
3 |
|
|
8231 |
P1767C
Count Binary Strings
|
0 / 0 |
7 |
|
|
8230 |
P1767D
Playoff
|
0 / 0 |
5 |
|
|
8229 |
P1767E
Algebra Flash
|
0 / 0 |
9 |
|
|
8228 |
P1767F
Two Subtrees
|
0 / 0 |
10 |
|
|
8280 |
P1768A
Greatest Convex
|
0 / 0 |
(无) |
|
|
8279 |
P1768B
Quick Sort
|
0 / 0 |
(无) |
|
|
8278 |
P1768C
Elemental Decompress
|
0 / 0 |
(无) |
|
|
8277 |
P1768D
Lucky Permutation
|
0 / 0 |
(无) |
