|
|
7329 |
codeforces#P1578M The Mind
|
0 / 0 |
(无) |
|
|
7316 |
codeforces#P1579E1 Permutation Minimization by Deque
|
0 / 0 |
3 |
|
|
7324 |
codeforces#P1580E Railway Construction
|
0 / 0 |
10 |
|
|
7430 |
codeforces#P1582D Vupsen, Pupsen and 0
|
0 / 0 |
(无) |
|
|
7424 |
codeforces#P1583B Omkar and Heavenly Tree
|
0 / 0 |
(无) |
|
|
7422 |
codeforces#P1583D Omkar and the Meaning of Life
|
1 / 1 |
10 |
|
|
7421 |
codeforces#P1583E Moment of Bloom
|
0 / 0 |
(无) |
|
|
7420 |
codeforces#P1583F Defender of Childhood Dreams
|
0 / 0 |
(无) |
|
|
7417 |
codeforces#P1586I Omkar and Mosaic
|
0 / 0 |
(无) |
|
|
7359 |
codeforces#P1592C Bakry and Partitioning
|
0 / 0 |
(无) |
|
|
7384 |
codeforces#P1594D The Number of Imposters
|
1 / 2 |
5 |
|
|
7381 |
codeforces#P1594F Ideal Farm
|
0 / 0 |
9 |
|
|
7455 |
codeforces#P1603A Di-visible Confusion
|
0 / 0 |
4 |
|
|
7454 |
codeforces#P1603B Moderate Modular Mode
|
0 / 0 |
5 |
|
|
7448 |
codeforces#P1604B XOR Specia-LIS-t
|
0 / 0 |
3 |
|
|
7466 |
codeforces#P1605D Treelabeling
|
0 / 0 |
7 |
|
|
7444 |
codeforces#P1606D Red-Blue Matrix
|
0 / 0 |
9 |
|
|
7528 |
codeforces#P1608A Find Array
|
2 / 2 |
10 |
|
|
7527 |
codeforces#P1608B Build the Permutation
|
1 / 1 |
10 |
|
|
7526 |
codeforces#P1608C Game Master
|
1 / 1 |
10 |
|
|
7525 |
codeforces#P1608D Dominoes
|
1 / 2 |
10 |
|
|
7488 |
codeforces#P1610F Mashtali: a Space Oddysey
|
0 / 0 |
10 |
|
|
7507 |
codeforces#P1611A Make Even
|
0 / 0 |
3 |
|
|
7506 |
codeforces#P1611B Team Composition: Programmers and Mathematicians
|
1 / 1 |
3 |
|
|
7505 |
codeforces#P1611C Polycarp Recovers the Permutation
|
0 / 0 |
3 |
|
|
7504 |
codeforces#P1611D Weights Assignment For Tree Edges
|
0 / 0 |
5 |
|
|
7484 |
codeforces#P1612A Distance
|
1 / 1 |
10 |
|
|
7483 |
codeforces#P1612B Special Permutation
|
0 / 0 |
(无) |
|
|
7478 |
codeforces#P1612G Max Sum Array
|
0 / 0 |
(无) |
|
|
7517 |
codeforces#P1613E Crazy Robot
|
0 / 0 |
(无) |
|
|
7499 |
codeforces#P1614A Divan and a Store
|
2 / 5 |
3 |
|
|
7498 |
codeforces#P1614B Divan and a New Project
|
0 / 0 |
3 |
|
|
7497 |
codeforces#P1614C Divan and bitwise operations
|
0 / 0 |
5 |
|
|
7558 |
codeforces#P1615G Maximum Adjacent Pairs
|
0 / 0 |
(无) |
|
|
7557 |
codeforces#P1615H Reindeer Games
|
0 / 0 |
(无) |
|
|
7541 |
codeforces#P1617A Forbidden Subsequence
|
1 / 1 |
10 |
|
|
7540 |
codeforces#P1617B GCD Problem
|
0 / 0 |
(无) |
|
|
7538 |
codeforces#P1617D1 Too Many Impostors (easy version)
|
1 / 1 |
10 |
|
|
7537 |
codeforces#P1617D2 Too Many Impostors (hard version)
|
0 / 0 |
(无) |
|
|
7531 |
codeforces#P1618E Singers' Tour
|
0 / 0 |
(无) |
|
|
7552 |
codeforces#P1619E MEX and Increments
|
0 / 0 |
(无) |
|
|
7551 |
codeforces#P1619F Let's Play the Hat?
|
0 / 0 |
(无) |
|
|
7548 |
codeforces#P1620A Equal or Not Equal
|
2 / 5 |
10 |
|
|
7545 |
codeforces#P1620D Exact Change
|
0 / 0 |
(无) |
|
|
7592 |
codeforces#P1621A Stable Arrangement of Rooks
|
1 / 1 |
3 |
|
|
7589 |
codeforces#P1621D The Winter Hike
|
0 / 0 |
7 |
|
|
7565 |
codeforces#P1622F Quadratic Set
|
1 / 1 |
10 |
|
|
7597 |
codeforces#P1624C Division by Two and Permutation
|
0 / 0 |
(无) |
|
|
7595 |
codeforces#P1624E Masha-forgetful
|
0 / 0 |
(无) |
|
|
7594 |
codeforces#P1624F Interacdive Problem
|
0 / 0 |
(无) |
