|
|
32397 |
codeforces#P1578M
The Mind
|
0 / 0 |
(无) |
|
|
32402 |
codeforces#P1579E1
Permutation Minimization by Deque
|
0 / 0 |
3 |
|
|
32410 |
codeforces#P1580E
Railway Construction
|
0 / 0 |
10 |
|
|
32417 |
codeforces#P1582D
Vupsen, Pupsen and 0
|
0 / 0 |
(无) |
|
|
32423 |
codeforces#P1583B
Omkar and Heavenly Tree
|
0 / 0 |
(无) |
|
|
32425 |
codeforces#P1583D
Omkar and the Meaning of Life
|
1 / 1 |
10 |
|
|
32426 |
codeforces#P1583E
Moment of Bloom
|
0 / 0 |
(无) |
|
|
32427 |
codeforces#P1583F
Defender of Childhood Dreams
|
0 / 0 |
(无) |
|
|
32444 |
codeforces#P1586I
Omkar and Mosaic
|
0 / 0 |
(无) |
|
|
32448 |
codeforces#P1592C
Bakry and Partitioning
|
0 / 0 |
(无) |
|
|
32464 |
codeforces#P1594D
The Number of Imposters
|
1 / 2 |
5 |
|
|
32467 |
codeforces#P1594F
Ideal Farm
|
0 / 0 |
9 |
|
|
32496 |
codeforces#P1603A
Di-visible Confusion
|
0 / 0 |
4 |
|
|
32497 |
codeforces#P1603B
Moderate Modular Mode
|
0 / 0 |
5 |
|
|
32503 |
codeforces#P1604B
XOR Specia-LIS-t
|
0 / 0 |
3 |
|
|
32507 |
codeforces#P1605D
Treelabeling
|
0 / 0 |
7 |
|
|
32513 |
codeforces#P1606D
Red-Blue Matrix
|
0 / 0 |
9 |
|
|
32524 |
codeforces#P1608A
Find Array
|
2 / 2 |
10 |
|
|
32525 |
codeforces#P1608B
Build the Permutation
|
1 / 1 |
10 |
|
|
32526 |
codeforces#P1608C
Game Master
|
1 / 1 |
10 |
|
|
32527 |
codeforces#P1608D
Dominoes
|
1 / 2 |
10 |
|
|
32544 |
codeforces#P1610F
Mashtali: a Space Oddysey
|
0 / 0 |
10 |
|
|
32548 |
codeforces#P1611A
Make Even
|
0 / 0 |
3 |
|
|
32549 |
codeforces#P1611B
Team Composition: Programmers and Mathematicians
|
1 / 1 |
3 |
|
|
32550 |
codeforces#P1611C
Polycarp Recovers the Permutation
|
0 / 0 |
3 |
|
|
32551 |
codeforces#P1611D
Weights Assignment For Tree Edges
|
0 / 0 |
5 |
|
|
32556 |
codeforces#P1612A
Distance
|
1 / 1 |
10 |
|
|
32557 |
codeforces#P1612B
Special Permutation
|
0 / 0 |
(无) |
|
|
32562 |
codeforces#P1612G
Max Sum Array
|
0 / 0 |
(无) |
|
|
32567 |
codeforces#P1613E
Crazy Robot
|
0 / 0 |
(无) |
|
|
32569 |
codeforces#P1614A
Divan and a Store
|
2 / 5 |
3 |
|
|
32570 |
codeforces#P1614B
Divan and a New Project
|
0 / 0 |
3 |
|
|
32571 |
codeforces#P1614C
Divan and bitwise operations
|
0 / 0 |
5 |
|
|
32581 |
codeforces#P1615G
Maximum Adjacent Pairs
|
0 / 0 |
(无) |
|
|
32582 |
codeforces#P1615H
Reindeer Games
|
0 / 0 |
(无) |
|
|
32591 |
codeforces#P1617A
Forbidden Subsequence
|
1 / 1 |
10 |
|
|
32592 |
codeforces#P1617B
GCD Problem
|
0 / 0 |
(无) |
|
|
32594 |
codeforces#P1617D1
Too Many Impostors (easy version)
|
1 / 1 |
10 |
|
|
32595 |
codeforces#P1617D2
Too Many Impostors (hard version)
|
0 / 0 |
(无) |
|
|
32601 |
codeforces#P1618E
Singers' Tour
|
0 / 0 |
(无) |
|
|
32608 |
codeforces#P1619E
MEX and Increments
|
0 / 0 |
(无) |
|
|
32609 |
codeforces#P1619F
Let's Play the Hat?
|
0 / 0 |
(无) |
|
|
32612 |
codeforces#P1620A
Equal or Not Equal
|
2 / 5 |
10 |
|
|
32615 |
codeforces#P1620D
Exact Change
|
0 / 0 |
(无) |
|
|
32619 |
codeforces#P1621A
Stable Arrangement of Rooks
|
1 / 1 |
3 |
|
|
32622 |
codeforces#P1621D
The Winter Hike
|
0 / 0 |
7 |
|
|
32633 |
codeforces#P1622F
Quadratic Set
|
1 / 1 |
10 |
|
|
32641 |
codeforces#P1624C
Division by Two and Permutation
|
0 / 0 |
(无) |
|
|
32643 |
codeforces#P1624E
Masha-forgetful
|
0 / 0 |
(无) |
|
|
32644 |
codeforces#P1624F
Interacdive Problem
|
0 / 0 |
(无) |
