|
|
34114 |
codeforces#P1879F
Last Man Standing
|
0 / 0 |
10 |
|
|
34118 |
codeforces#P1881D
Divide and Equalize
|
1 / 1 |
10 |
|
|
34126 |
codeforces#P1882E1
Two Permutations (Easy Version)
|
1 / 6 |
10 |
|
|
34139 |
codeforces#P1884D
Counting Rhyme
|
0 / 0 |
(无) |
|
|
34164 |
codeforces#P1891D
Suspicious logarithms
|
1 / 3 |
10 |
|
|
34188 |
codeforces#P1896H1
Cyclic Hamming (Easy Version)
|
0 / 0 |
(无) |
|
|
34189 |
codeforces#P1896H2
Cyclic Hamming (Hard Version)
|
0 / 0 |
(无) |
|
|
34196 |
codeforces#P1899A
Game with Integers
|
2 / 2 |
10 |
|
|
34197 |
codeforces#P1899B
250 Thousand Tons of TNT
|
1 / 1 |
10 |
|
|
34199 |
codeforces#P1899D
Yarik and Musical Notes
|
1 / 1 |
10 |
|
|
34206 |
codeforces#P1900D
Small GCD
|
1 / 1 |
10 |
|
|
34217 |
codeforces#P1902C
Insert and Equalize
|
0 / 0 |
4 |
|
|
34247 |
codeforces#P1906G
Grid Game 2
|
0 / 0 |
10 |
|
|
34258 |
codeforces#P1907E
Good Triples
|
1 / 1 |
5 |
|
|
34262 |
codeforces#P1909B
Make Almost Equal With Mod
|
0 / 0 |
4 |
|
|
34264 |
codeforces#P1909D
Split Plus K
|
1 / 2 |
6 |
|
|
34265 |
codeforces#P1909E
Multiple Lamps
|
0 / 0 |
9 |
|
|
34315 |
codeforces#P1916A
2023
|
1 / 1 |
3 |
|
|
34316 |
codeforces#P1916B
Two Divisors
|
1 / 1 |
3 |
|
|
34321 |
codeforces#P1916G
Optimizations From Chelsu
|
0 / 0 |
10 |
|
|
34327 |
codeforces#P1917D
Yet Another Inversions Problem
|
1 / 2 |
8 |
|
|
34348 |
codeforces#P1920C
Partitioning the Array
|
1 / 2 |
5 |
|
|
34379 |
codeforces#P1925B
A Balanced Problemset?
|
0 / 0 |
(无) |
|
|
34385 |
codeforces#P1926E
Vlad and an Odd Ordering
|
0 / 0 |
(无) |
|
|
34397 |
codeforces#P1928C
Physical Education Lesson
|
0 / 0 |
5 |
|
|
34399 |
codeforces#P1928E
Modular Sequence
|
0 / 0 |
8 |
|
|
34420 |
codeforces#P1931D
Divisible Pairs
|
1 / 1 |
4 |
|
|
34423 |
codeforces#P1931G
One-Dimensional Puzzle
|
1 / 1 |
7 |
|
|
34425 |
codeforces#P1932B
Chaya Calendar
|
0 / 0 |
(无) |
|
|
34428 |
codeforces#P1932E
Final Countdown
|
0 / 0 |
(无) |
|
|
34430 |
codeforces#P1932G
Moving Platforms
|
0 / 0 |
(无) |
|
|
34432 |
codeforces#P1933B
Turtle Math: Fast Three Task
|
1 / 2 |
10 |
|
|
34433 |
codeforces#P1933C
Turtle Fingers: Count the Values of k
|
0 / 0 |
(无) |
|
|
34434 |
codeforces#P1933D
Turtle Tenacity: Continual Mods
|
0 / 0 |
(无) |
|
|
34506 |
codeforces#P1945B
Fireworks
|
0 / 0 |
(无) |
|
|
34512 |
codeforces#P1945H
GCD is Greater
|
1 / 2 |
10 |
|
|
34517 |
codeforces#P1946E
Girl Permutation
|
0 / 0 |
8 |
|
|
34518 |
codeforces#P1946F
Nobody is needed
|
0 / 0 |
9 |
|
|
34540 |
codeforces#P1950D
Product of Binary Decimals
|
0 / 0 |
(无) |
|
|
34541 |
codeforces#P1950E
Nearly Shortest Repeating Substring
|
1 / 8 |
10 |
|
|
34565 |
codeforces#P1954C
Long Multiplication
|
0 / 0 |
4 |
|
|
34567 |
codeforces#P1954E
Chain Reaction
|
0 / 0 |
8 |
|
|
34575 |
codeforces#P1955G
GCD on a grid
|
0 / 0 |
6 |
|
|
34588 |
codeforces#P1957E
Carousel of Combinations
|
0 / 0 |
9 |
|
|
34602 |
codeforces#P1965B
Missing Subsequence Sum
|
0 / 0 |
6 |
|
|
34610 |
codeforces#P1967B1
Reverse Card (Easy Version)
|
0 / 0 |
(无) |
|
|
34611 |
codeforces#P1967B2
Reverse Card (Hard Version)
|
0 / 0 |
(无) |
|
|
34617 |
codeforces#P1968A
Maximize?
|
1 / 1 |
10 |
|
|
34619 |
codeforces#P1968C
Assembly via Remainders
|
0 / 0 |
(无) |
|
|
34667 |
codeforces#P1973F
Maximum GCD Sum Queries
|
0 / 0 |
10 |
