|
|
32957 |
codeforces#P1681D
Required Length
|
1 / 2 |
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 |
(无) |
|
|
32980 |
codeforces#P1686A
Everything Everywhere All But One
|
1 / 1 |
10 |
|
|
32981 |
codeforces#P1686B
Odd Subarrays
|
0 / 0 |
(无) |
|
|
32982 |
codeforces#P1687A
The Enchanted Forest
|
0 / 0 |
(无) |
|
|
32983 |
codeforces#P1687B
Railway System
|
0 / 0 |
(无) |
|
|
32984 |
codeforces#P1687C
Sanae and Giant Robot
|
0 / 1 |
10 |
|
|
32985 |
codeforces#P1687D
Cute number
|
0 / 0 |
(无) |
|
|
32986 |
codeforces#P1687E
Become Big For Me
|
0 / 1 |
10 |
|
|
32987 |
codeforces#P1687F
Koishi's Unconscious Permutation
|
0 / 0 |
(无) |
|
|
32988 |
codeforces#P1688A
Cirno's Perfect Bitmasks Classroom
|
0 / 0 |
(无) |
|
|
32989 |
codeforces#P1688B
Patchouli's Magical Talisman
|
0 / 0 |
(无) |
|
|
32990 |
codeforces#P1688C
Manipulating History
|
0 / 0 |
(无) |
|
|
32991 |
codeforces#P1689A
Lex String
|
0 / 0 |
(无) |
|
|
32992 |
codeforces#P1689B
Mystic Permutation
|
0 / 0 |
(无) |
|
|
32993 |
codeforces#P1689C
Infected Tree
|
0 / 0 |
(无) |
|
|
32994 |
codeforces#P1689D
Lena and Matrix
|
0 / 0 |
(无) |
|
|
32995 |
codeforces#P1689E
ANDfinity
|
0 / 0 |
(无) |
|
|
32996 |
codeforces#P1690A
Print a Pedestal (Codeforces logo?)
|
0 / 0 |
(无) |
|
|
32997 |
codeforces#P1690B
Array Decrements
|
0 / 0 |
(无) |
|
|
32998 |
codeforces#P1690C
Restoring the Duration of Tasks
|
0 / 0 |
(无) |
|
|
32999 |
codeforces#P1690D
Black and White Stripe
|
0 / 0 |
(无) |
|
|
33000 |
codeforces#P1690E
Price Maximization
|
0 / 0 |
(无) |
|
|
33001 |
codeforces#P1690F
Shifting String
|
0 / 0 |
(无) |
|
|
33002 |
codeforces#P1690G
Count the Trains
|
1 / 5 |
10 |
|
|
33003 |
codeforces#P1691A
Beat The Odds
|
0 / 0 |
(无) |
|
|
33004 |
codeforces#P1691B
Shoe Shuffling
|
0 / 0 |
(无) |
|
|
33005 |
codeforces#P1691C
Sum of Substrings
|
0 / 0 |
(无) |
|
|
33006 |
codeforces#P1691D
Max GEQ Sum
|
0 / 0 |
(无) |
