greedy - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2541	P1479B1 Painting the Array I constructive algorithms data structures dp greedy implementation *1900	0 / 0	6
	2539	P1479B2 Painting the Array II constructive algorithms data structures dp greedy implementation *2100	0 / 0	7
	2531	P1480A Yet Another String Game games greedy strings *800	0 / 0	3
	2529	P1480B The Great Hero greedy implementation sortings *900	0 / 0	3
	2528	P1481A Space Navigation greedy strings *800	0 / 0	3
	2526	P1481B New Colony brute force greedy implementation *1100	0 / 0	3
	2524	P1481C Fence Painting brute force constructive algorithms greedy *1600	0 / 0	5
	2523	P1481D AB Graph brute force constructive algorithms graphs greedy implementation *2000	0 / 0	7
	2522	P1481E Sorting Books data structures dp greedy *2500	0 / 0	9
	2521	P1481F AB Tree dp greedy trees *3100	0 / 0	10
	2518	P1482C Basic Diplomacy brute force constructive algorithms greedy implementation *1600	0 / 0	5
	2510	P1485A Add and Divide brute force greedy math number theory *1000	0 / 0	3
	2505	P1485E Move and Swap dfs and similar dp greedy trees *2500	0 / 0	9
	2502	P1486A Shifting Stacks greedy implementation *900	0 / 0	3
	2493	P1487C Minimum Ties brute force constructive algorithms dfs and similar graphs greedy implementation math *1500	0 / 0	5
	2491	P1487E Cheap Dinner brute force data structures graphs greedy implementation sortings two pointers *2000	0 / 0	7
	2490	P1487F Ones dp greedy shortest paths *2900	0 / 0	10
	2487	P1488B RBS Deletion special problem greedy 1800	0 / 0	6
	2485	P1488D Problemsolving Marathon special problem binary search greedy 1900	0 / 0	6
	2480	P1488G Painting Numbers special problem data structures greedy number theory 2500	0 / 0	9
	2473	P1490A Dense Array greedy math *800	0 / 0	3
	2464	P1490E Accidental Victory binary search data structures greedy *1400	0 / 0	4
	2463	P1490F Equalize the Array binary search data structures greedy math sortings *1500	0 / 0	5
	2458	P1491A K-th Largest Value brute force greedy implementation *800	0 / 0	3
	2455	P1491C Pekora and Trampoline brute force data structures dp greedy implementation *1700	0 / 0	5
	2452	P1491D Zookeeper and The Infinite Zoo bitmasks constructive algorithms dp greedy math *1800	0 / 0	6
	2439	P1492B Card Deck data structures greedy math *1100	0 / 0	3
	2438	P1492C Maximum width binary search data structures dp greedy two pointers *1500	0 / 0	5
	2437	P1492D Genius's Gambit bitmasks constructive algorithms greedy math *1900	0 / 0	6
	2436	P1492E Almost Fault-Tolerant Database brute force constructive algorithms dfs and similar greedy implementation *2500	0 / 0	9
	2435	P1493A Anti-knapsack constructive algorithms greedy *800	0 / 0	3
	2433	P1493C K-beautiful Strings binary search brute force constructive algorithms greedy strings *2000	0 / 0	7
	2431	P1493E Enormous XOR bitmasks constructive algorithms greedy math strings two pointers *2600	0 / 0	10
	2427	P1494B Berland Crossword bitmasks brute force greedy implementation *1400	0 / 0	4
	2424	P1494C 1D Sokoban binary search dp greedy implementation two pointers *1900	0 / 0	6
	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
	2415	P1495B Let's Go Hiking games greedy *1900	0 / 0	6
	2411	P1495E Qingshan and Daniel brute force data structures greedy implementation *3200	0 / 0	10
	2409	P1496A Split it! brute force constructive algorithms greedy strings *900	0 / 0	3
	2405	P1497A Meximization brute force data structures greedy sortings *800	0 / 0	3
	2404	P1497B M-arrays constructive algorithms greedy math *1200	0 / 0	4
	2396	P1497E1 Square-Free Division (easy version) data structures dp greedy math number theory two pointers *1700	0 / 0	5
	2394	P1497E2 Square-Free Division (hard version) data structures dp greedy math number theory two pointers *2500	0 / 0	9
	2389	P1498B Box Fitting binary search bitmasks data structures greedy *1300	0 / 0	4
	2385	P1498E Two Houses brute force graphs greedy interactive sortings *2200	0 / 0	8
	2382	P1499B Binary Removals brute force dp greedy implementation *1000	0 / 0	3
	2381	P1499C Minimum Grid Path brute force data structures greedy math *1500	0 / 0	5
	2368	P1500C Matrix Sorting bitmasks brute force constructive algorithms greedy two pointers *2600	0 / 0	10
	2359	P1503A Balance the Bits constructive algorithms greedy *1600	0 / 0	5
	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
	2349	P1504B Flip the Bits constructive algorithms greedy implementation math *1200	0 / 0	4
	2344	P1505E Cakewalk special problem greedy implementation shortest paths 1800	0 / 0	6
	2338	P1506B Partial Replacement greedy implementation *1100	0 / 0	3
	2334	P1506D Epic Transformation constructive algorithms data structures greedy *1400	0 / 0	4
	2328	P1506G Maximize the Remaining String brute force data structures dp greedy strings *2000	0 / 0	7
	2327	P1508A Binary Literature constructive algorithms greedy implementation strings two pointers *1900	0 / 0	6
	2324	P1508C Complete the MST bitmasks brute force data structures dfs and similar dsu graphs greedy trees *2500	0 / 0	9
	2315	P1509B TMT Document greedy *1100	0 / 0	3
	2313	P1509C The Sports Festival dp greedy *1800	0 / 0	6
	2299	P1510I Is It Rated? greedy interactive math probabilities *2700	0 / 0	10
	2296	P1511A Review Site greedy *800	0 / 0	3
	2293	P1511D Min Cost String brute force constructive algorithms graphs greedy strings *1600	0 / 0	5
	2291	P1511E Colorings and Dominoes combinatorics dp greedy math *2100	0 / 0	7
	2283	P1512D Corrupted Array constructive algorithms data structures greedy *1200	0 / 0	4
	2281	P1512E Permutation by Sum brute force greedy math *1600	0 / 0	5
	2280	P1512F Education brute force dp greedy implementation *1900	0 / 0	6
	2271	P1513D GCD and MST constructive algorithms dsu graphs greedy number theory sortings *2000	1 / 1	7
	2266	P1514C Product 1 Modulo N greedy number theory *1600	0 / 0	5
	2265	P1514D Cut and Stick binary search data structures greedy implementation sortings *2000	0 / 0	7
	2263	P1515A Phoenix and Gold constructive algorithms greedy math *800	0 / 0	3
	2261	P1515C Phoenix and Towers constructive algorithms data structures greedy *1400	0 / 0	4
	2260	P1515D Phoenix and Socks greedy sortings two pointers *1500	0 / 0	5
	2258	P1515F Phoenix and Earthquake constructive algorithms dfs and similar dsu graphs greedy trees *2600	0 / 0	10
	2250	P1516A Tit for Tat greedy *800	0 / 0	3
	2248	P1516B AGAGA XOOORRR bitmasks brute force dp greedy *1500	0 / 0	5
	2240	P1517A Sum of 2050 greedy math *800	1 / 2	3
	2238	P1517B Morning Jogging constructive algorithms greedy sortings *1200	0 / 0	4
	2236	P1517C Fillomino 2 constructive algorithms dfs and similar greedy implementation *1400	0 / 0	4
	2226	P1519C Berland Regional brute force data structures greedy number theory sortings *1400	0 / 0	4
	2218	P1520E Arranging The Sheep greedy math *1400	0 / 0	4
	2213	P1520G To Go Or Not To Go? brute force dfs and similar graphs greedy implementation shortest paths *2200	0 / 0	8
	2209	P1521D Nastia Plays with a Tree constructive algorithms data structures dfs and similar dp dsu greedy implementation trees *2500	0 / 0	9
	2208	P1521E Nastia and a Beautiful Matrix binary search constructive algorithms dp greedy *2700	0 / 0	10
	2205	P1523C Compression and Expansion brute force data structures greedy implementation trees *1600	0 / 0	5
	2193	P1525B Permutation Sort constructive algorithms greedy *900	0 / 0	3
	2192	P1525C Robot Collisions data structures greedy implementation sortings *2000	0 / 0	7
	2191	P1525D Armchairs dp flows graph matchings greedy *1800	0 / 0	6
	2183	P1526C1 Potions (Easy Version) brute force data structures dp greedy *1500	0 / 0	5
	2182	P1526C2 Potions (Hard Version) data structures greedy *1600	0 / 0	5
	2168	P1528A Parsa's Humongous Tree dfs and similar divide and conquer dp greedy trees *1600	0 / 0	5
	2164	P1528C Trees of Tranquillity data structures dfs and similar greedy trees *2300	0 / 0	8
	2157	P1529A Eshag Loves Big Arrays constructive algorithms greedy math *800	0 / 0	3
	2155	P1529B Sifid and Strange Subsequences greedy math sortings *1100	0 / 0	3
	2153	P1530A Binary Decimal greedy math *800	0 / 0	3
	2151	P1530C Pursuit binary search brute force greedy sortings *1200	0 / 0	4
	2150	P1530D Secret Santa constructive algorithms flows graphs greedy math *1600	0 / 0	5
	2149	P1530E Minimax constructive algorithms greedy strings *2100	0 / 0	7
	2133	P1533E Chess Team Forming *special problem binary search data structures greedy	0 / 0	(None)

Pick a problem randomly based on the current filter.