|
|
30157 |
codeforces#P1160A2
Collaboration
|
0 / 0 |
(无) |
|
|
30158 |
codeforces#P1162A
Zoning Restrictions Again
|
1 / 1 |
3 |
|
|
30159 |
codeforces#P1162B
Double Matrix
|
0 / 0 |
4 |
|
|
30160 |
codeforces#P1163A
Eating Soup
|
0 / 0 |
3 |
|
|
30161 |
codeforces#P1163B1
Cat Party (Easy Edition)
|
1 / 2 |
5 |
|
|
30162 |
codeforces#P1163B2
Cat Party (Hard Edition)
|
0 / 0 |
5 |
|
|
30163 |
codeforces#P1163C1
Power Transmission (Easy Edition)
|
0 / 0 |
6 |
|
|
30164 |
codeforces#P1163C2
Power Transmission (Hard Edition)
|
0 / 0 |
6 |
|
|
30165 |
codeforces#P1163D
Mysterious Code
|
0 / 0 |
7 |
|
|
30166 |
codeforces#P1163E
Magical Permutation
|
0 / 0 |
9 |
|
|
30167 |
codeforces#P1163F
Indecisive Taxi Fee
|
1 / 2 |
10 |
|
|
30168 |
codeforces#P1165A
Remainder
|
0 / 0 |
3 |
|
|
30169 |
codeforces#P1165B
Polycarp Training
|
0 / 1 |
3 |
|
|
30170 |
codeforces#P1165C
Good String
|
0 / 0 |
4 |
|
|
30171 |
codeforces#P1165D
Almost All Divisors
|
0 / 0 |
5 |
|
|
30172 |
codeforces#P1165E
Two Arrays and Sum of Functions
|
0 / 0 |
5 |
|
|
30173 |
codeforces#P1165F1
Microtransactions (easy version)
|
0 / 0 |
7 |
|
|
30174 |
codeforces#P1165F2
Microtransactions (hard version)
|
0 / 0 |
7 |
|
|
30175 |
codeforces#P1166A
Silent Classroom
|
0 / 0 |
3 |
|
|
30176 |
codeforces#P1166B
All the Vowels Please
|
0 / 0 |
3 |
|
|
30177 |
codeforces#P1166C
A Tale of Two Lands
|
0 / 0 |
5 |
|
|
30178 |
codeforces#P1166D
Cute Sequences
|
0 / 0 |
8 |
|
|
30179 |
codeforces#P1166E
The LCMs Must be Large
|
1 / 1 |
7 |
|
|
30180 |
codeforces#P1166F
Vicky's Delivery Service
|
0 / 0 |
9 |
|
|
30181 |
codeforces#P1167A
Telephone Number
|
1 / 1 |
3 |
|
|
30182 |
codeforces#P1167B
Lost Numbers
|
0 / 0 |
4 |
|
|
30183 |
codeforces#P1167C
News Distribution
|
0 / 0 |
4 |
|
|
30184 |
codeforces#P1167D
Bicolored RBS
|
0 / 0 |
5 |
|
|
30185 |
codeforces#P1167E
Range Deleting
|
0 / 0 |
7 |
|
|
30186 |
codeforces#P1167F
Scalar Queries
|
2 / 10 |
8 |
|
|
30187 |
codeforces#P1167G
Low Budget Inception
|
0 / 0 |
10 |
|
|
30188 |
codeforces#P1168A
Increasing by Modulo
|
0 / 0 |
5 |
|
|
30189 |
codeforces#P1168B
Good Triple
|
0 / 0 |
6 |
|
|
30190 |
codeforces#P1168C
And Reachability
|
0 / 0 |
8 |
|
|
30191 |
codeforces#P1168D
Anagram Paths
|
0 / 0 |
10 |
|
|
30192 |
codeforces#P1168E
Xor Permutations
|
0 / 0 |
10 |
|
|
30193 |
codeforces#P1169A
Circle Metro
|
1 / 1 |
3 |
|
|
30194 |
codeforces#P1169B
Pairs
|
0 / 0 |
5 |
|
|
30195 |
codeforces#P1170A
Three Integers Again
|
0 / 0 |
(无) |
|
|
30196 |
codeforces#P1170B
Bad Days
|
0 / 0 |
(无) |
|
|
30197 |
codeforces#P1170C
Minus and Minus Give Plus
|
0 / 0 |
(无) |
|
|
30198 |
codeforces#P1170D
Decoding of Integer Sequences
|
0 / 0 |
(无) |
|
|
30199 |
codeforces#P1170E
Sliding Doors
|
0 / 0 |
(无) |
|
|
30200 |
codeforces#P1170F
Wheels
|
0 / 0 |
(无) |
|
|
30201 |
codeforces#P1170G
Graph Decomposition
|
0 / 0 |
(无) |
|
|
30202 |
codeforces#P1170H
Longest Saw
|
0 / 0 |
(无) |
|
|
30203 |
codeforces#P1170I
Good Subsets
|
0 / 0 |
(无) |
|
|
30204 |
codeforces#P1172A
Nauuo and Cards
|
0 / 2 |
6 |
|
|
30205 |
codeforces#P1172B
Nauuo and Circle
|
0 / 0 |
6 |
|
|
30206 |
codeforces#P1172C1
Nauuo and Pictures (easy version)
|
0 / 0 |
8 |
