|
|
32742 |
codeforces#P1644E
Expand the Path
|
0 / 0 |
(无) |
|
|
32754 |
codeforces#P1647E
Madoka and the Sixth-graders
|
0 / 0 |
(无) |
|
|
32756 |
codeforces#P1648A
Weird Sum
|
0 / 0 |
(无) |
|
|
32757 |
codeforces#P1648B
Integral Array
|
1 / 1 |
10 |
|
|
32758 |
codeforces#P1648C
Tyler and Strings
|
0 / 0 |
(无) |
|
|
32759 |
codeforces#P1648D
Serious Business
|
0 / 0 |
(无) |
|
|
32760 |
codeforces#P1648E
Air Reform
|
0 / 0 |
(无) |
|
|
32761 |
codeforces#P1648F
Two Avenues
|
0 / 0 |
(无) |
|
|
32768 |
codeforces#P1650E
Rescheduling the Exam
|
0 / 0 |
(无) |
|
|
32773 |
codeforces#P1651C
Fault-tolerant Network
|
0 / 0 |
(无) |
|
|
32774 |
codeforces#P1651D
Nearest Excluded Points
|
0 / 0 |
(无) |
|
|
32776 |
codeforces#P1651F
Tower Defense
|
0 / 0 |
(无) |
|
|
32779 |
codeforces#P1654C
Alice and the Cake
|
0 / 0 |
4 |
|
|
32782 |
codeforces#P1654F
Minimal String Xoration
|
0 / 0 |
10 |
|
|
32783 |
codeforces#P1654G
Snowy Mountain
|
0 / 0 |
10 |
|
|
32786 |
codeforces#P1656B
Subtract Operation
|
1 / 4 |
10 |
|
|
32810 |
codeforces#P1659D
Reverse Sort Sum
|
0 / 0 |
(无) |
|
|
32811 |
codeforces#P1659E
AND-MEX Walk
|
0 / 0 |
(无) |
|
|
32819 |
codeforces#P1660F2
Promising String (hard version)
|
0 / 0 |
(无) |
|
|
32823 |
codeforces#P1661D
Progressions Covering
|
1 / 2 |
10 |
|
|
32824 |
codeforces#P1661E
Narrow Components
|
0 / 0 |
(无) |
|
|
32831 |
codeforces#P1662F
Antennas
|
1 / 3 |
10 |
|
|
32837 |
codeforces#P1662L
Il Derby della Madonnina
|
0 / 0 |
(无) |
|
|
32853 |
codeforces#P1665E
MinimizOR
|
1 / 1 |
10 |
|
|
32867 |
codeforces#P1667B
Optimal Partition
|
1 / 1 |
10 |
|
|
32878 |
codeforces#P1669E
2-Letter Strings
|
0 / 0 |
(无) |
|
|
32879 |
codeforces#P1669F
Eating Candies
|
0 / 0 |
(无) |
|
|
32884 |
codeforces#P1670C
Where is the Pizza?
|
0 / 0 |
(无) |
|
|
32902 |
codeforces#P1672H
Zigu Zagu
|
0 / 0 |
(无) |
|
|
32903 |
codeforces#P1672I
PermutationForces
|
0 / 0 |
(无) |
|
|
32915 |
codeforces#P1674F
Desktop Rearrangement
|
0 / 0 |
(无) |
|
|
32929 |
codeforces#P1676F
Longest Strike
|
0 / 0 |
(无) |
|
|
32932 |
codeforces#P1676H2
Maximum Crossings (Hard Version)
|
0 / 0 |
(无) |
|
|
32933 |
codeforces#P1677A
Tokitsukaze and Strange Inequality
|
1 / 1 |
10 |
|
|
32937 |
codeforces#P1677E
Tokitsukaze and Beautiful Subsegments
|
0 / 0 |
(无) |
|
|
32943 |
codeforces#P1679B
Stone Age Problem
|
0 / 0 |
(无) |
|
|
32944 |
codeforces#P1679C
Rooks Defenders
|
0 / 1 |
10 |
|
|
32953 |
codeforces#P1680F
Lenient Vertex Cover
|
1 / 1 |
10 |
|
|
32958 |
codeforces#P1681E
Labyrinth Adventures
|
1 / 1 |
10 |
|
|
32959 |
codeforces#P1681F
Unique Occurrences
|
1 / 1 |
10 |
|
|
32965 |
codeforces#P1682F
MCMF?
|
0 / 0 |
(无) |
|
|
32970 |
codeforces#P1684E
MEX vs DIFF
|
0 / 0 |
(无) |
|
|
32979 |
codeforces#P1685E
The Ultimate LIS Problem
|
0 / 0 |
(无) |
|
|
32984 |
codeforces#P1687C
Sanae and Giant Robot
|
0 / 0 |
(无) |
|
|
32992 |
codeforces#P1689B
Mystic Permutation
|
0 / 0 |
(无) |
|
|
32994 |
codeforces#P1689D
Lena and Matrix
|
0 / 0 |
(无) |
|
|
32998 |
codeforces#P1690C
Restoring the Duration of Tasks
|
0 / 0 |
(无) |
|
|
33002 |
codeforces#P1690G
Count the Trains
|
1 / 5 |
10 |
|
|
33006 |
codeforces#P1691D
Max GEQ Sum
|
0 / 0 |
(无) |
|
|
33007 |
codeforces#P1691E
Number of Groups
|
0 / 0 |
(无) |
