|
1642 |
P1603B
Moderate Modular Mode
|
0 / 0 |
5 |
|
1632 |
P1605D
Treelabeling
|
0 / 0 |
7 |
|
1626 |
P1606D
Red-Blue Matrix
|
0 / 0 |
9 |
|
1615 |
P1608A
Find Array
|
0 / 0 |
3 |
|
1614 |
P1608B
Build the Permutation
|
0 / 0 |
4 |
|
1595 |
P1610F
Mashtali: a Space Oddysey
|
0 / 0 |
10 |
|
1591 |
P1611A
Make Even
|
0 / 0 |
3 |
|
1590 |
P1611B
Team Composition: Programmers and Mathematicians
|
0 / 0 |
3 |
|
1589 |
P1611C
Polycarp Recovers the Permutation
|
0 / 0 |
3 |
|
1588 |
P1611D
Weights Assignment For Tree Edges
|
0 / 0 |
5 |
|
1583 |
P1612A
Distance
|
0 / 0 |
3 |
|
1582 |
P1612B
Special Permutation
|
0 / 0 |
3 |
|
1577 |
P1612G
Max Sum Array
|
0 / 0 |
9 |
|
1570 |
P1614A
Divan and a Store
|
0 / 0 |
3 |
|
1569 |
P1614B
Divan and a New Project
|
0 / 0 |
3 |
|
1568 |
P1614C
Divan and bitwise operations
|
0 / 0 |
5 |
|
1558 |
P1615G
Maximum Adjacent Pairs
|
0 / 0 |
10 |
|
1557 |
P1615H
Reindeer Games
|
0 / 0 |
10 |
|
1548 |
P1617A
Forbidden Subsequence
|
0 / 0 |
3 |
|
1547 |
P1617B
GCD Problem
|
0 / 0 |
3 |
|
1545 |
P1617D1
Too Many Impostors (easy version)
|
0 / 0 |
6 |
|
1544 |
P1617D2
Too Many Impostors (hard version)
|
0 / 0 |
9 |
|
1538 |
P1618E
Singers' Tour
|
0 / 0 |
5 |
|
1537 |
P1618F
Reverse
|
0 / 0 |
7 |
|
1531 |
P1619E
MEX and Increments
|
0 / 0 |
5 |
|
1530 |
P1619F
Let's Play the Hat?
|
0 / 0 |
7 |
|
1527 |
P1620A
Equal or Not Equal
|
0 / 0 |
3 |
|
1524 |
P1620D
Exact Change
|
0 / 0 |
7 |
|
1523 |
P1620E
Replace the Numbers
|
0 / 0 |
6 |
|
1520 |
P1621A
Stable Arrangement of Rooks
|
0 / 0 |
3 |
|
1517 |
P1621D
The Winter Hike
|
0 / 0 |
7 |
|
1506 |
P1622F
Quadratic Set
|
0 / 0 |
10 |
|
1498 |
P1624C
Division by Two and Permutation
|
0 / 0 |
3 |
|
1496 |
P1624E
Masha-forgetful
|
0 / 0 |
7 |
|
1495 |
P1624F
Interacdive Problem
|
0 / 0 |
7 |
|
1487 |
P1626A
Equidistant Letters
|
0 / 0 |
3 |
|
1481 |
P1627A
Not Shading
|
0 / 0 |
3 |
|
1479 |
P1627C
Not Assigning
|
0 / 0 |
4 |
|
1475 |
P1628A
Meximum Array
|
0 / 0 |
4 |
|
1473 |
P1628C
Grid Xor
|
0 / 0 |
8 |
|
1466 |
P1630A
And Matching
|
0 / 0 |
5 |
|
1465 |
P1630B
Range and Partition
|
0 / 0 |
6 |
|
1463 |
P1630D
Flipping Range
|
0 / 0 |
9 |
|
1457 |
P1632B
Roof Construction
|
0 / 0 |
3 |
|
1444 |
P1634C
OKEA
|
0 / 0 |
3 |
|
1443 |
P1634D
Finding Zero
|
0 / 0 |
7 |
|
1442 |
P1634E
Fair Share
|
0 / 0 |
9 |
|
1438 |
P1635C
Differential Sorting
|
0 / 0 |
4 |
|
1436 |
P1635E
Cars
|
0 / 0 |
8 |
|
1429 |
P1637F
Towers
|
0 / 0 |
9 |
|
1428 |
P1637G
Birthday
|
0 / 0 |
10 |
|
1426 |
P1638A
Reverse
|
0 / 0 |
3 |
|
1423 |
P1638D
Big Brush
|
0 / 0 |
7 |
|
1408 |
P1641B
Repetitions Decoding
|
0 / 0 |
7 |
|
1400 |
P1644B
Anti-Fibonacci Permutation
|
0 / 0 |
3 |
|
1394 |
P1646B
Quality vs Quantity
|
0 / 0 |
3 |
|
1393 |
P1646C
Factorials and Powers of Two
|
0 / 0 |
5 |
|
1392 |
P1646D
Weight the Tree
|
0 / 0 |
7 |
|
1390 |
P1646F
Playing Around the Table
|
0 / 0 |
10 |
|
1388 |
P1647B
Madoka and the Elegant Gift
|
0 / 0 |
4 |
|
1387 |
P1647C
Madoka and Childish Pranks
|
0 / 0 |
4 |
|
1386 |
P1647D
Madoka and the Best School in Russia
|
0 / 0 |
6 |
|
1382 |
P1648B
Integral Array
|
0 / 0 |
6 |
|
1372 |
P1650D
Twist the Permutation
|
0 / 0 |
4 |
|
1367 |
P1651B
Prove Him Wrong
|
0 / 0 |
3 |
|
1364 |
P1651E
Sum of Matchings
|
0 / 0 |
10 |
|
1355 |
P1654H
Three Minimums
|
0 / 0 |
10 |
|
1352 |
P1656C
Make Equal With Mod
|
0 / 0 |
4 |
|
1351 |
P1656D
K-good
|
0 / 0 |
6 |
|
1350 |
P1656E
Equal Tree Sums
|
0 / 0 |
8 |
|
1349 |
P1656F
Parametric MST
|
0 / 0 |
10 |
|
1348 |
P1656G
Cycle Palindrome
|
0 / 0 |
10 |
|
1346 |
P1656I
Neighbour Ordering
|
0 / 0 |
10 |
|
1339 |
P1658A
Marin and Photoshoot
|
0 / 0 |
3 |
|
1337 |
P1658C
Shinju and the Lost Permutation
|
0 / 0 |
5 |
|
1333 |
P1658F
Juju and Binary String
|
0 / 0 |
10 |
|
1332 |
P1659A
Red Versus Blue
|
0 / 0 |
3 |
|
1331 |
P1659B
Bit Flipping
|
0 / 0 |
4 |
|
1329 |
P1659D
Reverse Sort Sum
|
0 / 0 |
6 |
|
1328 |
P1659E
AND-MEX Walk
|
0 / 0 |
8 |
|
1322 |
P1660E
Matrix and Shifts
|
0 / 0 |
5 |
|
1301 |
P1662M
Bottle Arrangements
|
0 / 0 |
(无) |
|
1292 |
P1663G
Six Characters
|
0 / 0 |
(无) |
|
1291 |
P1663H
Cross-Language Program
|
0 / 0 |
(无) |
|
1290 |
P1665A
GCD vs LCM
|
0 / 0 |
3 |
|
1289 |
P1665B
Array Cloning Technique
|
0 / 0 |
3 |
|
1287 |
P1665D
GCD Guess
|
0 / 0 |
7 |
|
1283 |
P1666C
Connect the Points
|
0 / 0 |
6 |
|
1281 |
P1666E
Even Split
|
0 / 0 |
9 |
|
1277 |
P1666I
Interactive Treasure Hunt
|
0 / 0 |
8 |
|
1276 |
P1666J
Job Lookup
|
0 / 0 |
7 |
|
1271 |
P1667C
Half Queen Cover
|
0 / 0 |
9 |
|
1270 |
P1667D
Edge Elimination
|
0 / 0 |
10 |
|
1253 |
P1670E
Hemose on the Tree
|
0 / 0 |
8 |
|
1248 |
P1671D
Insert a Progression
|
0 / 0 |
5 |
|
1244 |
P1672B
I love AAAB
|
0 / 0 |
3 |
|
1243 |
P1672C
Unequal Array
|
0 / 0 |
3 |
|
1242 |
P1672D
Cyclic Rotation
|
0 / 0 |
5 |
|
1241 |
P1672E
notepad.exe
|
0 / 0 |
8 |
|
1240 |
P1672F1
Array Shuffling
|
0 / 0 |
7 |