cf/mirror
11,311/11,320 captured·📄 81 PDFs⊘ 0 skipped9 remaining100%

Problemset

7 problems · filtered by 4 tags

✓#Name✎Rating↕Solved↕
2106G2Baudelaire (hard version)
binary searchdfs and similardivide and conquerimplementationinteractivetrees
2500647
2001CGuess The Tree
binary searchbrute forcedfs and similardivide and conquerdsugreedyinteractivetrees
150013.1k
1990E1Catch the Mole(Easy Version)
binary searchdata structuresdfs and similarinteractivetrees
25001.2k
1990E2Catch the Mole(Hard Version)
binary searchdata structuresdfs and similardivide and conquerinteractivetrees
26001.2k
1592DHemose in ICPC ?
binary searchdfs and similarimplementationinteractivemathnumber theorytrees
23002.7k
1370F1The Hidden Pair (Easy Version)
binary searchdfs and similargraphsinteractiveshortest pathstrees
24001.8k
1370F2The Hidden Pair (Hard Version)
binary searchdfs and similargraphsinteractiveshortest pathstrees
27001.7k

showing 1–7 of 7