|
|
34483 |
codeforces#P1941E
Rudolf and k Bridges
|
0 / 1 |
5 |
|
|
34490 |
codeforces#P1942D
Learning to Paint
|
0 / 0 |
(无) |
|
|
34492 |
codeforces#P1942F
Farmer John's Favorite Function
|
0 / 0 |
(无) |
|
|
34494 |
codeforces#P1942H
Farmer John's Favorite Intern
|
0 / 0 |
(无) |
|
|
34496 |
codeforces#P1943B
Non-Palindromic Substring
|
0 / 0 |
(无) |
|
|
34510 |
codeforces#P1945F
Kirill and Mushrooms
|
0 / 0 |
(无) |
|
|
34511 |
codeforces#P1945G
Cook and Porridge
|
0 / 0 |
(无) |
|
|
34518 |
codeforces#P1946F
Nobody is needed
|
0 / 0 |
9 |
|
|
34545 |
codeforces#P1951B
Battle Cows
|
0 / 1 |
10 |
|
|
34549 |
codeforces#P1951F
Inversion Composition
|
0 / 0 |
(无) |
|
|
34567 |
codeforces#P1954E
Chain Reaction
|
0 / 0 |
8 |
|
|
34570 |
codeforces#P1955B
Progressive Square
|
0 / 0 |
3 |
|
|
34572 |
codeforces#P1955D
Inaccurate Subsequence Search
|
0 / 0 |
4 |
|
|
34577 |
codeforces#P1956A
Nene's Game
|
0 / 0 |
3 |
|
|
34583 |
codeforces#P1956F
Nene and the Passing Game
|
0 / 0 |
10 |
|
|
34589 |
codeforces#P1957F1
Frequency Mismatch (Easy Version)
|
0 / 0 |
10 |
|
|
34590 |
codeforces#P1957F2
Frequency Mismatch (Hard Version)
|
0 / 0 |
10 |
|
|
34606 |
codeforces#P1965F
Conference
|
0 / 0 |
10 |
|
|
34612 |
codeforces#P1967C
Fenwick Tree
|
0 / 0 |
(无) |
|
|
34616 |
codeforces#P1967F
Next and Prev
|
0 / 0 |
(无) |
|
|
34622 |
codeforces#P1968F
Equal XOR Segments
|
0 / 0 |
(无) |
|
|
34623 |
codeforces#P1968G1
Division + LCP (easy version)
|
0 / 0 |
(无) |
|
|
34624 |
codeforces#P1968G2
Division + LCP (hard version)
|
0 / 0 |
(无) |
|
|
34628 |
codeforces#P1969D
Shop Game
|
0 / 0 |
(无) |
|
|
34629 |
codeforces#P1969E
Unique Array
|
0 / 0 |
(无) |
|
|
34663 |
codeforces#P1973B
Cat, Fox and the Lonely Array
|
0 / 0 |
4 |
|
|
34670 |
codeforces#P1974C
Beautiful Triple Pairs
|
0 / 0 |
4 |
|
|
34673 |
codeforces#P1974F
Cutting Game
|
0 / 0 |
6 |
|
|
34674 |
codeforces#P1974G
Money Buys Less Happiness Now
|
0 / 1 |
7 |
|
|
34679 |
codeforces#P1975E
Chain Queries
|
0 / 0 |
(无) |
|
|
34687 |
codeforces#P1976D
Invertible Bracket Sequences
|
0 / 0 |
(无) |
|
|
34692 |
codeforces#P1977C
Nikita and LCM
|
0 / 0 |
(无) |
|
|
34697 |
codeforces#P1978C
Manhattan Permutations
|
0 / 0 |
(无) |
|
|
34698 |
codeforces#P1978D
Elections
|
0 / 0 |
(无) |
|
|
34699 |
codeforces#P1978E
Computing Machine
|
0 / 0 |
(无) |
|
|
34700 |
codeforces#P1978F
Large Graph
|
0 / 0 |
(无) |
|
|
34705 |
codeforces#P1979E
Manhattan Triangle
|
0 / 0 |
(无) |
|
|
34711 |
codeforces#P1980E
Permutation of Rows and Columns
|
0 / 0 |
(无) |
|
|
34712 |
codeforces#P1980F1
Field Division (easy version)
|
0 / 0 |
(无) |
|
|
34714 |
codeforces#P1980G
Yasya and the Mysterious Tree
|
0 / 0 |
(无) |
|
|
34719 |
codeforces#P1981E
Turtle and Intersected Segments
|
1 / 1 |
10 |
|
|
34720 |
codeforces#P1981F
Turtle and Paths on a Tree
|
1 / 1 |
10 |
|
|
34723 |
codeforces#P1982C
Boring Day
|
0 / 0 |
(无) |
|
|
34724 |
codeforces#P1982D
Beauty of the mountains
|
0 / 0 |
(无) |
|
|
34726 |
codeforces#P1982F
Sorting Problem Again
|
0 / 0 |
(无) |
|
|
34730 |
codeforces#P1983D
Swap Dilemma
|
0 / 0 |
(无) |
|
|
34732 |
codeforces#P1983F
array-value
|
0 / 0 |
(无) |
|
|
34748 |
codeforces#P1985F
Final Boss
|
1 / 3 |
10 |
|
|
34750 |
codeforces#P1985H1
Maximize the Largest Component (Easy Version)
|
0 / 0 |
(无) |
|
|
34751 |
codeforces#P1985H2
Maximize the Largest Component (Hard Version)
|
0 / 0 |
(无) |
