brute force - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	10333	P1925B A Balanced Problemset? brute force greedy math number theory *1200	0 / 0	4
	10329	P1927C Choose the Different Ones! brute force greedy math	0 / 0	(None)
	10328	P1927D Find the Different Ones! binary search brute force data structures dp dsu greedy two pointers	0 / 0	(None)
	10322	P1928C Physical Education Lesson brute force math number theory	0 / 0	(None)
	10321	P1928D Lonely Mountain Dungeons binary search brute force data structures greedy math ternary search	0 / 0	(None)
	10319	P1928F Digital Patterns brute force combinatorics data structures implementation math	0 / 0	(None)
	10437	P1929C Sasha and the Casino binary search brute force constructive algorithms games greedy math *1400	0 / 0	4
	10435	P1929E Sasha and the Happy Tree Cutting bitmasks brute force dfs and similar dp graphs greedy math trees *2300	0 / 0	8
	10434	P1929F Sasha and the Wedding Binary Search Tree brute force combinatorics data structures dfs and similar math trees *2300	0 / 0	8
	10432	P1930B Permutation Printing brute force constructive algorithms math *1000	0 / 0	3
	10430	P1930D1 Sum over all Substrings (Easy Version) brute force dp greedy strings *1800	0 / 0	6
	10427	P1930F Maximize the Difference bitmasks brute force dfs and similar *2700	0 / 0	10
	10423	P1931A Recovering a Small String brute force strings *800	0 / 0	3
	10421	P1931C Make Equal Again brute force greedy math *1000	0 / 0	3
	10414	P1932C LR-remainders brute force data structures implementation math two pointers *1400	0 / 0	4
	10407	P1933C Turtle Fingers: Count the Values of k brute force implementation math number theory *1100	0 / 0	3
	10403	P1933G Turtle Magic: Royal Turtle Shell Pattern bitmasks brute force combinatorics constructive algorithms dfs and similar math *2300	0 / 0	8
	10401	P1934B Yet Another Coin Problem brute force dp greedy math *1200	0 / 0	4
	10397	P1934E Weird LCM Operations brute force constructive algorithms number theory *3000	0 / 0	10
	10394	P1935C Messenger in MAC binary search brute force constructive algorithms data structures dp greedy sortings *1800	0 / 0	6
	10392	P1935E Distance Learning Courses in MAC bitmasks brute force data structures greedy math *2400	0 / 0	9
	10361	P1941A Rudolf and the Ticket brute force math *800	0 / 0	3
	10360	P1941B Rudolf and 121 brute force dp greedy math *1000	0 / 0	3
	10524	P1942F Farmer John's Favorite Function brute force data structures implementation math	0 / 0	(None)
	10471	P1943D1 Counting Is Fun (Easy Version) brute force combinatorics dp math *2400	0 / 0	9
	10469	P1943E1 MEX Game 2 (Easy Version) binary search brute force greedy *2900	0 / 0	10
	10462	P1945C Left and Right Houses brute force *1200	0 / 0	4
	10457	P1945H GCD is Greater brute force data structures math number theory *2600	0 / 0	10
	10453	P1946D Birthday Gift bitmasks brute force constructive algorithms dsu greedy implementation *1900	0 / 0	6
	10451	P1946F Nobody is needed brute force data structures dp math number theory *2500	0 / 0	9
	10348	P1948G MST with Matching bitmasks brute force	0 / 0	(None)
	10450	P1949A Grove brute force dfs and similar dp geometry probabilities	0 / 0	(None)
	10449	P1949B Charming Meals binary search brute force greedy sortings	0 / 0	(None)
	10446	P1949E Damage per Second brute force math	0 / 0	(None)
	10518	P1950D Product of Binary Decimals brute force dp implementation number theory	0 / 0	(None)
	10517	P1950E Nearly Shortest Repeating Substring brute force implementation number theory strings	0 / 0	(None)
	10516	P1950F 0, 1, 2, Tree! bitmasks brute force greedy implementation trees	0 / 0	(None)
	10510	P1951E No Palindromes brute force constructive algorithms divide and conquer greedy hashing implementation math strings	0 / 0	(None)
	10503	P1952C They Have Fooled brute force schedules	0 / 0	(None)
	10500	P1952F Grid brute force	0 / 0	(None)
	10496	P1952J Help, what does it mean to be "Based" brute force constructive algorithms expression parsing implementation sortings	0 / 0	(None)
	10485	P1955E Long Inversions brute force greedy implementation sortings	0 / 0	(None)
	10483	P1955G GCD on a grid brute force dfs and similar dp implementation math number theory	0 / 0	(None)
	10482	P1955H The Most Reckless Defense bitmasks brute force constructive algorithms dp flows graph matchings shortest paths	0 / 0	(None)
	10481	P1956A Nene's Game binary search brute force data structures games greedy	0 / 0	(None)
	10478	P1956D Nene and the Mex Operator bitmasks brute force constructive algorithms divide and conquer dp greedy implementation math	0 / 0	(None)
	10477	P1956E1 Nene vs brute force implementation math	0 / 0	(None)
	10476	P1956E2 Nene vs brute force implementation math	0 / 0	(None)
	10621	P1967B1 Reverse Card (Easy Version) brute force math number theory *1400	0 / 0	4
	10620	P1967B2 Reverse Card (Hard Version) brute force math number theory *2200	0 / 0	8
	10619	P1967C Fenwick Tree bitmasks brute force combinatorics data structures dp math trees *2300	0 / 0	8
	10615	P1967F Next and Prev brute force data structures implementation *3200	0 / 0	10
	10614	P1968A Maximize? brute force math number theory *800	0 / 0	3
	10611	P1968D Permutation Game brute force dfs and similar games graphs greedy math *1300	0 / 0	4
	10607	P1968G2 Division + LCP (hard version) binary search brute force data structures dp hashing math string suffix structures strings *2200	0 / 0	8
	10599	P1970A2 Balanced Unshuffle (Medium) brute force constructive algorithms trees *2400	0 / 0	9
	10591	P1970D1 Arithmancy (Easy) brute force constructive algorithms interactive strings *2100	0 / 0	7
	10581	P1970G2 Min-Fund Prison (Medium) brute force dfs and similar dp graphs trees *2200	0 / 0	8
	10574	P1971F Circle Perimeter binary search brute force dfs and similar geometry implementation math *1600	0 / 0	5
	10571	P1972A Contest Proposal brute force greedy two pointers *800	0 / 0	3
	10569	P1973A Chess For Three brute force dp implementation math *900	0 / 0	3
	10566	P1973D Cat, Fox and Maximum Array Split brute force interactive math *2400	0 / 0	9
	10564	P1973F Maximum GCD Sum Queries bitmasks brute force dp implementation number theory *3100	0 / 0	10
	10558	P1974F Cutting Game binary search brute force data structures implementation sortings two pointers *1900	0 / 0	6
	10556	P1975A Bazoka and Mocha's Array brute force greedy implementation sortings *800	0 / 0	3
	10555	P1975B 378QAQ and Mocha's Array brute force greedy math sortings *1000	0 / 0	3
	10554	P1975C Chamo and Mocha's Array binary search brute force greedy *1200	0 / 0	4
	10553	P1975D Paint the Tree brute force dfs and similar dp greedy shortest paths trees *1700	0 / 0	5
	10551	P1975F Set bitmasks brute force combinatorics dfs and similar divide and conquer dp math *2600	0 / 0	10
	10539	P1977C Nikita and LCM brute force data structures dp greedy math number theory sortings *1900	0 / 0	6
	10538	P1977D XORificator bitmasks brute force greedy hashing *2300	0 / 0	8
	10694	P1978E Computing Machine brute force data structures dp greedy implementation *2000	0 / 0	7
	10692	P1979A Guess the Maximum brute force greedy implementation *800	0 / 0	3
	10689	P1979D Fixing a Binary String bitmasks brute force constructive algorithms dp greedy hashing strings *1800	0 / 0	6
	10687	P1979F Kostyanych's Theorem brute force constructive algorithms graphs interactive *2900	0 / 0	10
	10536	P1981A Turtle and Piggy Are Playing a Game brute force greedy math	0 / 0	(None)
	10677	P1982B Collatz Conjecture brute force implementation math number theory *1200	0 / 0	4
	10675	P1982D Beauty of the mountains brute force data structures implementation math number theory *1700	0 / 0	5
	10674	P1982E Number of k-good subarrays bitmasks brute force combinatorics divide and conquer dp math meet-in-the-middle *2300	0 / 0	8
	10756	P1983G Your Loss bitmasks brute force dp trees *3000	0 / 0	10
	10668	P1984D "a" String Problem brute force hashing implementation math string suffix structures strings *2000	0 / 0	7
	10666	P1984F Reconstruction brute force dp math *2500	0 / 0	9
	10662	P1985B Maximum Multiple Sum brute force math number theory *800	0 / 0	3
	10659	P1985E Secret Box brute force combinatorics math *1200	0 / 0	4
	10656	P1985H1 Maximize the Largest Component (Easy Version) brute force data structures dfs and similar dsu graphs implementation *1700	0 / 0	5
	10654	P1986A X Axis brute force geometry math sortings *800	0 / 0	3
	10653	P1986B Matrix Stabilization brute force data structures greedy sortings *1000	0 / 0	3
	10651	P1986D Mathematical Problem brute force dp greedy implementation math two pointers *1400	0 / 0	4
	10648	P1986G1 Permutation Problem (Simple Version) binary search brute force combinatorics data structures math number theory *2200	0 / 0	8
	10647	P1986G2 Permutation Problem (Hard Version) brute force data structures hashing math number theory *2500	0 / 0	9
	10642	P1987E Wonderful Tree! brute force data structures dfs and similar dsu greedy trees *2000	0 / 0	7
	10755	P1988A Split the Multiset brute force greedy implementation math *900	0 / 0	3
	10752	P1988D The Omnipotent Monster Killer brute force dfs and similar dp trees *2000	0 / 0	7
	10751	P1988E Range Minimum Sum binary search brute force data structures divide and conquer implementation *2300	0 / 0	8
	10635	P1989B Substring and Subsequence brute force greedy strings *1200	0 / 0	4
	10633	P1989D Smithing Skill brute force data structures dp greedy math sortings two pointers *1900	0 / 0	6
	10749	P1990A Submission Bait brute force games greedy sortings *900	0 / 0	3
	10747	P1990C Mad MAD Sum brute force greedy math *1500	0 / 0	5
	10746	P1990D Grid Puzzle bitmasks brute force dp greedy implementation *1800	0 / 0	6
	10743	P1990F Polygonal Segments brute force data structures divide and conquer dp greedy two pointers *2800	0 / 0	10

Pick a problem randomly based on the current filter.