Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	10491	P1954E Chain Reaction binary search data structures dsu greedy implementation math number theory	0 / 0	(None)
	10490	P1954F Unique Strings combinatorics dp math	0 / 0	(None)
	10489	P1955A Yogurt Sale math	0 / 0	(None)
	10488	P1955B Progressive Square constructive algorithms data structures implementation sortings	0 / 0	(None)
	10487	P1955C Inhabitant of the Deep Sea greedy implementation math	0 / 0	(None)
	10486	P1955D Inaccurate Subsequence Search data structures two pointers	0 / 0	(None)
	10485	P1955E Long Inversions brute force greedy implementation sortings	0 / 0	(None)
	10484	P1955F Unfair Game dp games greedy math schedules	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)
	10480	P1956B Nene and the Card Game games greedy	0 / 0	(None)
	10479	P1956C Nene's Magical Matrix constructive algorithms greedy math	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)
	10475	P1956F Nene and the Passing Game constructive algorithms data structures dsu graphs sortings	0 / 0	(None)
	10630	P1965A Everything Nim games greedy math sortings *1400	0 / 0	4
	10629	P1965B Missing Subsequence Sum bitmasks constructive algorithms greedy number theory *1800	0 / 0	6
	10628	P1965C Folding Strip constructive algorithms greedy strings *2300	0 / 0	8
	10627	P1965D Missing Subarray Sum constructive algorithms *2900	0 / 0	10
	10626	P1965E Connected Cubes constructive algorithms games *3100	0 / 0	10
	10625	P1965F Conference data structures flows *3300	0 / 0	10
	10624	P1966A Card Exchange constructive algorithms games greedy *800	0 / 0	3
	10623	P1966B Rectangle Filling constructive algorithms implementation *1100	0 / 0	3
	10622	P1967A Permutation Counting binary search greedy implementation math sortings *1400	0 / 0	4
	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
	10618	P1967D Long Way to be Non-decreasing binary search dfs and similar graphs implementation shortest paths two pointers *2800	0 / 0	10
	10617	P1967E1 Again Counting Arrays (Easy Version) combinatorics dp fft math *3100	0 / 0	10
	10616	P1967E2 Again Counting Arrays (Hard Version) combinatorics dp math *3500	0 / 0	10
	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
	10613	P1968B Prefiquence greedy two pointers *800	0 / 0	3
	10612	P1968C Assembly via Remainders constructive algorithms number theory *1000	0 / 0	3
	10611	P1968D Permutation Game brute force dfs and similar games graphs greedy math *1300	0 / 0	4
	10610	P1968E Cells Arrangement constructive algorithms *1600	0 / 0	5
	10609	P1968F Equal XOR Segments binary search data structures *1800	0 / 0	6
	10608	P1968G1 Division + LCP (easy version) binary search data structures dp hashing string suffix structures strings *1900	0 / 0	6
	10607	P1968G2 Division + LCP (hard version) binary search brute force data structures dp hashing math string suffix structures strings *2200	0 / 0	8
	10606	P1969A Two Friends constructive algorithms implementation math *800	0 / 0	3
	10605	P1969B Shifts and Sorting constructive algorithms greedy *1000	0 / 0	3
	10604	P1969C Minimizing the Sum dp implementation *1700	0 / 0	5
	10603	P1969D Shop Game data structures greedy math sortings *1900	0 / 0	6
	10602	P1969E Unique Array binary search data structures divide and conquer dp greedy *2400	0 / 0	9
	10601	P1969F Card Pairing dp greedy hashing implementation *3000	0 / 0	10
	10600	P1970A1 Balanced Shuffle (Easy) implementation sortings *1000	0 / 0	3
	10599	P1970A2 Balanced Unshuffle (Medium) brute force constructive algorithms trees *2400	0 / 0	9
	10598	P1970A3 Balanced Unshuffle (Hard) constructive algorithms trees *2400	0 / 0	9
	10597	P1970B1 Exact Neighbours (Easy) constructive algorithms *1900	0 / 0	6
	10596	P1970B2 Exact Neighbours (Medium) constructive algorithms *2100	0 / 0	7
	10595	P1970B3 Exact Neighbours (Hard) constructive algorithms *2300	0 / 0	8
	10594	P1970C1 Game on Tree (Easy) games *1400	0 / 0	4
	10593	P1970C2 Game on Tree (Medium) dfs and similar dp games trees *1700	0 / 0	5
	10592	P1970C3 Game on Tree (Hard) dfs and similar dp games trees *1900	0 / 0	6
	10591	P1970D1 Arithmancy (Easy) brute force constructive algorithms interactive strings *2100	0 / 0	7
	10590	P1970D2 Arithmancy (Medium) constructive algorithms interactive probabilities strings *2600	0 / 0	10
	10589	P1970D3 Arithmancy (Hard) interactive *3100	0 / 0	10
	10588	P1970E1 Trails (Easy) dp *1800	0 / 0	6
	10587	P1970E2 Trails (Medium) dp matrices *2000	0 / 0	7
	10586	P1970E3 Trails (Hard) dp matrices *2200	0 / 0	8
	10585	P1970F1 Playing Quidditch (Easy) implementation *2300	0 / 0	8
	10584	P1970F2 Playing Quidditch (Medium) implementation *2300	0 / 0	8
	10583	P1970F3 Playing Quidditch (Hard) implementation *2300	0 / 0	8
	10582	P1970G1 Min-Fund Prison (Easy) dfs and similar trees *1900	0 / 0	6
	10581	P1970G2 Min-Fund Prison (Medium) brute force dfs and similar dp graphs trees *2200	0 / 0	8
	10580	P1970G3 Min-Fund Prison (Hard) bitmasks dfs and similar dp graphs trees *2400	0 / 0	9
	10579	P1971A My First Sorting Problem implementation sortings *800	0 / 0	3
	10578	P1971B Different String implementation strings *800	0 / 0	3
	10577	P1971C Clock and Strings implementation *900	0 / 0	3
	10576	P1971D Binary Cut dp greedy implementation sortings strings *1100	0 / 0	3
	10575	P1971E Find the Car binary search math sortings *1500	0 / 0	5
	10574	P1971F Circle Perimeter binary search brute force dfs and similar geometry implementation math *1600	0 / 0	5
	10573	P1971G XOUR data structures dsu sortings *1400	0 / 0	4
	10572	P1971H ±1 2-sat dfs and similar graphs *2100	0 / 0	7
	10571	P1972A Contest Proposal brute force greedy two pointers *800	0 / 0	3
	10570	P1972B Coin Games games *900	0 / 0	3
	10569	P1973A Chess For Three brute force dp implementation math *900	0 / 0	3
	10568	P1973B Cat, Fox and the Lonely Array binary search bitmasks data structures greedy math two pointers *1300	0 / 0	4
	10567	P1973C Cat, Fox and Double Maximum constructive algorithms greedy implementation math sortings *1700	0 / 0	5
	10566	P1973D Cat, Fox and Maximum Array Split brute force interactive math *2400	0 / 0	9
	10565	P1973E Cat, Fox and Swaps graphs math sortings *2500	0 / 0	9
	10564	P1973F Maximum GCD Sum Queries bitmasks brute force dp implementation number theory *3100	0 / 0	10
	10563	P1974A Phone Desktop greedy math *800	0 / 0	3
	10562	P1974B Symmetric Encoding implementation sortings strings *800	0 / 0	3
	10561	P1974C Beautiful Triple Pairs combinatorics data structures *1400	0 / 0	4
	10560	P1974D Ingenuity-2 constructive algorithms greedy implementation *1400	0 / 0	4
	10559	P1974E Money Buys Happiness dp *1800	0 / 0	6
	10558	P1974F Cutting Game binary search brute force data structures implementation sortings two pointers *1900	0 / 0	6
	10557	P1974G Money Buys Less Happiness Now data structures greedy sortings *2000	0 / 0	7
	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
	10552	P1975E Chain Queries binary search data structures dfs and similar implementation trees *2100	0 / 0	7
	10551	P1975F Set bitmasks brute force combinatorics dfs and similar divide and conquer dp math *2600	0 / 0	10
	10550	P1975G Zimpha Fan Club fft greedy math strings *3000	0 / 1	10
	10549	P1975H 378QAQ and Core greedy strings *3500	0 / 0	10
	10548	P1975I Mind Bloom dp *3500	0 / 0	10

Pick a problem randomly based on the current filter.