|
32942 |
codeforces#P1679A
AvtoBus
|
0 / 0 |
(无) |
|
32972 |
codeforces#P1684G
Euclid Guess
|
0 / 0 |
(无) |
|
32986 |
codeforces#P1687E
Become Big For Me
|
0 / 1 |
10 |
|
33001 |
codeforces#P1690F
Shifting String
|
0 / 0 |
(无) |
|
33051 |
codeforces#P1698G
Long Binary String
|
0 / 0 |
(无) |
|
33074 |
codeforces#P1702F
Equate Multisets
|
0 / 0 |
5 |
|
33102 |
codeforces#P1706D1
Chopping Carrots (Easy Version)
|
0 / 0 |
(无) |
|
33103 |
codeforces#P1706D2
Chopping Carrots (Hard Version)
|
0 / 0 |
(无) |
|
33110 |
codeforces#P1707F
Bugaboo
|
0 / 0 |
(无) |
|
33127 |
codeforces#P1712B
Woeful Permutation
|
1 / 2 |
10 |
|
33130 |
codeforces#P1712E1
LCM Sum (easy version)
|
0 / 0 |
(无) |
|
33131 |
codeforces#P1712E2
LCM Sum (hard version)
|
0 / 0 |
(无) |
|
33136 |
codeforces#P1713D
Tournament Countdown
|
0 / 0 |
(无) |
|
33143 |
codeforces#P1714E
Add Modulo 10
|
1 / 2 |
10 |
|
33157 |
codeforces#P1716F
Bags with Balls
|
1 / 4 |
9 |
|
33158 |
codeforces#P1717A
Madoka and Strange Thoughts
|
0 / 0 |
3 |
|
33162 |
codeforces#P1717E
Madoka and The Best University
|
2 / 3 |
8 |
|
33166 |
codeforces#P1718B
Fibonacci Strings
|
0 / 0 |
(无) |
|
33167 |
codeforces#P1718C
Tonya and Burenka-179
|
1 / 2 |
10 |
|
33170 |
codeforces#P1718F
Burenka, an Array and Queries
|
0 / 0 |
(无) |
|
33174 |
codeforces#P1720A
Burenka Plays with Fractions
|
1 / 1 |
10 |
|
33197 |
codeforces#P1725E
Electrical Efficiency
|
0 / 0 |
(无) |
|
33218 |
codeforces#P1728E
Red-Black Pepper
|
0 / 0 |
(无) |
|
33232 |
codeforces#P1730E
Maximums and Minimums
|
0 / 0 |
(无) |
|
33236 |
codeforces#P1731C
Even Subarrays
|
0 / 0 |
5 |
|
33238 |
codeforces#P1731E
Graph Cost
|
1 / 3 |
7 |
|
33240 |
codeforces#P1732A
Bestie
|
0 / 0 |
3 |
|
33257 |
codeforces#P1734E
Rectangular Congruence
|
0 / 0 |
(无) |
|
33266 |
codeforces#P1736B
Playing with GCD
|
0 / 0 |
(无) |
|
33276 |
codeforces#P1737F
Ela and Prime GCD
|
0 / 0 |
(无) |
|
33292 |
codeforces#P1740A
Factorise N+M
|
0 / 0 |
(无) |
|
33300 |
codeforces#P1740I
Arranging Crystal Balls
|
0 / 0 |
(无) |
|
33311 |
codeforces#P1742D
Coprime
|
0 / 0 |
(无) |
|
33326 |
codeforces#P1744E1
Divisible Numbers (easy version)
|
0 / 0 |
5 |
|
33327 |
codeforces#P1744E2
Divisible Numbers (hard version)
|
0 / 0 |
6 |
|
33345 |
codeforces#P1748D
ConstructOR
|
0 / 0 |
7 |
|
33351 |
codeforces#P1749D
Counting Arrays
|
0 / 0 |
(无) |
|
33357 |
codeforces#P1750D
Count GCD
|
1 / 1 |
10 |
|
33373 |
codeforces#P1758C
Almost All Multiples
|
0 / 0 |
(无) |
|
33380 |
codeforces#P1759D
Make It Round
|
0 / 0 |
4 |
|
33382 |
codeforces#P1759F
All Possible Digits
|
0 / 0 |
6 |
|
33399 |
codeforces#P1762A
Divide and Conquer
|
0 / 1 |
10 |
|
33400 |
codeforces#P1762B
Make Array Good
|
1 / 1 |
10 |
|
33402 |
codeforces#P1762D
GCD Queries
|
0 / 0 |
(无) |
|
33413 |
codeforces#P1764B
Doremy's Perfect Math Class
|
0 / 0 |
(无) |
|
33439 |
codeforces#P1766D
Lucky Chains
|
0 / 0 |
(无) |
|
33448 |
codeforces#P1768A
Greatest Convex
|
0 / 1 |
10 |
|
33452 |
codeforces#P1768E
Partial Sorting
|
1 / 1 |
10 |
|
33456 |
codeforces#P1770C
Koxia and Number Theory
|
0 / 0 |
(无) |
|
33464 |
codeforces#P1771C
Hossam and Trainees
|
0 / 2 |
10 |