|
7887 |
codeforces#P1676H2 Maximum Crossings (Hard Version)
|
0 / 0 |
(无) |
|
7880 |
codeforces#P1677A Tokitsukaze and Strange Inequality
|
1 / 1 |
10 |
|
7879 |
codeforces#P1677B Tokitsukaze and Meeting
|
2 / 3 |
10 |
|
7878 |
codeforces#P1677C Tokitsukaze and Two Colorful Tapes
|
1 / 3 |
10 |
|
7877 |
codeforces#P1677D Tokitsukaze and Permutations
|
0 / 0 |
(无) |
|
7876 |
codeforces#P1677E Tokitsukaze and Beautiful Subsegments
|
0 / 0 |
(无) |
|
7875 |
codeforces#P1677F Tokitsukaze and Gems
|
0 / 0 |
(无) |
|
7874 |
codeforces#P1678A Tokitsukaze and All Zero Sequence
|
0 / 0 |
(无) |
|
7873 |
codeforces#P1678B1 Tokitsukaze and Good 01-String (easy version)
|
0 / 0 |
(无) |
|
7872 |
codeforces#P1678B2 Tokitsukaze and Good 01-String (hard version)
|
0 / 0 |
(无) |
|
7907 |
codeforces#P1679A AvtoBus
|
0 / 0 |
(无) |
|
7906 |
codeforces#P1679B Stone Age Problem
|
0 / 0 |
(无) |
|
7905 |
codeforces#P1679C Rooks Defenders
|
0 / 1 |
10 |
|
7904 |
codeforces#P1679D Toss a Coin to Your Graph...
|
1 / 3 |
10 |
|
7903 |
codeforces#P1679E Typical Party in Dorm
|
0 / 0 |
(无) |
|
7902 |
codeforces#P1679F Formalism for Formalism
|
0 / 0 |
(无) |
|
7901 |
codeforces#P1680A Minimums and Maximums
|
0 / 0 |
(无) |
|
7900 |
codeforces#P1680B Robots
|
0 / 0 |
(无) |
|
7899 |
codeforces#P1680C Binary String
|
0 / 0 |
(无) |
|
7898 |
codeforces#P1680D Dog Walking
|
0 / 0 |
(无) |
|
7897 |
codeforces#P1680E Moving Chips
|
0 / 0 |
(无) |
|
7896 |
codeforces#P1680F Lenient Vertex Cover
|
1 / 1 |
10 |
|
7927 |
codeforces#P1681A Game with Cards
|
1 / 1 |
10 |
|
7926 |
codeforces#P1681B Card Trick
|
1 / 1 |
10 |
|
7925 |
codeforces#P1681C Double Sort
|
1 / 1 |
10 |
|
7924 |
codeforces#P1681D Required Length
|
1 / 1 |
10 |
|
7923 |
codeforces#P1681E Labyrinth Adventures
|
1 / 1 |
10 |
|
7922 |
codeforces#P1681F Unique Occurrences
|
1 / 1 |
10 |
|
7921 |
codeforces#P1682A Palindromic Indices
|
0 / 0 |
(无) |
|
7920 |
codeforces#P1682B AND Sorting
|
0 / 0 |
(无) |
|
7919 |
codeforces#P1682C LIS or Reverse LIS?
|
0 / 0 |
(无) |
|
7918 |
codeforces#P1682D Circular Spanning Tree
|
0 / 0 |
(无) |
|
7917 |
codeforces#P1682E Unordered Swaps
|
0 / 0 |
(无) |
|
7916 |
codeforces#P1682F MCMF?
|
0 / 0 |
(无) |
|
7915 |
codeforces#P1684A Digit Minimization
|
0 / 0 |
(无) |
|
7914 |
codeforces#P1684B Z mod X = C
|
0 / 0 |
(无) |
|
7913 |
codeforces#P1684C Column Swapping
|
0 / 0 |
(无) |
|
7912 |
codeforces#P1684D Traps
|
1 / 1 |
10 |
|
7911 |
codeforces#P1684E MEX vs DIFF
|
0 / 0 |
(无) |
|
7910 |
codeforces#P1684F Diverse Segments
|
1 / 1 |
10 |
|
7909 |
codeforces#P1684G Euclid Guess
|
0 / 0 |
(无) |
|
7908 |
codeforces#P1684H Hard Cut
|
0 / 0 |
(无) |
|
7935 |
codeforces#P1685A Circular Local MiniMax
|
1 / 1 |
10 |
|
7934 |
codeforces#P1685B Linguistics
|
0 / 0 |
(无) |
|
7933 |
codeforces#P1685C Bring Balance
|
0 / 2 |
10 |
|
7932 |
codeforces#P1685D1 Permutation Weight (Easy Version)
|
0 / 0 |
(无) |
|
7931 |
codeforces#P1685D2 Permutation Weight (Hard Version)
|
0 / 0 |
(无) |
|
7930 |
codeforces#P1685E The Ultimate LIS Problem
|
0 / 0 |
(无) |
|
7929 |
codeforces#P1686A Everything Everywhere All But One
|
1 / 1 |
10 |
|
7928 |
codeforces#P1686B Odd Subarrays
|
0 / 0 |
(无) |