|
|
31904 |
codeforces#P1500B
Two chandeliers
|
0 / 0 |
8 |
|
|
31920 |
codeforces#P1505B
DMCA
|
0 / 0 |
5 |
|
|
31922 |
codeforces#P1505D
Xenolith? Hippodrome?
|
0 / 0 |
6 |
|
|
31947 |
codeforces#P1510D
Digits
|
0 / 0 |
7 |
|
|
31956 |
codeforces#P1511B
GCD Length
|
0 / 0 |
3 |
|
|
31968 |
codeforces#P1512G
Short Task
|
0 / 0 |
5 |
|
|
31969 |
codeforces#P1512G
Short Task
|
1 / 1 |
5 |
|
|
31976 |
codeforces#P1513D
GCD and MST
|
0 / 0 |
7 |
|
|
31977 |
codeforces#P1513D
GCD and MST
|
0 / 0 |
7 |
|
|
31978 |
codeforces#P1513D
GCD and MST
|
0 / 0 |
7 |
|
|
31982 |
codeforces#P1514A
Perfectly Imperfect Array
|
1 / 3 |
3 |
|
|
31983 |
codeforces#P1514A
Perfectly Imperfect Array
|
0 / 0 |
3 |
|
|
31984 |
codeforces#P1514A
Perfectly Imperfect Array
|
0 / 0 |
3 |
|
|
31988 |
codeforces#P1514C
Product 1 Modulo N
|
1 / 3 |
5 |
|
|
31989 |
codeforces#P1514C
Product 1 Modulo N
|
0 / 0 |
5 |
|
|
31990 |
codeforces#P1514C
Product 1 Modulo N
|
0 / 0 |
5 |
|
|
31995 |
codeforces#P1515B
Phoenix and Puzzle
|
0 / 0 |
3 |
|
|
31996 |
codeforces#P1515B
Phoenix and Puzzle
|
0 / 0 |
3 |
|
|
32007 |
codeforces#P1515G
Phoenix and Odometers
|
0 / 0 |
10 |
|
|
32008 |
codeforces#P1515G
Phoenix and Odometers
|
0 / 0 |
10 |
|
|
32009 |
codeforces#P1515G
Phoenix and Odometers
|
0 / 0 |
10 |
|
|
32025 |
codeforces#P1516D
Cut
|
0 / 0 |
7 |
|
|
32026 |
codeforces#P1516D
Cut
|
0 / 0 |
7 |
|
|
32027 |
codeforces#P1516D
Cut
|
0 / 0 |
7 |
|
|
32053 |
codeforces#P1519C
Berland Regional
|
0 / 0 |
4 |
|
|
32054 |
codeforces#P1519C
Berland Regional
|
0 / 0 |
4 |
|
|
32060 |
codeforces#P1520B
Ordinary Numbers
|
1 / 2 |
3 |
|
|
32061 |
codeforces#P1520B
Ordinary Numbers
|
0 / 0 |
3 |
|
|
32071 |
codeforces#P1521A
Nastia and Nearly Good Numbers
|
1 / 1 |
3 |
|
|
32072 |
codeforces#P1521B
Nastia and a Good Array
|
0 / 0 |
4 |
|
|
32073 |
codeforces#P1521B
Nastia and a Good Array
|
0 / 0 |
4 |
|
|
32087 |
codeforces#P1525A
Potion-making
|
1 / 1 |
3 |
|
|
32094 |
codeforces#P1526B
I Hate 1111
|
0 / 0 |
4 |
|
|
32156 |
codeforces#P1535B
Array Reodering
|
0 / 0 |
3 |
|
|
32163 |
codeforces#P1536C
Diluc and Kaeya
|
0 / 0 |
5 |
|
|
32170 |
codeforces#P1537D
Deleting Divisors
|
0 / 0 |
5 |
|
|
32177 |
codeforces#P1538D
Another Problem About Dividing Numbers
|
1 / 1 |
5 |
|
|
32179 |
codeforces#P1538F
Interesting Function
|
1 / 1 |
5 |
|
|
32194 |
codeforces#P1541B
Pleasant Pairs
|
0 / 0 |
(无) |
|
|
32196 |
codeforces#P1542B
Plus and Multiply
|
3 / 6 |
10 |
|
|
32197 |
codeforces#P1542C
Strange Function
|
2 / 2 |
10 |
|
|
32201 |
codeforces#P1543A
Exciting Bets
|
2 / 2 |
10 |
|
|
32221 |
codeforces#P1547F
Array Stabilization (GCD version)
|
0 / 0 |
(无) |
|
|
32224 |
codeforces#P1548B
Integers Have Friends
|
0 / 4 |
10 |
|
|
32226 |
codeforces#P1548D1
Gregor and the Odd Cows (Easy)
|
1 / 1 |
10 |
|
|
32227 |
codeforces#P1548D2
Gregor and the Odd Cows (Hard)
|
0 / 0 |
(无) |
|
|
32229 |
codeforces#P1549A
Gregor and Cryptography
|
1 / 1 |
10 |
|
|
32252 |
codeforces#P1552H
Guess the Perimeter
|
0 / 0 |
(无) |
|
|
32254 |
codeforces#P1553A
Digits Sum
|
2 / 2 |
10 |
|
|
32259 |
codeforces#P1553F
Pairwise Modulo
|
1 / 3 |
10 |
