brute force - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2434	P1493B Planet Lapituletti brute force implementation *1300	0 / 0	4
	2433	P1493C K-beautiful Strings binary search brute force constructive algorithms greedy strings *2000	0 / 0	7
	2432	P1493D GCD of an Array brute force data structures hashing implementation math number theory sortings two pointers *2100	1 / 2	7
	2429	P1494A ABC String bitmasks brute force implementation *900	0 / 0	3
	2427	P1494B Berland Crossword bitmasks brute force greedy implementation *1400	0 / 0	4
	2418	P1494F Delete The Edges brute force constructive algorithms dfs and similar graphs implementation *2900	0 / 0	10
	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
	2391	P1498A GCD Sum brute force math *800	0 / 0	3
	2388	P1498C Planar Reflections brute force data structures dp *1600	0 / 0	5
	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
	2372	P1500A Going Home brute force hashing implementation math *1800	0 / 0	6
	2371	P1500B Two chandeliers binary search brute force chinese remainder theorem math number theory *2200	0 / 0	8
	2368	P1500C Matrix Sorting bitmasks brute force constructive algorithms greedy two pointers *2600	0 / 0	10
	2336	P1506C Double-ended Strings brute force implementation strings *1000	0 / 0	3
	2328	P1506G Maximize the Remaining String brute force data structures dp greedy strings *2000	0 / 0	7
	2324	P1508C Complete the MST bitmasks brute force data structures dfs and similar dsu graphs greedy trees *2500	0 / 0	9
	2321	P1508E Tree Calendar brute force constructive algorithms data structures dfs and similar sortings trees *3100	0 / 0	10
	2319	P1508F Optimal Encoding brute force data structures *3500	0 / 0	10
	2297	P1510K King's Task brute force graphs implementation *1200	0 / 0	4
	2294	P1511C Yet Another Card Deck brute force data structures implementation trees *1100	0 / 0	3
	2293	P1511D Min Cost String brute force constructive algorithms graphs greedy strings *1600	0 / 0	5
	2290	P1511F Chainword brute force data structures dp matrices string suffix structures strings *2700	0 / 0	10
	2289	P1511G Chips on a Board bitmasks brute force data structures dp games two pointers *2700	0 / 20	10
	2288	P1512A Spy Detected! brute force implementation *800	0 / 0	3
	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
	2277	P1512G Short Task brute force dp math number theory *1700	0 / 0	5
	2269	P1513F Swapping Problem brute force constructive algorithms data structures sortings *2500	0 / 0	9
	2262	P1515B Phoenix and Puzzle brute force geometry math number theory *1000	0 / 0	3
	2254	P1515H Phoenix and Bits bitmasks brute force data structures sortings *3500	0 / 0	10
	2248	P1516B AGAGA XOOORRR bitmasks brute force dp greedy *1500	0 / 0	5
	2226	P1519C Berland Regional brute force data structures greedy number theory sortings *1400	0 / 0	4
	2225	P1519D Maximum Sum of Products brute force dp implementation math two pointers *1600	0 / 0	5
	2223	P1519F Chests and Keys bitmasks brute force dfs and similar dp flows *3200	0 / 0	10
	2222	P1520A Do Not Be Distracted! brute force implementation *800	0 / 0	3
	2221	P1520B Ordinary Numbers brute force math number theory *800	0 / 0	3
	2213	P1520G To Go Or Not To Go? brute force dfs and similar graphs greedy implementation shortest paths *2200	0 / 0	8
	2205	P1523C Compression and Expansion brute force data structures greedy implementation trees *1600	0 / 0	5
	2204	P1523D Love-Hate bitmasks brute force dp probabilities *2400	0 / 0	9
	2189	P1525F Goblins And Gnomes brute force dp flows graph matchings *2800	0 / 0	10
	2183	P1526C1 Potions (Easy Version) brute force data structures dp greedy *1500	0 / 0	5
	2180	P1526D Kill Anton brute force constructive algorithms data structures math strings *2200	0 / 0	8
	2151	P1530C Pursuit binary search brute force greedy sortings *1200	0 / 0	4
	2126	P1534A Colour the Flag brute force implementation *800	0 / 0	3
	2110	P1535A Fair Playoff brute force implementation *800	0 / 0	3
	2108	P1535B Array Reodering brute force greedy math number theory sortings *900	0 / 0	3
	2104	P1535F String Distance binary search brute force data structures hashing implementation strings *3000	0 / 0	10
	2102	P1536A Omkar and Bad Story brute force constructive algorithms *800	0 / 0	3
	2100	P1536B Prinzessin der Verurteilung brute force constructive algorithms strings *1200	0 / 0	4
	2087	P1537E1 Erase and Extend (Easy Version) binary search brute force dp greedy hashing implementation string suffix structures strings two pointers *1600	0 / 0	5
	2084	P1538A Stone Game brute force dp greedy *800	0 / 0	3
	2070	P1540B Tree Array brute force combinatorics dp graphs math probabilities trees *2300	0 / 0	8
	2067	P1540D Inverse Inversions binary search brute force data structures *3200	0 / 0	10
	2064	P1541B Pleasant Pairs brute force implementation math number theory *1200	0 / 0	4
	2054	P1543C Need for Pink Slips bitmasks brute force dfs and similar implementation math probabilities *1900	0 / 0	6
	2052	P1543D2 RPD and Rap Sheet (Hard Version) brute force constructive algorithms interactive math *2200	0 / 0	8
	2048	P1545C AquaMoon and Permutations 2-sat brute force combinatorics constructive algorithms graph matchings graphs *2800	0 / 0	10
	2044	P1545F AquaMoon and Potatoes brute force data structures dp *3500	0 / 0	10
	2043	P1546A AquaMoon and Two Arrays brute force greedy *800	0 / 0	3
	2035	P1547F Array Stabilization (GCD version) binary search brute force data structures divide and conquer number theory two pointers *1900	0 / 0	6
	2030	P1548A Web of Lies brute force graphs greedy *1400	0 / 0	4
	2025	P1548D2 Gregor and the Odd Cows (Hard) brute force geometry math number theory *3300	0 / 0	10
	2015	P1550C Manhattan Subarrays brute force geometry greedy implementation *1700	0 / 0	5
	2011	P1550E Stringforces binary search bitmasks brute force dp strings two pointers *2500	0 / 0	9
	1995	P1551E Fixed Points binary search brute force dp *2000	0 / 0	7
	1992	P1551F Equidistant Vertices brute force combinatorics dfs and similar dp trees *2200	0 / 0	8
	1984	P1552D Array Differentiation bitmasks brute force constructive algorithms dfs and similar dp graphs math *1800	0 / 0	6
	1978	P1552G A Serious Referee bitmasks brute force dfs and similar sortings *3000	0 / 0	10
	1971	P1553B Reverse String brute force dp hashing implementation strings *1300	0 / 0	4
	1969	P1553C Penalty bitmasks brute force dp greedy *1200	0 / 0	4
	1965	P1553E Permutation Shift brute force combinatorics constructive algorithms dfs and similar dsu graphs math *2100	0 / 0	7
	1962	P1553G Common Divisor Graph brute force constructive algorithms dsu graphs hashing math number theory *2700	0 / 0	10
	1953	P1554B Cobb bitmasks brute force greedy math *1700	0 / 0	5
	1948	P1555A PizzaForces brute force math *900	0 / 0	3
	1947	P1555B Two Tables brute force *1300	0 / 0	4
	1946	P1555C Coin Rows brute force constructive algorithms dp implementation *1300	0 / 0	4
	1944	P1555D Say No to Palindromes brute force constructive algorithms dp strings *1600	0 / 0	5
	1939	P1556C Compressed Bracket Sequence brute force implementation *1800	0 / 0	6
	1933	P1557A Ezzat and Two Subsequences brute force math sortings *800	0 / 0	3
	1928	P1557E Assiut Chess brute force constructive algorithms interactive *2800	0 / 0	10
	1927	P1558A Charmed by the Game brute force math *1300	0 / 0	4
	1926	P1558B Up the Strip brute force dp math number theory two pointers *1900	0 / 0	6
	1918	P1559D1 Mocha and Diana (Easy Version) brute force constructive algorithms dsu graphs greedy trees *1400	0 / 0	4
	1917	P1559D2 Mocha and Diana (Hard Version) brute force constructive algorithms dfs and similar dsu graphs greedy trees two pointers *2500	0 / 0	9
	1906	P1560F1 Nearest Beautiful Number (easy version) binary search bitmasks brute force constructive algorithms dfs and similar greedy *1900	0 / 0	6
	1905	P1560F2 Nearest Beautiful Number (hard version) bitmasks brute force constructive algorithms dfs and similar dp greedy *2100	0 / 1	7
	1904	P1561A Simply Strange Sort brute force implementation sortings *800	0 / 0	3
	1902	P1561D1 Up the Strip (simplified version) brute force data structures dp math number theory *1700	0 / 0	5
	1900	P1562B Scenes From a Memory brute force constructive algorithms implementation math number theory *1000	0 / 0	3
	1861	P1569E Playoff Restoration bitmasks brute force hashing implementation meet-in-the-middle *2600	0 / 0	10
	1859	P1569F Palindromic Hamiltonian Path brute force dfs and similar dp graphs hashing *3000	0 / 0	10
	1852	P1571D Sweepstake special problem brute force constructive algorithms implementation math 1800	0 / 0	6
	1838	P1572A Book binary search brute force data structures dp graphs implementation sortings *1800	0 / 0	6
	1837	P1572B Xor of 3 brute force constructive algorithms greedy two pointers *2500	0 / 0	9
	1818	P1574D The Strongest Build binary search brute force data structures dfs and similar graphs greedy hashing implementation *2000	0 / 0	7
	1806	P1575D Divisible by Twenty-Five brute force dfs and similar dp *1800	0 / 0	6

Pick a problem randomly based on the current filter.