|
|
7907 |
codeforces#P1679A AvtoBus
|
0 / 0 |
(无) |
|
|
7909 |
codeforces#P1684G Euclid Guess
|
0 / 0 |
(无) |
|
|
7946 |
codeforces#P1687E Become Big For Me
|
0 / 1 |
10 |
|
|
7952 |
codeforces#P1690F Shifting String
|
0 / 0 |
(无) |
|
|
8005 |
codeforces#P1698G Long Binary String
|
0 / 0 |
(无) |
|
|
8025 |
codeforces#P1702F Equate Multisets
|
0 / 0 |
5 |
|
|
8048 |
codeforces#P1706D1 Chopping Carrots (Easy Version)
|
0 / 0 |
(无) |
|
|
8047 |
codeforces#P1706D2 Chopping Carrots (Hard Version)
|
0 / 0 |
(无) |
|
|
8040 |
codeforces#P1707F Bugaboo
|
0 / 0 |
(无) |
|
|
8104 |
codeforces#P1712B Woeful Permutation
|
1 / 2 |
10 |
|
|
8101 |
codeforces#P1712E1 LCM Sum (easy version)
|
0 / 0 |
(无) |
|
|
8100 |
codeforces#P1712E2 LCM Sum (hard version)
|
0 / 0 |
(无) |
|
|
8095 |
codeforces#P1713D Tournament Countdown
|
0 / 0 |
(无) |
|
|
8082 |
codeforces#P1714E Add Modulo 10
|
1 / 2 |
10 |
|
|
8087 |
codeforces#P1716F Bags with Balls
|
1 / 4 |
9 |
|
|
8159 |
codeforces#P1717A Madoka and Strange Thoughts
|
0 / 0 |
3 |
|
|
8155 |
codeforces#P1717E Madoka and The Best University
|
2 / 3 |
8 |
|
|
8119 |
codeforces#P1718B Fibonacci Strings
|
0 / 0 |
(无) |
|
|
8118 |
codeforces#P1718C Tonya and Burenka-179
|
1 / 2 |
10 |
|
|
8115 |
codeforces#P1718F Burenka, an Array and Queries
|
0 / 0 |
(无) |
|
|
8114 |
codeforces#P1720A Burenka Plays with Fractions
|
1 / 1 |
10 |
|
|
8149 |
codeforces#P1725E Electrical Efficiency
|
0 / 0 |
(无) |
|
|
8170 |
codeforces#P1728E Red-Black Pepper
|
0 / 0 |
(无) |
|
|
8195 |
codeforces#P1730E Maximums and Minimums
|
0 / 0 |
(无) |
|
|
8462 |
codeforces#P1731C Even Subarrays
|
0 / 0 |
5 |
|
|
8460 |
codeforces#P1731E Graph Cost
|
1 / 3 |
7 |
|
|
8458 |
codeforces#P1732A Bestie
|
0 / 0 |
3 |
|
|
8189 |
codeforces#P1734E Rectangular Congruence
|
0 / 0 |
(无) |
|
|
8231 |
codeforces#P1736B Playing with GCD
|
0 / 0 |
(无) |
|
|
8221 |
codeforces#P1737F Ela and Prime GCD
|
0 / 0 |
(无) |
|
|
8296 |
codeforces#P1740A Factorise N+M
|
0 / 0 |
(无) |
|
|
8288 |
codeforces#P1740I Arranging Crystal Balls
|
0 / 0 |
(无) |
|
|
8243 |
codeforces#P1742D Coprime
|
0 / 0 |
(无) |
|
|
8257 |
codeforces#P1744E1 Divisible Numbers (easy version)
|
0 / 0 |
5 |
|
|
8256 |
codeforces#P1744E2 Divisible Numbers (hard version)
|
0 / 0 |
6 |
|
|
8312 |
codeforces#P1748D ConstructOR
|
0 / 0 |
7 |
|
|
8271 |
codeforces#P1749D Counting Arrays
|
0 / 0 |
(无) |
|
|
8306 |
codeforces#P1750D Count GCD
|
1 / 1 |
10 |
|
|
8341 |
codeforces#P1758C Almost All Multiples
|
0 / 0 |
(无) |
|
|
8319 |
codeforces#P1759D Make It Round
|
0 / 0 |
4 |
|
|
8317 |
codeforces#P1759F All Possible Digits
|
0 / 0 |
6 |
|
|
8398 |
codeforces#P1762A Divide and Conquer
|
0 / 1 |
10 |
|
|
8397 |
codeforces#P1762B Make Array Good
|
1 / 1 |
10 |
|
|
8395 |
codeforces#P1762D GCD Queries
|
0 / 0 |
(无) |
|
|
8352 |
codeforces#P1764B Doremy's Perfect Math Class
|
0 / 0 |
(无) |
|
|
8388 |
codeforces#P1766D Lucky Chains
|
0 / 0 |
(无) |
|
|
8441 |
codeforces#P1768A Greatest Convex
|
0 / 1 |
10 |
|
|
8437 |
codeforces#P1768E Partial Sorting
|
1 / 1 |
10 |
|
|
8425 |
codeforces#P1770C Koxia and Number Theory
|
0 / 0 |
(无) |
|
|
8383 |
codeforces#P1771C Hossam and Trainees
|
0 / 0 |
(无) |
