|
1976 |
codeforces#P1542E2 Abnormal Permutation Pairs (hard version)
|
0 / 0 |
10 |
|
1974 |
codeforces#P1543B Customising the Track
|
0 / 0 |
3 |
|
1968 |
codeforces#P1545B AquaMoon and Chess
|
0 / 0 |
6 |
|
1967 |
codeforces#P1545C AquaMoon and Permutations
|
0 / 0 |
10 |
|
1951 |
codeforces#P1548C The Three Little Pigs
|
0 / 0 |
9 |
|
1942 |
codeforces#P1550D Excellent Arrays
|
0 / 0 |
8 |
|
1932 |
codeforces#P1551F Equidistant Vertices
|
0 / 0 |
8 |
|
1930 |
codeforces#P1552B Running for Gold
|
0 / 0 |
5 |
|
1929 |
codeforces#P1552C Maximize the Intersections
|
0 / 0 |
6 |
|
1918 |
codeforces#P1553E Permutation Shift
|
0 / 0 |
7 |
|
1914 |
codeforces#P1553I Stairs
|
0 / 0 |
10 |
|
1897 |
codeforces#P1556F Sports Betting
|
0 / 0 |
9 |
|
1892 |
codeforces#P1557C Moamen and XOR
|
0 / 0 |
5 |
|
1886 |
codeforces#P1558D Top-Notch Insertions
|
0 / 0 |
10 |
|
1878 |
codeforces#P1559E Mocha and Stars
|
0 / 0 |
8 |
|
1849 |
codeforces#P1567C Carrying Conundrum
|
0 / 0 |
5 |
|
1843 |
codeforces#P1569C Jury Meeting
|
0 / 0 |
5 |
|
1820 |
codeforces#P1574B Combinatorics Homework
|
0 / 0 |
3 |
|
1817 |
codeforces#P1574E Coloring
|
0 / 0 |
9 |
|
1816 |
codeforces#P1574F Occurrences
|
0 / 0 |
10 |
|
1779 |
codeforces#P1580B Mathematics Curriculum
|
0 / 0 |
10 |
|
1775 |
codeforces#P1580F Problems for Codeforces
|
0 / 0 |
10 |
|
1774 |
codeforces#P1581A CQXYM Count Permutations
|
0 / 0 |
3 |
|
1771 |
codeforces#P1582B Luntik and Subsequences
|
0 / 0 |
3 |
|
1753 |
codeforces#P1584D Guess the Permutation
|
0 / 0 |
7 |
|
1744 |
codeforces#P1585F Non-equal Neighbours
|
0 / 0 |
9 |
|
1742 |
codeforces#P1586I Omkar and Mosaic
|
0 / 0 |
10 |
|
1721 |
codeforces#P1594E1 Rubik's Cube Coloring (easy version)
|
0 / 0 |
4 |
|
1715 |
codeforces#P1598D Training Session
|
0 / 0 |
5 |
|
1714 |
codeforces#P1598E Staircases
|
0 / 0 |
7 |
|
1709 |
codeforces#P1599C Bubble Strike
|
0 / 0 |
7 |
|
1686 |
codeforces#P1603E A Perfect Problem
|
0 / 0 |
10 |
|
1685 |
codeforces#P1603F October 18, 2017
|
0 / 0 |
10 |
|
1677 |
codeforces#P1605F PalindORme
|
0 / 0 |
10 |
|
1672 |
codeforces#P1606E Arena
|
0 / 0 |
7 |
|
1659 |
codeforces#P1608D Dominoes
|
0 / 0 |
9 |
|
1657 |
codeforces#P1608F MEX counting
|
0 / 0 |
10 |
|
1644 |
codeforces#P1610D Not Quite Lee
|
0 / 0 |
7 |
|
1624 |
codeforces#P1612G Max Sum Array
|
0 / 0 |
9 |
|
1618 |
codeforces#P1613F Tree Coloring
|
0 / 0 |
10 |
|
1615 |
codeforces#P1614C Divan and bitwise operations
|
0 / 0 |
5 |
|
1606 |
codeforces#P1615F LEGOndary Grandmaster
|
0 / 0 |
10 |
|
1596 |
codeforces#P1616H Keep XOR Low
|
0 / 0 |
10 |
|
1568 |
codeforces#P1620G Subsequences Galore
|
0 / 0 |
9 |
|
1555 |
codeforces#P1622D Shuffle
|
0 / 0 |
7 |
|
1529 |
codeforces#P1626F A Random Code Problem
|
0 / 0 |
10 |
|
1519 |
codeforces#P1628D1 Game on Sum (Easy Version)
|
0 / 0 |
7 |
|
1518 |
codeforces#P1628D2 Game on Sum (Hard Version)
|
0 / 0 |
9 |
|
1509 |
codeforces#P1630E Expected Components
|
0 / 0 |
10 |
|
1453 |
codeforces#P1641D Two Arrays
|
0 / 0 |
10 |
|
1452 |
codeforces#P1641E Special Positions
|
0 / 0 |
10 |
|
1444 |
codeforces#P1644E Expand the Path
|
0 / 0 |
6 |
|
1443 |
codeforces#P1644F Basis
|
0 / 0 |
10 |
|
1430 |
codeforces#P1648A Weird Sum
|
0 / 0 |
4 |
|
1428 |
codeforces#P1648C Tyler and Strings
|
0 / 0 |
6 |
|
1411 |
codeforces#P1651E Sum of Matchings
|
0 / 0 |
10 |
|
1402 |
codeforces#P1654H Three Minimums
|
0 / 0 |
10 |
|
1388 |
codeforces#P1657E Star MST
|
0 / 0 |
8 |
|
1385 |
codeforces#P1658B Marin and Anti-coprime Permutation
|
0 / 0 |
3 |
|
1347 |
codeforces#P1662N Drone Photo
|
0 / 0 |
(None) |
|
1342 |
codeforces#P1663D Is it rated - 3
|
0 / 0 |
(None) |
|
1327 |
codeforces#P1666F Fancy Stack
|
0 / 0 |
8 |
|
1316 |
codeforces#P1667E Centroid Probabilities
|
0 / 0 |
10 |
|
1299 |
codeforces#P1670F Jee, You See?
|
0 / 0 |
9 |
|
1294 |
codeforces#P1671E Preorder
|
0 / 0 |
7 |
|
1293 |
codeforces#P1671F Permutation Counting
|
0 / 0 |
10 |
|
1279 |
codeforces#P1673D Lost Arithmetic Progression
|
0 / 0 |
6 |
|
1278 |
codeforces#P1673E Power or XOR?
|
0 / 0 |
9 |
|
1275 |
codeforces#P1674B Dictionary
|
0 / 0 |
3 |
|
1274 |
codeforces#P1674C Infinite Replacement
|
0 / 0 |
3 |
|
1240 |
codeforces#P1679E Typical Party in Dorm
|
0 / 0 |
9 |
|
1200 |
codeforces#P1687E Become Big For Me
|
0 / 0 |
10 |
|
1178 |
codeforces#P1691F K-Set Tree
|
0 / 0 |
9 |
|
1151 |
codeforces#P1696E Placing Jinas
|
0 / 0 |
7 |
|
1148 |
codeforces#P1696H Maximum Product?
|
0 / 0 |
10 |
|
1143 |
codeforces#P1697E Coloring
|
0 / 0 |
9 |
|
1137 |
codeforces#P1698E PermutationForces II
|
0 / 0 |
8 |
|
1132 |
codeforces#P1699C The Third Problem
|
0 / 0 |
5 |
|
1118 |
codeforces#P1701F Points
|
0 / 0 |
9 |
|
1095 |
codeforces#P1704H1 Game of AI (easy version)
|
0 / 0 |
10 |
|
1094 |
codeforces#P1704H2 Game of AI (hard version)
|
0 / 0 |
10 |
|
1090 |
codeforces#P1705D Mark and Lightbulbs
|
0 / 0 |
6 |
|
1089 |
codeforces#P1705E Mark and Professor Koro
|
0 / 0 |
8 |
|
1078 |
codeforces#P1707D Partial Virtual Trees
|
0 / 0 |
10 |
|
1056 |
codeforces#P1712E1 LCM Sum (easy version)
|
0 / 0 |
8 |
|
1048 |
codeforces#P1713F Lost Array
|
0 / 0 |
10 |
|
1038 |
codeforces#P1715C Monoblock
|
0 / 0 |
5 |
|
1029 |
codeforces#P1716F Bags with Balls
|
0 / 0 |
9 |
|
1025 |
codeforces#P1717D Madoka and The Corruption Scheme
|
0 / 0 |
6 |
|
991 |
codeforces#P1725C Circular Mirror
|
0 / 0 |
7 |
|
989 |
codeforces#P1725E Electrical Efficiency
|
0 / 0 |
9 |
|
985 |
codeforces#P1725I Imitating the Key Tree
|
0 / 0 |
10 |
|
976 |
codeforces#P1726E Almost Perfect
|
0 / 0 |
9 |
|
974 |
codeforces#P1726G A Certain Magical Party
|
0 / 0 |
10 |
|
966 |
codeforces#P1728G Illumination
|
0 / 0 |
10 |
|
959 |
codeforces#P1729G Cut Substrings
|
0 / 0 |
7 |
|
954 |
codeforces#P1730E Maximums and Minimums
|
0 / 0 |
10 |
|
947 |
codeforces#P1731F Function Sum
|
0 / 0 |
9 |
|
946 |
codeforces#P1732A Bestie
|
0 / 0 |
3 |
|
924 |
codeforces#P1735D Meta-set
|
0 / 0 |
5 |