brute force - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	509	P1765E Exchange brute force math *1000	0 / 0	3
	496	P1765L Project Manager brute force data structures implementation *2400	0 / 0	9
	489	P1766A Extremely Round brute force implementation *800	1 / 1	3
	482	P1766E Decomposition binary search brute force data structures divide and conquer dp two pointers *2300	0 / 0	8
	475	P1767E Algebra Flash bitmasks brute force dp graphs math meet-in-the-middle trees *2500	0 / 0	9
	464	P1770A Koxia and Whiteboards brute force greedy *1000	1 / 1	3
	459	P1770C Koxia and Number Theory brute force chinese remainder theorem math number theory *1700	1 / 1	5
	441	P1771D Hossam and (sub-)palindromic tree brute force data structures dfs and similar dp strings trees *2100	0 / 0	7
	440	P1771E Hossam and a Letter brute force dp implementation two pointers *2500	0 / 0	9
	427	P1773I Interactive Factorial Guessing brute force games implementation interactive *2500	0 / 0	9
	416	P1774D Same Count One brute force constructive algorithms greedy implementation two pointers *1600	0 / 0	5
	411	P1774F1 Magician and Pigs (Easy Version) brute force data structures implementation *2400	0 / 0	9
	410	P1774F2 Magician and Pigs (Hard Version) binary search brute force data structures implementation *2700	0 / 0	10
	407	P1774G Segment Covering brute force combinatorics constructive algorithms data structures dp trees *3200	0 / 0	10
	405	P1775A1 Gardener and the Capybaras (easy version) brute force constructive algorithms implementation *800	1 / 2	3
	363	P1778C Flexible String bitmasks brute force strings *1600	0 / 0	5
	346	P1779H Olympic Team Building brute force meet-in-the-middle *3500	0 / 0	10
	343	P1780B GCD Partition brute force greedy math number theory *1100	0 / 0	3
	338	P1780E Josuke and Complete Graph binary search brute force data structures math number theory *2400	0 / 0	9
	339	P1780F Three Chairs bitmasks brute force combinatorics data structures dp number theory sortings *2300	0 / 0	8
	333	P1781B Going to the Cinema brute force greedy sortings *1000	0 / 0	3
	332	P1781C Equal Frequencies brute force constructive algorithms greedy implementation sortings strings *1600	0 / 0	5
	331	P1781D Many Perfect Squares brute force math number theory *1800	0 / 0	6
	330	P1781E Rectangle Shrinking binary search brute force data structures greedy implementation two pointers *2300	0 / 0	8
	318	P1783D Different Arrays brute force dp implementation *2000	0 / 0	7
	316	P1783E Game of the Year brute force data structures math number theory *2300	0 / 0	8
	313	P1784A Monsters (easy version) brute force greedy *1000	0 / 0	3
	309	P1784E Infinite Game brute force combinatorics dp games probabilities *3100	0 / 0	10
	305	P1786B Cake Assembly Line brute force sortings *1300	0 / 0	4
	295	P1787G Colorful Tree Again brute force data structures trees *3000	0 / 0	10
	290	P1788A One and Two brute force implementation math *800	0 / 0	3
	286	P1788D Moving Dots binary search brute force combinatorics math two pointers *2000	0 / 0	7
	281	P1789A Serval and Mocha's Array brute force math number theory *800	1 / 1	3
	280	P1789B Serval and Inversion Magic brute force implementation strings two pointers *800	0 / 0	3
	278	P1789D Serval and Shift-Shift-Shift bitmasks brute force constructive algorithms implementation *2200	0 / 0	8
	277	P1789E Serval and Music Game brute force dp implementation math number theory *2500	0 / 0	9
	276	P1789F Serval and Brain Power bitmasks brute force dp greedy implementation strings *2700	0 / 0	10
	273	P1790C Premutation brute force implementation math *1000	0 / 0	3
	271	P1790F Timofey and Black-White Tree brute force dfs and similar divide and conquer graphs greedy math shortest paths trees *2100	0 / 0	7
	264	P1791D Distinct Split brute force greedy strings *1000	1 / 1	3
	261	P1791F Range Update Point Query binary search brute force data structures *1500	0 / 0	5
	254	P1792C Min Max Sort binary search brute force greedy math two pointers *1500	0 / 0	5
	251	P1792E Divisors and Table brute force dfs and similar dp number theory *2400	0 / 0	9
	247	P1792F2 Graph Coloring (hard version) brute force combinatorics divide and conquer dp fft graphs *2900	0 / 0	10
	239	P1793F Rebrending brute force data structures divide and conquer implementation *2600	0 / 0	10
	230	P1795A Two Towers brute force implementation strings *800	1 / 1	3
	229	P1795B Ideal Point brute force geometry greedy *900	1 / 1	3
	219	P1796A Typical Interview Problem brute force implementation strings *800	0 / 13	3
	212	P1796F Strange Triples brute force math number theory *2900	0 / 0	10
	206	P1797D Li Hua and Tree brute force data structures dfs and similar dp implementation trees *1900	0 / 0	6
	204	P1797E Li Hua and Array brute force data structures dsu math number theory two pointers *2300	0 / 0	8
	199	P1798B Three Sevens brute force data structures greedy implementation *1000	0 / 0	3
	195	P1798E Multitest Generator brute force dp *2300	0 / 0	8
	190	P1799B Equalize by Divide brute force constructive algorithms greedy math *1200	0 / 0	4
	183	P1799F Halve or Subtract binary search brute force dp greedy sortings *2700	0 / 0	10
	171	P1800E1 Unforgivable Curse (easy version) brute force constructive algorithms dsu graphs greedy strings *1400	0 / 0	4
	169	P1800E2 Unforgivable Curse (hard version) brute force constructive algorithms dfs and similar dsu graphs greedy strings *1500	0 / 0	5
	148	P1804C Pull Your Luck brute force greedy math number theory *1500	0 / 0	5
	147	P1804D Accommodation brute force dp greedy implementation *2000	0 / 0	7
	145	P1804E Routing bitmasks brute force dfs and similar dp graphs *2400	0 / 0	9
	141	P1805A We Need the Zero bitmasks brute force *800	0 / 0	3
	137	P1805E There Should Be a Lot of Maximums brute force data structures dfs and similar dp trees two pointers *2300	0 / 0	8
	136	P1805F1 Survival of the Weakest (easy version) binary search brute force implementation math sortings *2600	0 / 0	10
	131	P1806C Sequence Master brute force constructive algorithms math *1600	1 / 1	5
	128	P1806E Tree Master brute force data structures dfs and similar trees *2200	0 / 0	8
	116	P1807F Bouncy Ball brute force dfs and similar implementation *1700	0 / 0	5
	114	P1807G1 Subsequence Addition (Easy Version) brute force data structures dp greedy implementation sortings *1100	0 / 0	3
	111	P1808A Lucky Numbers brute force implementation *900	0 / 0	3
	108	P1808C Unlucky Numbers brute force dp greedy implementation *1900	0 / 0	6
	106	P1808D Petya, Petya, Petr, and Palindromes binary search brute force data structures two pointers *2100	0 / 0	7
	100	P1808E3 Minibuses on Venus (hard version) brute force combinatorics dp math *2800	0 / 0	10
	82	P1810A Beautiful Sequence brute force greedy *800	0 / 0	3
	81	P1810C Make It Permutation brute force greedy sortings *1300	0 / 0	4
	77	P1810E Monsters brute force data structures dfs and similar dsu graphs greedy *2100	0 / 0	7
	55	P1814B Long Legs brute force math *1700	0 / 0	5
	53	P1814D Balancing Weapons binary search brute force data structures math two pointers *2500	0 / 0	9
	50	P1814F Communication Towers brute force divide and conquer dsu *2700	0 / 0	10
	48	P1815B Sum Graph brute force constructive algorithms graphs implementation interactive shortest paths trees *2000	0 / 0	7
	9801	P1817B Fish Graph brute force constructive algorithms dfs and similar graphs *1900	0 / 0	6
	9798	P1817E Half-sum brute force divide and conquer greedy *3400	0 / 0	10
	36	P1819A Constructive Problem brute force greedy *1300	0 / 0	4
	32	P1819D Misha and Apples brute force data structures dp two pointers *2800	0 / 0	10
	22	P1821B Sort the Subarray brute force greedy	12 / 41	6
	19	P1821C Tear It Apart brute force implementation math strings	10 / 27	6
	17	P1821D Black Cells binary search brute force greedy math	3 / 23	9
	16	P1821E Rearrange Brackets brute force dp greedy sortings strings	1 / 1	10
	12	P1822A TubeTube Feed brute force implementation sortings	0 / 0	(None)
	3	P1822F Gardening Friends brute force dfs and similar dp graphs implementation trees	0 / 0	(None)
	2	P1822G1 Magic Triples (Easy Version) brute force math number theory	0 / 0	(None)
	1	P1822G2 Magic Triples (Hard Version) binary search brute force divide and conquer math number theory	0 / 0	(None)
	9788	P1825A LuoTianyi and the Palindrome String brute force greedy implementation strings	1 / 1	10
	9787	P1825B LuoTianyi and the Table brute force greedy implementation math	0 / 1	10
	9786	P1826A Trust Nobody brute force greedy implementation sortings	0 / 0	(None)
	9783	P1826D Running Miles brute force dp greedy	0 / 0	(None)
	9782	P1826E Walk the Runway bitmasks brute force data structures dp graphs implementation sortings	0 / 0	(None)
	9820	P1827C Palindrome Partition binary search brute force data structures dp hashing strings *2600	0 / 0	10
	9772	P1829D Gold Rush brute force dfs and similar dp implementation	0 / 0	(None)
	9846	P1830B The BOSS Can Count Pairs brute force math	0 / 0	(None)
	9844	P1830D Mex Tree brute force dp trees	0 / 0	(None)
	9813	P1832B Maximum Sum brute force sortings two pointers *1100	0 / 0	3

Pick a problem randomly based on the current filter.