|
|
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 |
|
|
30207 |
codeforces#P1172C2
Nauuo and Pictures (hard version)
|
0 / 0 |
10 |
|
|
30208 |
codeforces#P1172D
Nauuo and Portals
|
0 / 0 |
10 |
|
|
30209 |
codeforces#P1172E
Nauuo and ODT
|
0 / 0 |
10 |
|
|
30210 |
codeforces#P1172F
Nauuo and Bug
|
0 / 0 |
10 |
|
|
30211 |
codeforces#P1173A
Nauuo and Votes
|
1 / 1 |
3 |
|
|
30212 |
codeforces#P1173B
Nauuo and Chess
|
0 / 0 |
3 |
|
|
30213 |
codeforces#P1174A
Ehab Fails to Be Thanos
|
0 / 0 |
3 |
|
|
30214 |
codeforces#P1174B
Ehab Is an Odd Person
|
0 / 0 |
4 |
|
|
30215 |
codeforces#P1174C
Ehab and a Special Coloring Problem
|
0 / 0 |
4 |
|
|
30216 |
codeforces#P1174D
Ehab and the Expected XOR Problem
|
1 / 1 |
6 |
|
|
30217 |
codeforces#P1174E
Ehab and the Expected GCD Problem
|
1 / 6 |
9 |
|
|
30218 |
codeforces#P1174F
Ehab and the Big Finale
|
0 / 0 |
9 |
|
|
30219 |
codeforces#P1175A
From Hero to Zero
|
0 / 0 |
3 |
|
|
30220 |
codeforces#P1175B
Catch Overflow!
|
0 / 0 |
5 |
|
|
30221 |
codeforces#P1175C
Electrification
|
0 / 0 |
5 |
|
|
30222 |
codeforces#P1175D
Array Splitting
|
0 / 0 |
6 |
|
|
30223 |
codeforces#P1175E
Minimal Segment Cover
|
1 / 1 |
8 |
