Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2784	P1446B Catching Cheaters dp strings *1800	0 / 0	6
	2783	P1446C Xor Tree binary search bitmasks data structures divide and conquer dp trees *2100	0 / 0	7
	2782	P1446D1 Frequency Problem (Easy Version) data structures greedy *2600	0 / 0	10
	2781	P1446D2 Frequency Problem (Hard Version) data structures greedy two pointers *3000	0 / 0	10
	2780	P1446E Long Recovery constructive algorithms dfs and similar *3500	0 / 0	10
	2779	P1446F Line Distance binary search data structures geometry *3200	0 / 0	10
	2778	P1447A Add Candies constructive algorithms math *800	0 / 0	3
	2777	P1447B Numbers Box greedy math *1000	0 / 0	3
	2776	P1450A Avoid Trygub constructive algorithms sortings *800	0 / 0	3
	2775	P1450B Balls of Steel brute force geometry greedy *1000	0 / 0	3
	2774	P1450C1 Errich-Tac-Toe (Easy Version) constructive algorithms math *2100	0 / 0	7
	2773	P1450C2 Errich-Tac-Toe (Hard Version) constructive algorithms math *2300	0 / 0	8
	2772	P1450D Rating Compression binary search data structures greedy implementation two pointers *1800	0 / 0	6
	2771	P1450E Capitalism constructive algorithms dfs and similar graphs shortest paths *2700	0 / 0	10
	2770	P1450F The Struggling Contestant constructive algorithms greedy *2400	0 / 0	9
	2769	P1450G Communism bitmasks dp trees *3500	0 / 0	10
	2768	P1450H1 Multithreading (Easy Version) combinatorics fft math *2900	0 / 0	10
	2767	P1450H2 Multithreading (Hard Version) combinatorics implementation math *3300	0 / 0	10
	2766	P1451A Subtract or Divide greedy math *800	0 / 0	3
	2765	P1451B Non-Substring Subsequence dp greedy implementation strings *900	0 / 0	3
	2764	P1451C String Equality dp greedy hashing implementation strings *1400	0 / 0	4
	2763	P1451D Circle Game games geometry math *1700	0 / 0	5
	2762	P1451E1 Bitwise Queries (Easy Version) bitmasks constructive algorithms interactive math *2000	0 / 0	7
	2761	P1451E2 Bitwise Queries (Hard Version) bitmasks constructive algorithms interactive math *2300	0 / 0	8
	2760	P1451F Nullify The Matrix constructive algorithms games *2700	0 / 0	10
	2759	P1452A Robot Program math *800	0 / 0	3
	2758	P1452B Toy Blocks binary search greedy math sortings *1400	0 / 0	4
	2757	P1452C Two Brackets greedy *800	0 / 0	3
	2756	P1452D Radio Towers combinatorics dp math *1600	0 / 0	5
	2755	P1452E Two Editorials brute force dp greedy sortings two pointers *2500	0 / 0	9
	2754	P1452F Divide Powers constructive algorithms greedy *2900	0 / 0	10
	2753	P1452G Game On Tree data structures dfs and similar greedy trees *2700	0 / 0	10
	2752	P1453A Cancel the Trains implementation *800	0 / 0	3
	2751	P1453B Suffix Operations constructive algorithms implementation *1400	0 / 0	4
	2750	P1453C Triangles greedy implementation *1700	0 / 0	5
	2749	P1453D Checkpoints brute force constructive algorithms greedy math probabilities *1900	0 / 0	6
	2748	P1453E Dog Snacks binary search dfs and similar dp greedy trees *2300	0 / 0	8
	2747	P1453F Even Harder dp *2700	0 / 0	10
	2746	P1454A Special Permutation constructive algorithms probabilities *800	0 / 0	3
	2745	P1454B Unique Bid Auction implementation *800	0 / 0	3
	2744	P1454C Sequence Transformation greedy implementation *1200	0 / 0	4
	2743	P1454D Number into Sequence constructive algorithms math number theory *1300	0 / 0	4
	2742	P1454E Number of Simple Paths combinatorics dfs and similar graphs trees *2000	0 / 0	7
	2741	P1454F Array Partition binary search data structures greedy two pointers *2100	0 / 0	7
	2740	P1455A Strange Functions math number theory *800	0 / 0	3
	2739	P1455B Jumps constructive algorithms math *1200	0 / 0	4
	2738	P1455C Ping-pong constructive algorithms games math *1100	0 / 0	3
	2737	P1455D Sequence and Swaps dp greedy sortings *1600	0 / 0	5
	2736	P1455E Four Points brute force constructive algorithms flows geometry greedy implementation math ternary search *2400	0 / 0	9
	2735	P1455F String and Operations dp greedy *2800	0 / 0	10
	2734	P1455G Forbidden Value data structures dp *2900	0 / 0	10
	2733	P1456E XOR-ranges dp greedy *3500	0 / 0	10
	2732	P1458A Row GCD math number theory *1600	0 / 0	5
	2731	P1458B Glass Half Spilled dp *2000	0 / 0	7
	2729	P1458C Latin Square math matrices *2700	0 / 0	10
	2728	P1458D Flip and Reverse data structures graphs greedy *3100	0 / 0	10
	2727	P1458E Nim Shortcuts data structures games *3100	0 / 0	10
	2726	P1458F Range Diameter Sum data structures trees *3500	0 / 0	10
	2725	P1459A Red-Blue Shuffle math probabilities *800	0 / 0	3
	2724	P1459B Move and Turn dp math *1300	0 / 0	4
	2723	P1461A String Generation constructive algorithms greedy *800	0 / 0	3
	2721	P1461B Find the Spruce brute force dp implementation *1400	0 / 0	4
	2719	P1461C Random Events dp math probabilities *1500	0 / 0	5
	2717	P1461D Divide and Summarize binary search brute force data structures divide and conquer implementation sortings *1600	0 / 0	5
	2715	P1461E Water Level brute force graphs greedy implementation math *2200	0 / 0	8
	2713	P1461F Mathematical Expression constructive algorithms dp greedy *2700	0 / 0	10
	2710	P1462A Favorite Sequence implementation two pointers *800	0 / 0	3
	2709	P1462B Last Year's Substring dp implementation strings *800	0 / 0	3
	2708	P1462C Unique Number brute force greedy math *900	0 / 0	3
	2706	P1462D Add to Neighbour and Remove greedy math number theory *1400	0 / 0	4
	2705	P1462E1 Close Tuples (easy version) binary search combinatorics math sortings two pointers *1500	0 / 0	5
	2704	P1462E2 Close Tuples (hard version) binary search combinatorics implementation math sortings two pointers *1700	0 / 0	5
	2702	P1462F The Treasure of The Segments binary search data structures greedy *1800	0 / 0	6
	2700	P1463A Dungeon binary search math *1100	0 / 0	3
	2698	P1463B Find The Array bitmasks constructive algorithms greedy *1400	0 / 0	4
	2696	P1463C Busy Robot implementation *1800	0 / 0	6
	2695	P1463D Pairs binary search constructive algorithms greedy two pointers *1900	0 / 0	6
	2692	P1463E Plan of Lectures constructive algorithms dfs and similar dsu graphs implementation sortings trees *2400	0 / 0	9
	2690	P1463F Max Correct Set bitmasks dp math *3100	0 / 1	10
	2688	P1464F My Beautiful Madness data structures trees *3500	0 / 0	10
	2687	P1466A Bovine Dilemma brute force geometry math *800	0 / 0	3
	2684	P1466B Last minute enhancements dp greedy *800	0 / 0	3
	2683	P1466C Canine poetry dp greedy strings *1300	0 / 0	4
	2682	P1466D 13th Labour of Heracles data structures greedy sortings trees *1500	0 / 0	5
	2681	P1466E Apollo versus Pan bitmasks brute force math *1800	0 / 0	6
	2680	P1466F Euclid's nightmare bitmasks dfs and similar dsu graphs greedy math sortings *2100	0 / 0	7
	2679	P1466G Song of the Sirens combinatorics divide and conquer hashing math string suffix structures strings *2600	0 / 0	10
	2676	P1466H Finding satisfactory solutions combinatorics dp graphs greedy math *3300	0 / 0	10
	2674	P1466I The Riddle of the Sphinx binary search data structures data structures interactive *3400	0 / 0	10
	2673	P1467A Wizard of Orz constructive algorithms greedy math *900	0 / 0	3
	2670	P1467B Hills And Valleys brute force implementation *1700	0 / 0	5
	2669	P1467C Three Bags constructive algorithms greedy *1900	0 / 0	6
	2668	P1467D Sum of Paths combinatorics dp math *2200	0 / 0	8
	2667	P1467E Distinctive Roots in a Tree data structures dfs and similar dp trees *2500	0 / 0	9
	2666	P1468A LaIS data structures dp greedy *2200	0 / 0	8
	2665	P1468B Bakery data structures dsu *2900	0 / 0	10
	2662	P1468C Berpizza data structures implementation *1400	0 / 0	4
	2660	P1468D Firecrackers binary search sortings *1700	0 / 0	5
	2659	P1468E Four Segments greedy *800	0 / 0	3
	2657	P1468F Full Turn geometry hashing number theory *1700	0 / 0	5

Pick a problem randomly based on the current filter.