|
|
32930 |
codeforces#P1676G
White-Black Balanced Subtrees
|
0 / 0 |
(无) |
|
|
32931 |
codeforces#P1676H1
Maximum Crossings (Easy Version)
|
0 / 0 |
(无) |
|
|
32932 |
codeforces#P1676H2
Maximum Crossings (Hard Version)
|
0 / 0 |
(无) |
|
|
32933 |
codeforces#P1677A
Tokitsukaze and Strange Inequality
|
1 / 1 |
10 |
|
|
32934 |
codeforces#P1677B
Tokitsukaze and Meeting
|
2 / 3 |
10 |
|
|
32935 |
codeforces#P1677C
Tokitsukaze and Two Colorful Tapes
|
1 / 3 |
10 |
|
|
32936 |
codeforces#P1677D
Tokitsukaze and Permutations
|
0 / 0 |
(无) |
|
|
32937 |
codeforces#P1677E
Tokitsukaze and Beautiful Subsegments
|
0 / 0 |
(无) |
|
|
32938 |
codeforces#P1677F
Tokitsukaze and Gems
|
0 / 0 |
(无) |
|
|
32939 |
codeforces#P1678A
Tokitsukaze and All Zero Sequence
|
0 / 0 |
(无) |
|
|
32940 |
codeforces#P1678B1
Tokitsukaze and Good 01-String (easy version)
|
0 / 0 |
(无) |
|
|
32941 |
codeforces#P1678B2
Tokitsukaze and Good 01-String (hard version)
|
0 / 0 |
(无) |
|
|
32942 |
codeforces#P1679A
AvtoBus
|
0 / 0 |
(无) |
|
|
32943 |
codeforces#P1679B
Stone Age Problem
|
0 / 0 |
(无) |
|
|
32944 |
codeforces#P1679C
Rooks Defenders
|
0 / 1 |
10 |
|
|
32945 |
codeforces#P1679D
Toss a Coin to Your Graph...
|
1 / 3 |
10 |
|
|
32946 |
codeforces#P1679E
Typical Party in Dorm
|
0 / 0 |
(无) |
|
|
32947 |
codeforces#P1679F
Formalism for Formalism
|
0 / 0 |
(无) |
|
|
32948 |
codeforces#P1680A
Minimums and Maximums
|
0 / 0 |
(无) |
|
|
32949 |
codeforces#P1680B
Robots
|
0 / 0 |
(无) |
|
|
32950 |
codeforces#P1680C
Binary String
|
0 / 0 |
(无) |
|
|
32951 |
codeforces#P1680D
Dog Walking
|
0 / 0 |
(无) |
|
|
32952 |
codeforces#P1680E
Moving Chips
|
0 / 0 |
(无) |
|
|
32953 |
codeforces#P1680F
Lenient Vertex Cover
|
1 / 1 |
10 |
|
|
32954 |
codeforces#P1681A
Game with Cards
|
1 / 1 |
10 |
|
|
32955 |
codeforces#P1681B
Card Trick
|
1 / 1 |
10 |
|
|
32956 |
codeforces#P1681C
Double Sort
|
1 / 1 |
10 |
|
|
32957 |
codeforces#P1681D
Required Length
|
1 / 1 |
10 |
|
|
32958 |
codeforces#P1681E
Labyrinth Adventures
|
1 / 1 |
10 |
|
|
32959 |
codeforces#P1681F
Unique Occurrences
|
1 / 1 |
10 |
|
|
32960 |
codeforces#P1682A
Palindromic Indices
|
0 / 0 |
(无) |
|
|
32961 |
codeforces#P1682B
AND Sorting
|
0 / 0 |
(无) |
|
|
32962 |
codeforces#P1682C
LIS or Reverse LIS?
|
0 / 0 |
(无) |
|
|
32963 |
codeforces#P1682D
Circular Spanning Tree
|
0 / 0 |
(无) |
|
|
32964 |
codeforces#P1682E
Unordered Swaps
|
0 / 0 |
(无) |
|
|
32965 |
codeforces#P1682F
MCMF?
|
0 / 0 |
(无) |
|
|
32966 |
codeforces#P1684A
Digit Minimization
|
0 / 0 |
(无) |
|
|
32967 |
codeforces#P1684B
Z mod X = C
|
0 / 0 |
(无) |
|
|
32968 |
codeforces#P1684C
Column Swapping
|
0 / 0 |
(无) |
|
|
32969 |
codeforces#P1684D
Traps
|
1 / 1 |
10 |
|
|
32970 |
codeforces#P1684E
MEX vs DIFF
|
0 / 0 |
(无) |
|
|
32971 |
codeforces#P1684F
Diverse Segments
|
1 / 1 |
10 |
|
|
32972 |
codeforces#P1684G
Euclid Guess
|
0 / 0 |
(无) |
|
|
32973 |
codeforces#P1684H
Hard Cut
|
0 / 0 |
(无) |
|
|
32974 |
codeforces#P1685A
Circular Local MiniMax
|
1 / 1 |
10 |
|
|
32975 |
codeforces#P1685B
Linguistics
|
0 / 0 |
(无) |
|
|
32976 |
codeforces#P1685C
Bring Balance
|
0 / 2 |
10 |
|
|
32977 |
codeforces#P1685D1
Permutation Weight (Easy Version)
|
0 / 0 |
(无) |
|
|
32978 |
codeforces#P1685D2
Permutation Weight (Hard Version)
|
0 / 0 |
(无) |
|
|
32979 |
codeforces#P1685E
The Ultimate LIS Problem
|
0 / 0 |
(无) |
