|
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 / 0 |
(无) |
|
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 |
(无) |
|
33007 |
codeforces#P1691E
Number of Groups
|
0 / 0 |
(无) |
|
33008 |
codeforces#P1691F
K-Set Tree
|
1 / 2 |
10 |
|
33009 |
codeforces#P1692A
Marathon
|
1 / 1 |
10 |
|
33010 |
codeforces#P1692B
All Distinct
|
1 / 1 |
10 |
|
33011 |
codeforces#P1692C
Where's the Bishop?
|
0 / 0 |
(无) |
|
33012 |
codeforces#P1692D
The Clock
|
0 / 0 |
(无) |
|
33013 |
codeforces#P1692E
Binary Deque
|
0 / 0 |
(无) |
|
33014 |
codeforces#P1692F
3SUM
|
0 / 0 |
(无) |
|
33015 |
codeforces#P1692G
2^Sort
|
0 / 0 |
(无) |
|
33016 |
codeforces#P1692H
Gambling
|
0 / 15 |
10 |
|
33017 |
codeforces#P1693A
Directional Increase
|
0 / 0 |
(无) |
|
33018 |
codeforces#P1693B
Fake Plastic Trees
|
0 / 0 |
(无) |
|
33019 |
codeforces#P1693C
Keshi in Search of AmShZ
|
0 / 0 |
(无) |
|
33020 |
codeforces#P1693D
Decinc Dividing
|
0 / 0 |
(无) |
|
33021 |
codeforces#P1693E
Outermost Maximums
|
1 / 1 |
10 |
|
33022 |
codeforces#P1693F
I Might Be Wrong
|
0 / 0 |
(无) |
|
33023 |
codeforces#P1694A
Creep
|
0 / 0 |
(无) |