|
28703 |
codeforces#P846D
Monitor
|
0 / 0 |
6 |
|
28714 |
codeforces#P847I
Noise Level
|
0 / 0 |
6 |
|
28720 |
codeforces#P848B
Rooter's Song
|
0 / 0 |
6 |
|
28779 |
codeforces#P862C
Mahmoud and Ehab and the xor
|
0 / 0 |
6 |
|
28797 |
codeforces#P865B
Ordering Pizza
|
0 / 0 |
6 |
|
28856 |
codeforces#P883G
Orientation of Edges
|
0 / 0 |
6 |
|
28858 |
codeforces#P883I
Photo Processing
|
0 / 0 |
6 |
|
28899 |
codeforces#P893D
Credit Card
|
0 / 0 |
6 |
|
28904 |
codeforces#P894C
Marco and GCD Sequence
|
0 / 0 |
6 |
|
28969 |
codeforces#P909E
Coprocessor
|
0 / 0 |
6 |
|
28997 |
codeforces#P914D
Bash and a Tough Math Puzzle
|
1 / 1 |
6 |
|
29062 |
codeforces#P926E
Merge Equal Elements
|
0 / 0 |
6 |
|
29071 |
codeforces#P928C
Dependency management
|
0 / 0 |
6 |
|
29072 |
codeforces#P928D
Autocompletion
|
0 / 0 |
6 |
|
29079 |
codeforces#P930C
Teodor is not a liar!
|
0 / 0 |
6 |
|
29102 |
codeforces#P935D
Fafa and Ancient Alphabet
|
0 / 0 |
6 |
|
29140 |
codeforces#P949C
Data Center Maintenance
|
0 / 0 |
6 |
|
29147 |
codeforces#P952B
A Map of the Cat
|
1 / 1 |
6 |
|
29188 |
codeforces#P959D
Mahmoud and Ehab and another array construction task
|
0 / 0 |
6 |
|
29189 |
codeforces#P959E
Mahmoud and Ehab and the xor-MST
|
0 / 0 |
6 |
|
29204 |
codeforces#P961E
Tufurama
|
2 / 2 |
6 |
|
29224 |
codeforces#P965D
Single-use Stones
|
0 / 0 |
6 |
|
29266 |
codeforces#P981D
Bookshelves
|
0 / 0 |
6 |
|
29274 |
codeforces#P982D
Shark
|
0 / 0 |
6 |
|
29330 |
codeforces#P993B
Open Communication
|
0 / 0 |
6 |
|
29355 |
codeforces#P999D
Equalize the Remainders
|
0 / 0 |
6 |
|
29361 |
codeforces#P1000D
Yet Another Problem On a Subsequence
|
1 / 2 |
6 |
|
29378 |
codeforces#P1002A4
Generate W state
|
0 / 0 |
6 |
|
29389 |
codeforces#P1002E2
Another array reconstruction algorithm
|
0 / 0 |
6 |
|
29438 |
codeforces#P1012B
Chemical table
|
0 / 0 |
6 |
|
29439 |
codeforces#P1012C
Hills
|
0 / 0 |
6 |
|
29450 |
codeforces#P1015E2
Stars Drawing (Hard Edition)
|
0 / 0 |
6 |
|
29462 |
codeforces#P1017D
The Wu
|
0 / 0 |
6 |
|
29506 |
codeforces#P1029D
Concatenated Multiples
|
0 / 0 |
6 |
|
29519 |
codeforces#P1031D
Minimum path
|
0 / 0 |
6 |
|
29525 |
codeforces#P1032D
Barcelonian Distance
|
0 / 0 |
6 |
|
29543 |
codeforces#P1036C
Classy Numbers
|
0 / 0 |
6 |
|
29573 |
codeforces#P1041E
Tree Reconstruction
|
0 / 0 |
6 |
|
29585 |
codeforces#P1043E
Train Hard, Win Easy
|
0 / 0 |
6 |
|
29589 |
codeforces#P1044B
Intersecting Subtrees
|
0 / 0 |
6 |
|
29620 |
codeforces#P1054D
Changing Array
|
0 / 0 |
6 |
|
29627 |
codeforces#P1055C
Lucky Days
|
0 / 0 |
6 |
|
29651 |
codeforces#P1060D
Social Circles
|
0 / 0 |
6 |
|
29670 |
codeforces#P1063C
Dwarves, Hats and Extrasensory Abilities
|
0 / 0 |
6 |
|
29689 |
codeforces#P1067A
Array Without Local Maximums
|
0 / 0 |
6 |
|
29724 |
codeforces#P1076E
Vasya and a Tree
|
0 / 0 |
6 |
|
29732 |
codeforces#P1077F1
Pictures with Kittens (easy version)
|
0 / 0 |
6 |
|
29745 |
codeforces#P1081E
Missing Numbers
|
0 / 0 |
6 |
|
29784 |
codeforces#P1089F
Fractions
|
0 / 0 |
6 |
|
29819 |
codeforces#P1092F
Tree with Maximum Cost
|
1 / 8 |
6 |