|
1732 |
codeforces#P1209F Koala and Notebook
|
2 / 4 |
10 |
|
1730 |
codeforces#P1209G1 Into Blocks (easy version)
|
2 / 3 |
7 |
|
1729 |
codeforces#P1209G2 Into Blocks (hard version)
|
2 / 3 |
10 |
|
1728 |
codeforces#P1209H Moving Walkways
|
0 / 0 |
10 |
|
1709 |
codeforces#P1213B Bad Prices
|
0 / 0 |
3 |
|
1704 |
codeforces#P1213F Unstable String Sort
|
0 / 0 |
7 |
|
1700 |
codeforces#P1214C Bad Sequence
|
1 / 3 |
4 |
|
1696 |
codeforces#P1214G Feeling Good
|
0 / 0 |
10 |
|
1682 |
codeforces#P1216F Wi-Fi
|
0 / 0 |
7 |
|
1676 |
codeforces#P1217E Sum Queries?
|
0 / 0 |
8 |
|
1675 |
codeforces#P1217F Forced Online Queries Problem
|
0 / 0 |
10 |
|
1673 |
codeforces#P1218B Guarding warehouses
|
0 / 0 |
10 |
|
1669 |
codeforces#P1218F Workout plan
|
0 / 0 |
5 |
|
1659 |
codeforces#P1220F Gardener Alex
|
1 / 1 |
10 |
|
1652 |
codeforces#P1221F Choose a Square
|
0 / 0 |
9 |
|
1644 |
codeforces#P1223F Stack Exterminable Arrays
|
0 / 0 |
10 |
|
1630 |
codeforces#P1227D1 Optimal Subsequences (Easy Version)
|
0 / 0 |
5 |
|
1629 |
codeforces#P1227D2 Optimal Subsequences (Hard Version)
|
0 / 0 |
6 |
|
1612 |
codeforces#P1234B2 Social Network (hard version)
|
0 / 0 |
4 |
|
1610 |
codeforces#P1234D Distinct Characters Queries
|
0 / 0 |
5 |
|
1604 |
codeforces#P1236D Alice and the Doll
|
0 / 0 |
8 |
|
1603 |
codeforces#P1236E Alice and the Unfair Game
|
0 / 0 |
9 |
|
1600 |
codeforces#P1237B Balanced Tunnel
|
0 / 0 |
4 |
|
1597 |
codeforces#P1237D Balanced Playlist
|
0 / 0 |
7 |
|
1594 |
codeforces#P1237G Balanced Distribution
|
0 / 0 |
10 |
|
1586 |
codeforces#P1238G Adilbek and the Watering System
|
0 / 0 |
10 |
|
1583 |
codeforces#P1239C Queue in the Train
|
0 / 0 |
8 |
|
1547 |
codeforces#P1249D2 Too Many Segments (hard version)
|
0 / 0 |
6 |
|
1542 |
codeforces#P1250C Trip to Saint Petersburg
|
0 / 0 |
7 |
|
1525 |
codeforces#P1251E1 Voting (Easy Version)
|
0 / 0 |
8 |
|
1526 |
codeforces#P1251E2 Voting (Hard Version)
|
0 / 0 |
9 |
|
1521 |
codeforces#P1252C Even Path
|
0 / 0 |
5 |
|
1520 |
codeforces#P1252D Find String in a Grid
|
0 / 0 |
10 |
|
1517 |
codeforces#P1252G Performance Review
|
0 / 0 |
7 |
|
1513 |
codeforces#P1252K Addition Robot
|
0 / 0 |
7 |
|
1507 |
codeforces#P1253E Antenna Coverage
|
0 / 0 |
8 |
|
1501 |
codeforces#P1254D Tree Queries
|
0 / 0 |
10 |
|
1486 |
codeforces#P1257D Yet Another Monster Killing Problem
|
0 / 0 |
5 |
|
1487 |
codeforces#P1257E The Contest
|
0 / 0 |
7 |
|
1478 |
codeforces#P1260F Colored Tree
|
1 / 2 |
10 |
|
1472 |
codeforces#P1263E Editor
|
0 / 0 |
7 |
|
1471 |
codeforces#P1263F Economic Difficulties
|
0 / 0 |
9 |
|
1468 |
codeforces#P1264C Beautiful Mirrors with queries
|
1 / 9 |
9 |
|
1462 |
codeforces#P1265B Beautiful Numbers
|
0 / 0 |
4 |
|
1461 |
codeforces#P1265E Beautiful Mirrors
|
1 / 1 |
7 |
|
1457 |
codeforces#P1266D Decreasing Debts
|
0 / 0 |
7 |
|
1456 |
codeforces#P1266E Spaceship Solitaire
|
0 / 0 |
7 |
|
1441 |
codeforces#P1268C K Integers
|
0 / 0 |
8 |
|
1428 |
codeforces#P1270H Number of Components
|
2 / 2 |
10 |
|
1423 |
codeforces#P1271D Portals
|
0 / 0 |
7 |