sortings - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2961	P1409E Two Platforms binary search dp sortings two pointers *1800	0 / 0	6
	2950	P1413C Perform Easily binary search brute force dp implementation sortings two pointers *1900	0 / 0	6
	2938	P1416C XOR Inverse bitmasks data structures divide and conquer dp greedy math sortings strings trees *2000	0 / 0	7
	2933	P1417B Two Arrays greedy math sortings *1100	0 / 0	3
	2931	P1418B Negative Prefixes greedy sortings *1300	0 / 0	4
	2922	P1419D1 Sage's Birthday (easy version) binary search constructive algorithms greedy sortings *1000	0 / 0	3
	2921	P1419D2 Sage's Birthday (hard version) binary search brute force constructive algorithms greedy sortings two pointers *1500	0 / 0	5
	2918	P1420A Cubes Sorting math sortings *900	0 / 0	3
	2914	P1420D Rescue Nibel! combinatorics data structures sortings *1800	0 / 0	6
	2904	P1422D Returning Home graphs shortest paths sortings *2300	1 / 5	8
	2887	P1424G Years data structures sortings *1300	0 / 0	4
	2886	P1424M Ancient Language graphs sortings *2200	0 / 0	8
	2874	P1426D Non-zero Segments constructive algorithms data structures greedy sortings *1500	0 / 0	5
	2871	P1427A Avoiding Zero math sortings *900	0 / 0	3
	2870	P1427B Chess Cheater greedy implementation sortings *1400	0 / 0	4
	2859	P1428E Carrots for Rabbits binary search data structures greedy math sortings *2200	0 / 0	8
	2853	P1430B Barrels greedy implementation sortings *800	0 / 0	3
	2821	P1437C Chef Monocarp dp flows graph matchings greedy math sortings *1800	0 / 0	6
	2815	P1438B Valerii Against Everyone constructive algorithms data structures greedy sortings *1000	0 / 0	3
	2795	P1443B Saving the City dp greedy math sortings *1300	0 / 0	4
	2794	P1443C The Delivery Dilemma binary search greedy sortings *1400	0 / 0	4
	2791	P1444B Divide and Sum combinatorics math sortings *1900	0 / 0	6
	2787	P1445A Array Rearrangment greedy sortings *800	0 / 0	3
	2785	P1446A Knapsack constructive algorithms greedy sortings *1300	0 / 0	4
	2776	P1450A Avoid Trygub constructive algorithms sortings *800	0 / 0	3
	2758	P1452B Toy Blocks binary search greedy math sortings *1400	0 / 0	4
	2755	P1452E Two Editorials brute force dp greedy sortings two pointers *2500	0 / 0	9
	2737	P1455D Sequence and Swaps dp greedy sortings *1600	0 / 0	5
	2717	P1461D Divide and Summarize binary search brute force data structures divide and conquer implementation sortings *1600	0 / 0	5
	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
	2692	P1463E Plan of Lectures constructive algorithms dfs and similar dsu graphs implementation sortings trees *2400	0 / 0	9
	2682	P1466D 13th Labour of Heracles data structures greedy sortings trees *1500	0 / 0	5
	2680	P1466F Euclid's nightmare bitmasks dfs and similar dsu graphs greedy math sortings *2100	0 / 0	7
	2660	P1468D Firecrackers binary search sortings *1700	0 / 0	5
	2626	P1470A Strange Birthday Party binary search dp greedy sortings two pointers *1300	0 / 0	4
	2605	P1472D Even-Odd Game dp games greedy sortings *1200	0 / 0	4
	2604	P1472E Correct Placement binary search data structures dp sortings two pointers *1700	0 / 0	5
	2603	P1472F New Year's Puzzle brute force dp graph matchings greedy sortings *2100	0 / 0	7
	2601	P1473A Replacing Elements greedy implementation math sortings *800	0 / 0	3
	2591	P1474C Array Destruction brute force constructive algorithms data structures greedy implementation sortings *1700	0 / 0	5
	2581	P1475D Cleaning the Phone binary search dp sortings two pointers *1800	0 / 0	6
	2578	P1475E Advertising Agency combinatorics math sortings *1600	0 / 0	5
	2574	P1475G Strange Beauty dp math number theory sortings *1900	0 / 0	6
	2568	P1476E Pattern Matching bitmasks data structures dfs and similar graphs hashing sortings strings *2300	0 / 0	8
	2564	P1476G Minimum Difference data structures hashing sortings two pointers *3100	0 / 0	10
	2557	P1477C Nezzar and Nice Beatmap constructive algorithms geometry greedy math sortings *2200	0 / 0	8
	2546	P1478C Nezzar and Symmetric Array implementation math sortings *1700	0 / 0	5
	2529	P1480B The Great Hero greedy implementation sortings *900	0 / 0	3
	2503	P1485F Copy or Prefix Sum combinatorics data structures dp sortings *2400	0 / 0	9
	2501	P1486B Eastern Exhibition binary search geometry shortest paths sortings *1500	0 / 0	5
	2495	P1487A Arena implementation sortings *800	0 / 0	3
	2491	P1487E Cheap Dinner brute force data structures graphs greedy implementation sortings two pointers *2000	0 / 0	7
	2463	P1490F Equalize the Array binary search data structures greedy math sortings *1500	0 / 0	5
	2432	P1493D GCD of an Array brute force data structures hashing implementation math number theory sortings two pointers *2100	1 / 2	7
	2422	P1494D Dogeforces constructive algorithms data structures dfs and similar divide and conquer dsu greedy sortings trees *2300	0 / 0	8
	2416	P1495A Diamond Miner geometry greedy math sortings *1200	0 / 0	4
	2405	P1497A Meximization brute force data structures greedy sortings *800	0 / 0	3
	2385	P1498E Two Houses brute force graphs greedy interactive sortings *2200	0 / 0	8
	2366	P1500D Tiles for Bathroom data structures sortings two pointers *2900	0 / 0	10
	2360	P1501B Napoleon Cake dp implementation sortings *900	0 / 0	3
	2354	P1503C Travelling Salesman Problem binary search data structures dp greedy shortest paths sortings two pointers *2200	0 / 0	8
	2353	P1503D Flip the Cards 2-sat constructive algorithms data structures greedy sortings two pointers *2600	0 / 0	10
	2330	P1506F Triangular Paths constructive algorithms graphs math shortest paths sortings *2000	0 / 0	7
	2323	P1508D Swap Pass constructive algorithms geometry sortings *3000	0 / 0	10
	2321	P1508E Tree Calendar brute force constructive algorithms data structures dfs and similar sortings trees *3100	0 / 0	10
	2271	P1513D GCD and MST constructive algorithms dsu graphs greedy number theory sortings *2000	1 / 1	7
	2270	P1513E Cost Equilibrium combinatorics constructive algorithms math sortings *2300	0 / 0	8
	2269	P1513F Swapping Problem brute force constructive algorithms data structures sortings *2500	0 / 0	9
	2265	P1514D Cut and Stick binary search data structures greedy implementation sortings *2000	0 / 0	7
	2264	P1514E Baby Ehab's Hyper Apartment binary search graphs interactive sortings two pointers *2700	0 / 0	10
	2260	P1515D Phoenix and Socks greedy sortings two pointers *1500	0 / 0	5
	2254	P1515H Phoenix and Bits bitmasks brute force data structures sortings *3500	0 / 0	10
	2253	P1515I Phoenix and Diamonds binary search data structures sortings *3400	0 / 0	10
	2238	P1517B Morning Jogging constructive algorithms greedy sortings *1200	0 / 0	4
	2226	P1519C Berland Regional brute force data structures greedy number theory sortings *1400	0 / 0	4
	2224	P1519E Off by One constructive algorithms dfs and similar geometry graphs sortings trees *2700	0 / 0	10
	2192	P1525C Robot Collisions data structures greedy implementation sortings *2000	0 / 0	7
	2188	P1526A Mean Inequality constructive algorithms sortings *800	0 / 0	3
	2155	P1529B Sifid and Strange Subsequences greedy math sortings *1100	0 / 0	3
	2151	P1530C Pursuit binary search brute force greedy sortings *1200	0 / 0	4
	2140	P1532D Teams Forming *special problem sortings	0 / 0	(None)
	2115	P1534G A New Beginning data structures dp geometry sortings *3300	0 / 0	10
	2112	P1534H Lost Nodes constructive algorithms dp graphs interactive sortings trees *3500	0 / 0	10
	2108	P1535B Array Reodering brute force greedy math number theory sortings *900	0 / 0	3
	2075	P1539C Stable Groups greedy sortings *1200	0 / 0	4
	2074	P1539D PriceFixed binary search greedy implementation sortings two pointers *1600	0 / 0	5
	2072	P1539F Strange Array data structures greedy sortings *2600	0 / 0	10
	2071	P1540A Great Graphs constructive algorithms graphs greedy shortest paths sortings *1400	0 / 0	4
	2050	P1545A AquaMoon and Strange Sort sortings *1500	0 / 0	5
	2036	P1547E Air Conditioners data structures dp implementation shortest paths sortings two pointers *1500	0 / 0	5
	2013	P1550D Excellent Arrays binary search combinatorics constructive algorithms implementation math sortings two pointers *2300	0 / 0	8
	2000	P1551C Interesting Story greedy sortings strings *1500	0 / 0	5
	1991	P1552A Subsequence Permutation sortings strings *800	0 / 0	3
	1988	P1552B Running for Gold combinatorics graphs greedy sortings *1500	0 / 0	5
	1987	P1552C Maximize the Intersections combinatorics constructive algorithms geometry greedy sortings *1800	0 / 0	6
	1983	P1552E Colors and Intervals constructive algorithms data structures greedy sortings *2300	0 / 0	8
	1980	P1552F Telepanting binary search data structures dp sortings *2200	0 / 0	8
	1978	P1552G A Serious Referee bitmasks brute force dfs and similar sortings *3000	0 / 0	10
	1943	P1555E Boring Segments data structures sortings trees two pointers *2100	0 / 0	7

Pick a problem randomly based on the current filter.