|
9050 |
codeforces#P1879F Last Man Standing
|
0 / 0 |
10 |
|
9099 |
codeforces#P1881D Divide and Equalize
|
1 / 1 |
10 |
|
9045 |
codeforces#P1882E1 Two Permutations (Easy Version)
|
1 / 6 |
10 |
|
9109 |
codeforces#P1884D Counting Rhyme
|
0 / 0 |
(无) |
|
9123 |
codeforces#P1891D Suspicious logarithms
|
1 / 3 |
10 |
|
9176 |
codeforces#P1896H1 Cyclic Hamming (Easy Version)
|
0 / 0 |
(无) |
|
9175 |
codeforces#P1896H2 Cyclic Hamming (Hard Version)
|
0 / 0 |
(无) |
|
9156 |
codeforces#P1899A Game with Integers
|
2 / 2 |
10 |
|
9155 |
codeforces#P1899B 250 Thousand Tons of TNT
|
1 / 1 |
10 |
|
9153 |
codeforces#P1899D Yarik and Musical Notes
|
1 / 1 |
10 |
|
9171 |
codeforces#P1900D Small GCD
|
1 / 1 |
10 |
|
9214 |
codeforces#P1902C Insert and Equalize
|
0 / 0 |
4 |
|
9204 |
codeforces#P1906G Grid Game 2
|
0 / 0 |
10 |
|
9193 |
codeforces#P1907E Good Triples
|
1 / 1 |
5 |
|
9297 |
codeforces#P1909B Make Almost Equal With Mod
|
0 / 0 |
4 |
|
9295 |
codeforces#P1909D Split Plus K
|
1 / 2 |
6 |
|
9294 |
codeforces#P1909E Multiple Lamps
|
0 / 0 |
9 |
|
9266 |
codeforces#P1916A 2023
|
1 / 1 |
3 |
|
9265 |
codeforces#P1916B Two Divisors
|
1 / 1 |
3 |
|
9260 |
codeforces#P1916G Optimizations From Chelsu
|
0 / 0 |
10 |
|
9254 |
codeforces#P1917D Yet Another Inversions Problem
|
1 / 2 |
8 |
|
9319 |
codeforces#P1920C Partitioning the Array
|
1 / 2 |
5 |
|
9329 |
codeforces#P1925B A Balanced Problemset?
|
0 / 0 |
(无) |
|
9389 |
codeforces#P1926E Vlad and an Odd Ordering
|
0 / 0 |
(无) |
|
9377 |
codeforces#P1928C Physical Education Lesson
|
0 / 0 |
5 |
|
9375 |
codeforces#P1928E Modular Sequence
|
0 / 0 |
8 |
|
9354 |
codeforces#P1931D Divisible Pairs
|
1 / 1 |
4 |
|
9351 |
codeforces#P1931G One-Dimensional Puzzle
|
1 / 1 |
7 |
|
9349 |
codeforces#P1932B Chaya Calendar
|
0 / 0 |
(无) |
|
9346 |
codeforces#P1932E Final Countdown
|
0 / 0 |
(无) |
|
9344 |
codeforces#P1932G Moving Platforms
|
0 / 0 |
(无) |
|
9432 |
codeforces#P1933B Turtle Math: Fast Three Task
|
1 / 2 |
10 |
|
9431 |
codeforces#P1933C Turtle Fingers: Count the Values of k
|
0 / 0 |
(无) |
|
9430 |
codeforces#P1933D Turtle Tenacity: Continual Mods
|
0 / 0 |
(无) |
|
9478 |
codeforces#P1945B Fireworks
|
0 / 0 |
(无) |
|
9472 |
codeforces#P1945H GCD is Greater
|
1 / 2 |
10 |
|
9481 |
codeforces#P1946E Girl Permutation
|
0 / 0 |
8 |
|
9480 |
codeforces#P1946F Nobody is needed
|
0 / 0 |
9 |
|
9500 |
codeforces#P1950D Product of Binary Decimals
|
0 / 0 |
(无) |
|
9499 |
codeforces#P1950E Nearly Shortest Repeating Substring
|
1 / 8 |
10 |
|
9610 |
codeforces#P1954C Long Multiplication
|
0 / 0 |
4 |
|
9608 |
codeforces#P1954E Chain Reaction
|
0 / 0 |
8 |
|
9600 |
codeforces#P1955G GCD on a grid
|
0 / 0 |
6 |
|
9587 |
codeforces#P1957E Carousel of Combinations
|
0 / 0 |
9 |
|
9583 |
codeforces#P1965B Missing Subsequence Sum
|
0 / 0 |
6 |
|
9575 |
codeforces#P1967B1 Reverse Card (Easy Version)
|
0 / 0 |
(无) |
|
9574 |
codeforces#P1967B2 Reverse Card (Hard Version)
|
0 / 0 |
(无) |
|
9568 |
codeforces#P1968A Maximize?
|
1 / 1 |
10 |
|
9566 |
codeforces#P1968C Assembly via Remainders
|
0 / 0 |
(无) |
|
9637 |
codeforces#P1973F Maximum GCD Sum Queries
|
0 / 0 |
10 |