11,311/11,320 captured·📄 81 PDFs⊘ 0 skipped9 remaining100%
Problemset
29 problems · filtered by 3 tags
| ✓ | # | Name | ✎ | Rating↕ | Solved↕ | |
|---|---|---|---|---|---|---|
| 2242E | Product of Closures | 2200 | 1.4k | |||
| 2180G | Balance | 3500 | 154 | |||
| 2179H | Blackslex and Plants | 2200 | 1.4k | |||
| 2170A | Maximum Neighborhood | 800 | 20.6k | |||
| 2127G2 | Inter Active (Hard Version) | 3500 | 126 | |||
| 2108B | SUMdamental Decomposition | 1300 | 14.9k | |||
| 2077B | Finding OR Sum | 1900 | 3.7k | |||
| 2075E | XOR Matrix | 2500 | 1.2k | |||
| 2074F | Counting Necessary Nodes | 2000 | 2.5k | |||
| 2071D1 | Infinite Sequence (Easy Version) | 1800 | 6.9k | |||
| 2071D2 | Infinite Sequence (Hard Version) | 2500 | 1.1k | |||
| 2020C | Bitwise Balancing | 1400 | 18.7k | |||
| 1981C | Turtle and an Incomplete Sequence | 1800 | 6.4k | |||
| 1956D | Nene and the Mex Operator | 2000 | 4.9k | |||
| 1926E | Vlad and an Odd Ordering | 1500 | 15.2k | |||
| 1918C | XOR-distance | 1400 | 17.1k | |||
| 1868B1 | Candy Party (Easy Version) | 1700 | 8.4k | |||
| 1868B2 | Candy Party (Hard Version) | 2100 | 2.8k | |||
| 1856E2 | PermuTree (hard version) | 2700 | 1.8k | |||
| 1844G | Tree Weights | 3000 | 1.2k | |||
| 1625D | Binary Spiders | 2300 | 2.4k | |||
| 1618F | Reverse | 2000 | 4.8k | |||
| 1543C | Need for Pink Slips | 1900 | 5.7k | |||
| 1312C | Adding Powers | 1400 | 18.5k | |||
| 959E | Mahmoud and Ehab and the xor-MST | 1900 | 3.8k | |||
| 734F | Anton and School | 2500 | 1.4k | |||
| 581D | Three Logos | 1700 | 4.9k | |||
| 388B | Fox and Minimal path | 1900 | 2.6k | |||
| 276D | Little Girl and Maximum XOR | 1700 | 16.8k |
showing 1–29 of 29