|
31205 |
codeforces#P1363C
Game On Leaves
|
0 / 0 |
5 |
|
31211 |
codeforces#P1364C
Ehab and Prefix MEXs
|
0 / 0 |
5 |
|
31260 |
codeforces#P1371D
Grid-00100
|
0 / 0 |
5 |
|
31273 |
codeforces#P1373D
Maximum Sum on Even Positions
|
0 / 0 |
5 |
|
31281 |
codeforces#P1374E1
Reading Books (easy version)
|
0 / 0 |
5 |
|
31344 |
codeforces#P1389B
Array Walk
|
0 / 0 |
5 |
|
31377 |
codeforces#P1395C
Boboniu and Bit Operations
|
0 / 0 |
5 |
|
31378 |
codeforces#P1396A
Multiples of Length
|
0 / 0 |
5 |
|
31387 |
codeforces#P1398C
Good Subarrays
|
0 / 0 |
5 |
|
31432 |
codeforces#P1407C
Chocolate Bunny
|
0 / 0 |
5 |
|
31518 |
codeforces#P1423K
Lonely Numbers
|
0 / 0 |
5 |
|
31564 |
codeforces#P1431C
Black Friday
|
0 / 0 |
5 |
|
31589 |
codeforces#P1437D
Minimal Height Tree
|
1 / 2 |
5 |
|
31653 |
codeforces#P1452D
Radio Towers
|
0 / 0 |
5 |
|
31672 |
codeforces#P1455D
Sequence and Swaps
|
0 / 0 |
5 |
|
31677 |
codeforces#P1458A
Row GCD
|
0 / 0 |
5 |
|
31688 |
codeforces#P1461D
Divide and Summarize
|
0 / 0 |
5 |
|
31729 |
codeforces#P1468K
The Robot
|
1 / 1 |
5 |
|
31735 |
codeforces#P1469C
Building a Fence
|
0 / 0 |
5 |
|
31771 |
codeforces#P1475E
Advertising Agency
|
0 / 0 |
5 |
|
31776 |
codeforces#P1476C
Longest Simple Cycle
|
0 / 0 |
5 |
|
31800 |
codeforces#P1481C
Fence Painting
|
0 / 0 |
5 |
|
31806 |
codeforces#P1482C
Basic Diplomacy
|
0 / 0 |
5 |
|
31820 |
codeforces#P1486C1
Guessing the Greatest (easy version)
|
0 / 0 |
5 |
|
31886 |
codeforces#P1497C2
k-LCM (hard version)
|
0 / 0 |
5 |
|
31892 |
codeforces#P1498C
Planar Reflections
|
0 / 0 |
5 |
|
31911 |
codeforces#P1503A
Balance the Bits
|
0 / 0 |
5 |
|
31920 |
codeforces#P1505B
DMCA
|
0 / 0 |
5 |
|
31958 |
codeforces#P1511D
Min Cost String
|
0 / 0 |
5 |
|
31966 |
codeforces#P1512E
Permutation by Sum
|
1 / 1 |
5 |
|
31973 |
codeforces#P1513C
Add One
|
1 / 4 |
5 |
|
31974 |
codeforces#P1513C
Add One
|
0 / 0 |
5 |
|
31975 |
codeforces#P1513C
Add One
|
0 / 0 |
5 |
|
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 |
|
32055 |
codeforces#P1519D
Maximum Sum of Products
|
0 / 0 |
5 |
|
32066 |
codeforces#P1520F1
Guess the K-th Zero (Easy version)
|
0 / 0 |
5 |
|
32067 |
codeforces#P1520F1
Guess the K-th Zero (Easy version)
|
0 / 0 |
5 |
|
32079 |
codeforces#P1523C
Compression and Expansion
|
1 / 11 |
5 |
|
32080 |
codeforces#P1523C
Compression and Expansion
|
0 / 0 |
5 |
|
32096 |
codeforces#P1526C2
Potions (Hard Version)
|
0 / 0 |
5 |
|
32103 |
codeforces#P1527C
Sequence Pair Weight
|
0 / 0 |
5 |
|
32106 |
codeforces#P1528A
Parsa's Humongous Tree
|
0 / 0 |
5 |
|
32117 |
codeforces#P1530D
Secret Santa
|
0 / 0 |
5 |
|
32171 |
codeforces#P1537E1
Erase and Extend (Easy Version)
|
0 / 0 |
5 |
|
32184 |
codeforces#P1539D
PriceFixed
|
1 / 1 |
5 |
|
32458 |
codeforces#P1593E
Gardener and Tree
|
0 / 11 |
5 |
|
32497 |
codeforces#P1603B
Moderate Modular Mode
|
0 / 0 |
5 |
|
32520 |
codeforces#P1607E
Robot on the Board 1
|
1 / 2 |
5 |