|
|
1088 |
P1648D
Serious Business
|
0 / 0 |
10 |
|
|
1087 |
P1648E
Air Reform
|
0 / 0 |
10 |
|
|
1086 |
P1648F
Two Avenues
|
0 / 0 |
10 |
|
|
1079 |
P1650E
Rescheduling the Exam
|
0 / 0 |
6 |
|
|
1077 |
P1650G
Counting Shortcuts
|
0 / 0 |
7 |
|
|
1074 |
P1651C
Fault-tolerant Network
|
0 / 0 |
5 |
|
|
1073 |
P1651D
Nearest Excluded Points
|
0 / 0 |
6 |
|
|
1071 |
P1651F
Tower Defense
|
0 / 0 |
10 |
|
|
1068 |
P1654C
Alice and the Cake
|
0 / 0 |
4 |
|
|
1066 |
P1654E
Arithmetic Operations
|
0 / 0 |
8 |
|
|
1065 |
P1654F
Minimal String Xoration
|
0 / 0 |
10 |
|
|
1064 |
P1654G
Snowy Mountain
|
0 / 0 |
10 |
|
|
1061 |
P1656B
Subtract Operation
|
0 / 0 |
3 |
|
|
1055 |
P1656H
Equal LCM Subsets
|
0 / 0 |
10 |
|
|
1043 |
P1658D2
388535 (Hard Version)
|
0 / 0 |
8 |
|
|
1042 |
P1658E
Gojou and Matrix Game
|
0 / 0 |
9 |
|
|
1037 |
P1659D
Reverse Sort Sum
|
0 / 0 |
6 |
|
|
1028 |
P1660F2
Promising String (hard version)
|
0 / 0 |
7 |
|
|
1024 |
P1661D
Progressions Covering
|
0 / 0 |
6 |
|
|
1023 |
P1661E
Narrow Components
|
0 / 0 |
9 |
|
|
1016 |
P1662F
Antennas
|
0 / 0 |
(无) |
|
|
1010 |
P1662L
Il Derby della Madonnina
|
0 / 0 |
(无) |
|
|
994 |
P1665E
MinimizOR
|
0 / 0 |
9 |
|
|
980 |
P1667B
Optimal Partition
|
0 / 0 |
7 |
|
|
969 |
P1669E
2-Letter Strings
|
0 / 0 |
4 |
|
|
968 |
P1669F
Eating Candies
|
0 / 0 |
3 |
|
|
963 |
P1670C
Where is the Pizza?
|
0 / 0 |
4 |
|
|
945 |
P1672H
Zigu Zagu
|
0 / 0 |
10 |
|
|
944 |
P1672I
PermutationForces
|
0 / 0 |
10 |
|
|
932 |
P1674F
Desktop Rearrangement
|
0 / 0 |
6 |
|
|
918 |
P1676F
Longest Strike
|
0 / 0 |
4 |
|
|
915 |
P1676H2
Maximum Crossings (Hard Version)
|
0 / 0 |
5 |
|
|
914 |
P1677A
Tokitsukaze and Strange Inequality
|
0 / 0 |
5 |
|
|
913 |
P1677B
Tokitsukaze and Meeting
|
0 / 0 |
5 |
|
|
910 |
P1677E
Tokitsukaze and Beautiful Subsegments
|
0 / 0 |
10 |
|
|
904 |
P1679B
Stone Age Problem
|
0 / 0 |
4 |
|
|
903 |
P1679C
Rooks Defenders
|
0 / 0 |
4 |
|
|
889 |
P1681E
Labyrinth Adventures
|
0 / 0 |
10 |
|
|
888 |
P1681F
Unique Occurrences
|
0 / 0 |
8 |
|
|
882 |
P1682F
MCMF?
|
0 / 0 |
10 |
|
|
877 |
P1684E
MEX vs DIFF
|
0 / 0 |
7 |
|
|
876 |
P1684F
Diverse Segments
|
0 / 0 |
10 |
|
|
868 |
P1685E
The Ultimate LIS Problem
|
0 / 0 |
10 |
|
|
863 |
P1687C
Sanae and Giant Robot
|
0 / 0 |
9 |
|
|
862 |
P1687D
Cute number
|
0 / 0 |
10 |
|
|
855 |
P1689B
Mystic Permutation
|
0 / 0 |
3 |
|
|
853 |
P1689D
Lena and Matrix
|
0 / 0 |
6 |
|
|
849 |
P1690C
Restoring the Duration of Tasks
|
0 / 0 |
3 |
|
|
845 |
P1690G
Count the Trains
|
0 / 0 |
7 |
|
|
841 |
P1691D
Max GEQ Sum
|
0 / 0 |
6 |
