|
|
29980 |
codeforces#P1120C
Compress String
|
0 / 0 |
7 |
|
|
29981 |
codeforces#P1120D
Power Tree
|
0 / 0 |
9 |
|
|
29983 |
codeforces#P1120F
Secret Letters
|
0 / 0 |
10 |
|
|
29990 |
codeforces#P1129C
Morse Code
|
0 / 0 |
9 |
|
|
29991 |
codeforces#P1129D
Isolation
|
1 / 3 |
10 |
|
|
29999 |
codeforces#P1131D
Gourmet choice
|
1 / 3 |
7 |
|
|
30000 |
codeforces#P1131E
String Multiplication
|
0 / 0 |
8 |
|
|
30002 |
codeforces#P1131G
Most Dangerous Shark
|
0 / 0 |
10 |
|
|
30007 |
codeforces#P1132E
Knapsack
|
0 / 0 |
8 |
|
|
30008 |
codeforces#P1132F
Clear the String
|
0 / 0 |
7 |
|
|
30009 |
codeforces#P1132G
Greedy Subsequences
|
0 / 0 |
9 |
|
|
30014 |
codeforces#P1133E
K Balanced Teams
|
0 / 0 |
6 |
|
|
30024 |
codeforces#P1137C
Museums Tour
|
0 / 0 |
9 |
|
|
30033 |
codeforces#P1139D
Steps to One
|
0 / 1 |
8 |
|
|
30039 |
codeforces#P1140D
Minimum Triangulation
|
0 / 0 |
4 |
|
|
30040 |
codeforces#P1140E
Palindrome-less Arrays
|
0 / 0 |
8 |
|
|
30052 |
codeforces#P1142B
Lynyrd Skynyrd
|
0 / 0 |
7 |
|
|
30054 |
codeforces#P1142D
Foreigner
|
1 / 1 |
10 |
|
|
30065 |
codeforces#P1144G
Two Merged Sequences
|
0 / 0 |
9 |
|
|
30078 |
codeforces#P1146F
Leaf Partition
|
1 / 1 |
9 |
|
|
30079 |
codeforces#P1146G
Zoning Restrictions
|
0 / 0 |
10 |
|
|
30080 |
codeforces#P1146H
Satanic Panic
|
0 / 0 |
10 |
|
|
30096 |
codeforces#P1149B
Three Religions
|
0 / 0 |
8 |
|
|
30098 |
codeforces#P1149D
Abandoning Roads
|
0 / 0 |
10 |
|
|
30103 |
codeforces#P1151B
Dima and a Bad XOR
|
0 / 0 |
5 |
|
|
30106 |
codeforces#P1151E
Number of Components
|
2 / 6 |
7 |
|
|
30107 |
codeforces#P1151F
Sonya and Informatics
|
2 / 6 |
8 |
|
|
30111 |
codeforces#P1152D
Neko and Aki's Prank
|
0 / 0 |
7 |
|
|
30113 |
codeforces#P1152F1
Neko Rules the Catniverse (Small Version)
|
1 / 1 |
10 |
|
|
30114 |
codeforces#P1152F2
Neko Rules the Catniverse (Large Version)
|
1 / 1 |
10 |
|
|
30118 |
codeforces#P1153D
Serval and Rooted Tree
|
0 / 0 |
6 |
|
|
30120 |
codeforces#P1153F
Serval and Bonus Problem
|
0 / 0 |
10 |
|
|
30126 |
codeforces#P1154F
Shovels Shop
|
0 / 0 |
7 |
|
|
30131 |
codeforces#P1155D
Beautiful Array
|
1 / 2 |
6 |
|
|
30133 |
codeforces#P1155F
Delivery Oligopoly
|
0 / 0 |
10 |
|
|
30137 |
codeforces#P1156D
0-1-Tree
|
0 / 0 |
8 |
|
|
30139 |
codeforces#P1156F
Card Bag
|
0 / 0 |
8 |
|
|
30147 |
codeforces#P1157F
Maximum Balanced Circle
|
0 / 0 |
7 |
|
|
30154 |
codeforces#P1158F
Density of subarrays
|
0 / 0 |
10 |
|
|
30165 |
codeforces#P1163D
Mysterious Code
|
0 / 0 |
7 |
|
|
30190 |
codeforces#P1168C
And Reachability
|
0 / 0 |
8 |
|
|
30191 |
codeforces#P1168D
Anagram Paths
|
0 / 0 |
10 |
|
|
30203 |
codeforces#P1170I
Good Subsets
|
0 / 0 |
(无) |
|
|
30205 |
codeforces#P1172B
Nauuo and Circle
|
0 / 0 |
6 |
|
|
30206 |
codeforces#P1172C1
Nauuo and Pictures (easy version)
|
0 / 0 |
8 |
|
|
30207 |
codeforces#P1172C2
Nauuo and Pictures (hard version)
|
0 / 0 |
10 |
|
|
30217 |
codeforces#P1174E
Ehab and the Expected GCD Problem
|
1 / 6 |
9 |
|
|
30223 |
codeforces#P1175E
Minimal Segment Cover
|
1 / 1 |
8 |
|
|
30225 |
codeforces#P1175G
Yet Another Partiton Problem
|
0 / 0 |
10 |
|
|
30228 |
codeforces#P1176C
Lose it!
|
0 / 0 |
4 |
