|
|
2254 |
codeforces#P1108B Divisors of Two Integers
|
0 / 0 |
3 |
|
|
2253 |
codeforces#P1108C Nice Garland
|
0 / 0 |
4 |
|
|
2250 |
codeforces#P1108E1 Array and Segments (Easy version)
|
0 / 0 |
6 |
|
|
2245 |
codeforces#P1109D Sasha and Interesting Fact from Graph Theory
|
0 / 0 |
9 |
|
|
2233 |
codeforces#P1111B Average Superhero Gang Power
|
0 / 0 |
5 |
|
|
2232 |
codeforces#P1111C Creative Snap
|
0 / 0 |
5 |
|
|
2227 |
codeforces#P1114A Got Any Grapes?
|
0 / 0 |
3 |
|
|
2225 |
codeforces#P1114C Trailing Loves (or L'oeufs?)
|
0 / 0 |
5 |
|
|
2191 |
codeforces#P1118D1 Coffee and Coursework (Easy version)
|
0 / 0 |
5 |
|
|
2183 |
codeforces#P1119E Pavel and Triangles
|
0 / 0 |
6 |
|
|
2175 |
codeforces#P1120E The very same Munchhausen
|
0 / 0 |
10 |
|
|
2172 |
codeforces#P1121B Mike and Children
|
0 / 0 |
4 |
|
|
2170 |
codeforces#P1129A1 Toy Train (Simplified)
|
0 / 0 |
5 |
|
|
2169 |
codeforces#P1129A2 Toy Train
|
0 / 0 |
6 |
|
|
2162 |
codeforces#P1130C Connect
|
0 / 0 |
4 |
|
|
2152 |
codeforces#P1132C Painting the Fence
|
0 / 0 |
5 |
|
|
2128 |
codeforces#P1138B Circus
|
0 / 0 |
6 |
|
|
2119 |
codeforces#P1140C Playlist
|
0 / 0 |
5 |
|
|
2106 |
codeforces#P1142A The Beatles
|
0 / 0 |
5 |
|
|
2100 |
codeforces#P1143B Nirvana
|
0 / 0 |
4 |
|
|
2090 |
codeforces#P1145B Kanban Numbers
|
1 / 1 |
10 |
|
|
2089 |
codeforces#P1145C Mystery Circuit
|
1 / 1 |
10 |
|
|
2075 |
codeforces#P1147B Chladni Figure
|
0 / 0 |
6 |
|
|
2068 |
codeforces#P1148B Born This Way
|
0 / 0 |
5 |
|
|
2059 |
codeforces#P1149D Abandoning Roads
|
0 / 0 |
10 |
|
|
2055 |
codeforces#P1151A Maxim and Biology
|
0 / 0 |
3 |
|
|
2054 |
codeforces#P1151B Dima and a Bad XOR
|
0 / 0 |
5 |
|
|
2047 |
codeforces#P1152C Neko does Maths
|
0 / 0 |
6 |
|
|
2042 |
codeforces#P1153A Serval and Bus
|
0 / 0 |
3 |
|
|
2038 |
codeforces#P1153E Serval and Snake
|
0 / 0 |
8 |
|
|
2030 |
codeforces#P1154G Minimum Possible LCM
|
0 / 0 |
8 |
|
|
2026 |
codeforces#P1155D Beautiful Array
|
1 / 2 |
6 |
|
|
2025 |
codeforces#P1155E Guess the Root
|
0 / 0 |
8 |
|
|
2024 |
codeforces#P1155F Delivery Oligopoly
|
0 / 0 |
10 |
|
|
2009 |
codeforces#P1157G Inverse of Rows and Columns
|
1 / 1 |
8 |
|
|
1998 |
codeforces#P1162B Double Matrix
|
0 / 0 |
4 |
|
|
1994 |
codeforces#P1163C1 Power Transmission (Easy Edition)
|
0 / 0 |
6 |
|
|
1991 |
codeforces#P1163E Magical Permutation
|
0 / 0 |
9 |
|
|
1979 |
codeforces#P1166D Cute Sequences
|
0 / 0 |
8 |
|
|
1978 |
codeforces#P1166E The LCMs Must be Large
|
1 / 1 |
7 |
|
|
1976 |
codeforces#P1167A Telephone Number
|
1 / 1 |
3 |
|
|
1974 |
codeforces#P1167B Lost Numbers
|
0 / 0 |
4 |
|
|
1969 |
codeforces#P1167G Low Budget Inception
|
0 / 0 |
10 |
|
|
1968 |
codeforces#P1168B Good Triple
|
0 / 0 |
6 |
|
|
1936 |
codeforces#P1175C Electrification
|
0 / 0 |
5 |
|
|
1933 |
codeforces#P1175F The Number of Subpermutations
|
1 / 2 |
9 |
|
|
1931 |
codeforces#P1176A Divide it!
|
1 / 1 |
3 |
|
|
1919 |
codeforces#P1178E Archaeology
|
0 / 0 |
6 |
|
|
1905 |
codeforces#P1181C Flag
|
0 / 0 |
6 |
|
|
1903 |
codeforces#P1181E1 A Story of One Country (Easy)
|
0 / 0 |
9 |
