|
|
7685 |
codeforces#P1644E Expand the Path
|
0 / 0 |
(无) |
|
|
7726 |
codeforces#P1647E Madoka and the Sixth-graders
|
0 / 0 |
(无) |
|
|
7711 |
codeforces#P1648A Weird Sum
|
0 / 0 |
(无) |
|
|
7710 |
codeforces#P1648B Integral Array
|
0 / 0 |
(无) |
|
|
7709 |
codeforces#P1648C Tyler and Strings
|
0 / 0 |
(无) |
|
|
7708 |
codeforces#P1648D Serious Business
|
0 / 0 |
(无) |
|
|
7707 |
codeforces#P1648E Air Reform
|
0 / 0 |
(无) |
|
|
7706 |
codeforces#P1648F Two Avenues
|
0 / 0 |
(无) |
|
|
7714 |
codeforces#P1650E Rescheduling the Exam
|
0 / 0 |
(无) |
|
|
7722 |
codeforces#P1651C Fault-tolerant Network
|
0 / 0 |
(无) |
|
|
7721 |
codeforces#P1651D Nearest Excluded Points
|
0 / 0 |
(无) |
|
|
7719 |
codeforces#P1651F Tower Defense
|
0 / 0 |
(无) |
|
|
7736 |
codeforces#P1654C Alice and the Cake
|
0 / 0 |
4 |
|
|
7733 |
codeforces#P1654F Minimal String Xoration
|
0 / 0 |
10 |
|
|
7732 |
codeforces#P1654G Snowy Mountain
|
0 / 0 |
10 |
|
|
7752 |
codeforces#P1656B Subtract Operation
|
1 / 4 |
10 |
|
|
7801 |
codeforces#P1659D Reverse Sort Sum
|
0 / 0 |
(无) |
|
|
7800 |
codeforces#P1659E AND-MEX Walk
|
0 / 0 |
(无) |
|
|
7761 |
codeforces#P1660F2 Promising String (hard version)
|
0 / 0 |
(无) |
|
|
7783 |
codeforces#P1661D Progressions Covering
|
1 / 2 |
10 |
|
|
7782 |
codeforces#P1661E Narrow Components
|
0 / 0 |
(无) |
|
|
7846 |
codeforces#P1662F Antennas
|
1 / 3 |
10 |
|
|
7840 |
codeforces#P1662L Il Derby della Madonnina
|
0 / 0 |
(无) |
|
|
7776 |
codeforces#P1665E MinimizOR
|
1 / 1 |
10 |
|
|
7835 |
codeforces#P1667B Optimal Partition
|
1 / 1 |
10 |
|
|
7824 |
codeforces#P1669E 2-Letter Strings
|
0 / 0 |
(无) |
|
|
7823 |
codeforces#P1669F Eating Candies
|
0 / 0 |
(无) |
|
|
7884 |
codeforces#P1670C Where is the Pizza?
|
0 / 0 |
(无) |
|
|
7806 |
codeforces#P1672H Zigu Zagu
|
0 / 0 |
(无) |
|
|
7805 |
codeforces#P1672I PermutationForces
|
0 / 0 |
(无) |
|
|
7853 |
codeforces#P1674F Desktop Rearrangement
|
0 / 0 |
(无) |
|
|
7890 |
codeforces#P1676F Longest Strike
|
0 / 0 |
(无) |
|
|
7887 |
codeforces#P1676H2 Maximum Crossings (Hard Version)
|
0 / 0 |
(无) |
|
|
7880 |
codeforces#P1677A Tokitsukaze and Strange Inequality
|
1 / 1 |
10 |
|
|
7876 |
codeforces#P1677E Tokitsukaze and Beautiful Subsegments
|
0 / 0 |
(无) |
|
|
7906 |
codeforces#P1679B Stone Age Problem
|
0 / 0 |
(无) |
|
|
7905 |
codeforces#P1679C Rooks Defenders
|
0 / 1 |
10 |
|
|
7896 |
codeforces#P1680F Lenient Vertex Cover
|
1 / 1 |
10 |
|
|
7923 |
codeforces#P1681E Labyrinth Adventures
|
1 / 1 |
10 |
|
|
7922 |
codeforces#P1681F Unique Occurrences
|
1 / 1 |
10 |
|
|
7916 |
codeforces#P1682F MCMF?
|
0 / 0 |
(无) |
|
|
7911 |
codeforces#P1684E MEX vs DIFF
|
0 / 0 |
(无) |
|
|
7930 |
codeforces#P1685E The Ultimate LIS Problem
|
0 / 0 |
(无) |
|
|
7948 |
codeforces#P1687C Sanae and Giant Robot
|
0 / 0 |
(无) |
|
|
7967 |
codeforces#P1689B Mystic Permutation
|
0 / 0 |
(无) |
|
|
7965 |
codeforces#P1689D Lena and Matrix
|
0 / 0 |
(无) |
|
|
7955 |
codeforces#P1690C Restoring the Duration of Tasks
|
0 / 0 |
(无) |
|
|
7951 |
codeforces#P1690G Count the Trains
|
1 / 5 |
10 |
|
|
7938 |
codeforces#P1691D Max GEQ Sum
|
0 / 0 |
(无) |
|
|
7937 |
codeforces#P1691E Number of Groups
|
0 / 0 |
(无) |
