|
34274 |
codeforces#P1910D
Remove and Add
|
0 / 0 |
6 |
|
34275 |
codeforces#P1910E
Maximum Sum Subarrays
|
0 / 0 |
7 |
|
34276 |
codeforces#P1910F
Build Railway Stations
|
0 / 0 |
7 |
|
34277 |
codeforces#P1910G
Pool Records
|
0 / 0 |
10 |
|
34278 |
codeforces#P1910H
Sum of Digits of Sums
|
0 / 0 |
9 |
|
34279 |
codeforces#P1910I
Inverse Problem
|
0 / 0 |
10 |
|
34280 |
codeforces#P1910J
Two Colors
|
0 / 0 |
10 |
|
34281 |
codeforces#P1912A
Accumulator Apex
|
0 / 0 |
6 |
|
34282 |
codeforces#P1912B
Blueprint for Seating
|
0 / 0 |
7 |
|
34283 |
codeforces#P1912C
__NO_TITLE__
|
0 / 0 |
(无) |
|
34284 |
codeforces#P1912D
Divisibility Test
|
1 / 5 |
6 |
|
34285 |
codeforces#P1912E
Evaluate It and Back Again
|
0 / 0 |
8 |
|
34286 |
codeforces#P1912F
Fugitive Frenzy
|
0 / 0 |
10 |
|
34287 |
codeforces#P1912G
__NO_TITLE__
|
0 / 0 |
(无) |
|
34288 |
codeforces#P1912H
Hypercatapult Commute
|
0 / 0 |
9 |
|
34289 |
codeforces#P1912I
__NO_TITLE__
|
0 / 0 |
(无) |
|
34290 |
codeforces#P1912J
__NO_TITLE__
|
0 / 0 |
(无) |
|
34291 |
codeforces#P1912K
Kim's Quest
|
0 / 0 |
6 |
|
34292 |
codeforces#P1912L
LOL Lovers
|
0 / 0 |
3 |
|
34293 |
codeforces#P1913A
Rating Increase
|
0 / 0 |
3 |
|
34294 |
codeforces#P1913B
Swap and Delete
|
0 / 0 |
3 |
|
34295 |
codeforces#P1913C
Game with Multiset
|
0 / 0 |
4 |
|
34296 |
codeforces#P1913D
Array Collapse
|
0 / 0 |
7 |
|
34297 |
codeforces#P1913E
Matrix Problem
|
0 / 0 |
9 |
|
34298 |
codeforces#P1913F
Palindromic Problem
|
0 / 0 |
10 |
|
34299 |
codeforces#P1914A
Problemsolving Log
|
0 / 0 |
3 |
|
34300 |
codeforces#P1914B
Preparing for the Contest
|
0 / 0 |
3 |
|
34301 |
codeforces#P1914C
Quests
|
0 / 0 |
3 |
|
34302 |
codeforces#P1914D
Three Activities
|
0 / 0 |
4 |
|
34303 |
codeforces#P1914E1
Game with Marbles (Easy Version)
|
0 / 0 |
4 |
|
34304 |
codeforces#P1914E2
Game with Marbles (Hard Version)
|
0 / 0 |
4 |
|
34305 |
codeforces#P1914F
Programming Competition
|
0 / 0 |
6 |
|
34306 |
codeforces#P1914G1
Light Bulbs (Easy Version)
|
0 / 0 |
7 |
|
34307 |
codeforces#P1914G2
Light Bulbs (Hard Version)
|
0 / 0 |
8 |
|
34308 |
codeforces#P1915A
Odd One Out
|
0 / 1 |
3 |
|
34309 |
codeforces#P1915B
Not Quite Latin Square
|
0 / 0 |
3 |
|
34310 |
codeforces#P1915C
Can I Square?
|
1 / 3 |
3 |
|
34311 |
codeforces#P1915D
Unnatural Language Processing
|
0 / 0 |
3 |
|
34312 |
codeforces#P1915E
Romantic Glasses
|
0 / 0 |
4 |
|
34313 |
codeforces#P1915F
Greetings
|
0 / 0 |
5 |
|
34314 |
codeforces#P1915G
Bicycles
|
1 / 2 |
6 |
|
34315 |
codeforces#P1916A
2023
|
1 / 1 |
3 |
|
34316 |
codeforces#P1916B
Two Divisors
|
1 / 1 |
3 |
|
34317 |
codeforces#P1916C
Training Before the Olympiad
|
1 / 1 |
4 |
|
34318 |
codeforces#P1916D
Mathematical Problem
|
0 / 0 |
5 |
|
34319 |
codeforces#P1916E
Happy Life in University
|
1 / 3 |
8 |
|
34320 |
codeforces#P1916F
Group Division
|
2 / 2 |
10 |
|
34321 |
codeforces#P1916G
Optimizations From Chelsu
|
0 / 0 |
10 |
|
34322 |
codeforces#P1916H1
Matrix Rank (Easy Version)
|
1 / 1 |
10 |
|
34323 |
codeforces#P1916H2
Matrix Rank (Hard Version)
|
1 / 1 |
10 |