|
|
29716 |
codeforces#P1073F
Choosing Two Paths
|
0 / 0 |
9 |
|
|
29725 |
codeforces#P1076F
Summer Practice Report
|
0 / 0 |
9 |
|
|
29732 |
codeforces#P1077F1
Pictures with Kittens (easy version)
|
0 / 0 |
6 |
|
|
29733 |
codeforces#P1077F2
Pictures with Kittens (hard version)
|
0 / 0 |
7 |
|
|
29743 |
codeforces#P1081C
Colorful Bricks
|
0 / 0 |
5 |
|
|
29753 |
codeforces#P1082E
Increasing Frequency
|
0 / 0 |
7 |
|
|
29754 |
codeforces#P1082F
Speed Dial
|
0 / 0 |
10 |
|
|
29756 |
codeforces#P1083A
The Fair Nut and the Best Path
|
0 / 0 |
6 |
|
|
29760 |
codeforces#P1083E
The Fair Nut and Rectangles
|
0 / 0 |
9 |
|
|
29764 |
codeforces#P1084C
The Fair Nut and String
|
0 / 0 |
5 |
|
|
29771 |
codeforces#P1085G
Beautiful Matrix
|
0 / 0 |
10 |
|
|
29777 |
codeforces#P1088E
Ehab and a component choosing problem
|
0 / 0 |
9 |
|
|
29779 |
codeforces#P1089A
Alice the Fan
|
0 / 0 |
8 |
|
|
29808 |
codeforces#P1091D
New Year and the Permutation Concatenation
|
0 / 0 |
5 |
|
|
29819 |
codeforces#P1092F
Tree with Maximum Cost
|
1 / 8 |
6 |
|
|
29825 |
codeforces#P1093F
Vasya and Array
|
0 / 0 |
9 |
|
|
29836 |
codeforces#P1096D
Easy Problem
|
0 / 0 |
6 |
|
|
29837 |
codeforces#P1096E
The Top Scorer
|
1 / 2 |
9 |
|
|
29838 |
codeforces#P1096F
Inversion Expectation
|
0 / 0 |
8 |
|
|
29839 |
codeforces#P1096G
Lucky Tickets
|
0 / 0 |
9 |
|
|
29841 |
codeforces#P1097B
Petr and a Combination Lock
|
0 / 0 |
4 |
|
|
29843 |
codeforces#P1097D
Makoto and a Blackboard
|
0 / 0 |
8 |
|
|
29846 |
codeforces#P1097G
Vladislav and a Great Legend
|
0 / 0 |
10 |
|
|
29847 |
codeforces#P1097H
Mateusz and an Infinite Sequence
|
0 / 0 |
10 |
|
|
29857 |
codeforces#P1099F
Cookies
|
0 / 0 |
9 |
|
|
29867 |
codeforces#P1101D
GCD Counting
|
0 / 0 |
7 |
|
|
29869 |
codeforces#P1101F
Trucks and Cities
|
0 / 2 |
9 |
|
|
29876 |
codeforces#P1102F
Elongated Matrix
|
0 / 0 |
7 |
|
|
29880 |
codeforces#P1103D
Professional layer
|
0 / 0 |
10 |
|
|
29886 |
codeforces#P1105C
Ayoub and Lost Array
|
0 / 0 |
5 |
|
|
29888 |
codeforces#P1105E
Helping Hiasat
|
0 / 0 |
8 |
|
|
29893 |
codeforces#P1106E
Lunar New Year and Red Envelopes
|
0 / 0 |
7 |
|
|
29898 |
codeforces#P1107D
Compression
|
0 / 0 |
6 |
|
|
29899 |
codeforces#P1107E
Vasya and Binary String
|
0 / 0 |
9 |
|
|
29900 |
codeforces#P1107F
Vasya and Endless Credits
|
0 / 0 |
10 |
|
|
29901 |
codeforces#P1107G
Vasya and Maximum Profit
|
0 / 0 |
9 |
|
|
29905 |
codeforces#P1108D
Diverse Garland
|
0 / 0 |
4 |
|
|
29909 |
codeforces#P1109A
Sasha and a Bit of Relax
|
0 / 0 |
5 |
|
|
29912 |
codeforces#P1109D
Sasha and Interesting Fact from Graph Theory
|
0 / 0 |
9 |
|
|
29918 |
codeforces#P1110D
Jongmah
|
0 / 0 |
8 |
|
|
29922 |
codeforces#P1110H
Modest Substrings
|
0 / 0 |
10 |
|
|
29926 |
codeforces#P1111D
Destroy the Colony
|
0 / 0 |
10 |
|
|
29927 |
codeforces#P1111E
Tree
|
0 / 0 |
9 |
|
|
29928 |
codeforces#P1113A
Sasha and His Trip
|
0 / 0 |
3 |
|
|
29933 |
codeforces#P1114D
Flood Fill
|
1 / 2 |
6 |
|
|
29958 |
codeforces#P1117D
Magic Gems
|
1 / 1 |
7 |
|
|
29960 |
codeforces#P1117F
Crisp String
|
0 / 0 |
9 |
|
|
29969 |
codeforces#P1118F2
Tree Cutting (Hard Version)
|
1 / 2 |
10 |
|
|
29974 |
codeforces#P1119E
Pavel and Triangles
|
0 / 0 |
6 |
|
|
29975 |
codeforces#P1119F
Niyaz and Small Degrees
|
0 / 0 |
10 |
