implementation - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	10202	P1899B 250 Thousand Tons of TNT brute force implementation number theory *1100	0 / 0	3
	10199	P1899E Queue Sort greedy implementation sortings *1300	0 / 0	4
	10196	P1900A Cover in Water constructive algorithms greedy implementation strings *800	0 / 0	3
	10192	P1900E Transitive Graph dfs and similar dp dsu graphs implementation *2100	0 / 0	7
	10191	P1900F Local Deletions binary search data structures implementation *2800	0 / 0	10
	10187	P1901D Yet Another Monster Fight binary search dp greedy implementation math *1700	0 / 0	5
	10317	P1907G Lights brute force constructive algorithms dfs and similar graphs greedy implementation *2200	0 / 0	8
	10316	P1909A Distinct Buttons implementation math *800	0 / 0	3
	10306	P1910A Username special problem implementation 1100	0 / 0	3
	10304	P1910C Poisonous Swamp special problem special problem implementation implementation *1600	0 / 0	5
	10296	P1912A Accumulator Apex data structures implementation sortings *1800	0 / 0	6
	10247	P1912E Evaluate It and Back Again constructive algorithms implementation math *2200	0 / 0	8
	10239	P1913A Rating Increase implementation *800	0 / 0	3
	10233	P1914A Problemsolving Log implementation strings *800	0 / 0	3
	10230	P1914D Three Activities brute force dp greedy implementation sortings *1200	0 / 0	4
	10293	P1915A Odd One Out bitmasks implementation *800	0 / 0	3
	10292	P1915B Not Quite Latin Square bitmasks brute force implementation *800	0 / 0	3
	10291	P1915C Can I Square? binary search implementation *800	0 / 0	3
	10290	P1915D Unnatural Language Processing greedy implementation strings *900	0 / 0	3
	10287	P1915G Bicycles graphs greedy implementation shortest paths sortings *1800	0 / 0	6
	10286	P1916A 2023 constructive algorithms implementation math number theory *800	0 / 0	3
	10284	P1916C Training Before the Olympiad constructive algorithms games greedy implementation math *1200	0 / 0	4
	10222	P1917C Watering an Array brute force greedy implementation math *1600	0 / 0	5
	10220	P1917E Construct Matrix constructive algorithms implementation math *2500	0 / 0	9
	10347	P1918A Brick Wall constructive algorithms greedy implementation math *800	0 / 0	3
	10346	P1918B Minimize Inversions constructive algorithms data structures greedy implementation sortings *900	0 / 0	3
	10345	P1918C XOR-distance bitmasks greedy implementation math *1400	0 / 0	4
	10344	P1918D Blocking Elements binary search data structures dp implementation two pointers *1900	0 / 0	6
	10343	P1918E ace5 and Task Order constructive algorithms divide and conquer implementation interactive probabilities sortings *2200	0 / 0	8
	10342	P1918F Caterpillar on a Tree dfs and similar graphs greedy implementation sortings trees *2500	0 / 0	9
	10273	P1919E Counting Prefixes combinatorics constructive algorithms dp implementation math *2600	0 / 0	10
	10265	P1920D Array Repetition binary search brute force dsu implementation math *1800	0 / 0	6
	10260	P1921B Arranging Cats greedy implementation *800	0 / 0	3
	10256	P1921F Sum of Progression brute force data structures dp implementation math *1900	0 / 0	6
	10255	P1921G Mischievous Shooter brute force data structures divide and conquer dp implementation *2200	0 / 0	8
	10254	P1922A Tricky Template constructive algorithms implementation strings *800	0 / 0	3
	10251	P1922D Berserk Monsters brute force data structures dsu implementation *1900	0 / 0	6
	10339	P1924B Space Harbour data structures implementation math sortings *2100	0 / 0	7
	10326	P1927F Microcycle data structures dfs and similar dsu graphs greedy implementation sortings trees	0 / 0	(None)
	10320	P1928E Modular Sequence constructive algorithms dp greedy implementation math number theory	0 / 0	(None)
	10319	P1928F Digital Patterns brute force combinatorics data structures implementation math	0 / 0	(None)
	10429	P1930D2 Sum over all Substrings (Hard Version) bitmasks divide and conquer dp dsu greedy implementation strings *2100	0 / 0	7
	10416	P1932A Thorns and Coins dp greedy implementation *800	0 / 0	3
	10414	P1932C LR-remainders brute force data structures implementation math two pointers *1400	0 / 0	4
	10413	P1932D Card Game greedy implementation *1400	0 / 0	4
	10412	P1932E Final Countdown implementation math number theory *1600	0 / 0	5
	10408	P1933B Turtle Math: Fast Three Task implementation math number theory *800	0 / 0	3
	10407	P1933C Turtle Fingers: Count the Values of k brute force implementation math number theory *1100	0 / 0	3
	10405	P1933E Turtle vs binary search implementation math ternary search *1500	0 / 0	5
	10393	P1935D Exam in MAC binary search combinatorics implementation math *1800	0 / 0	6
	10391	P1935F Andrey's Tree binary search constructive algorithms data structures dfs and similar dsu greedy implementation trees *2800	0 / 0	10
	10389	P1936B Pinball binary search data structures implementation math two pointers *2000	0 / 0	7
	10388	P1936C Pokémon Arena data structures graphs greedy implementation shortest paths sortings *2400	0 / 0	9
	10384	P1937A Shuffle Party implementation math *800	0 / 0	3
	10383	P1937B Binary Path dp greedy implementation *1300	0 / 0	4
	10358	P1941D Rudolf and the Ball Game dfs and similar dp implementation *1200	0 / 0	4
	10526	P1942D Learning to Paint binary search data structures dfs and similar dp greedy implementation sortings	0 / 0	(None)
	10524	P1942F Farmer John's Favorite Function brute force data structures implementation math	0 / 0	(None)
	10473	P1943B Non-Palindromic Substring hashing implementation math strings *2000	0 / 0	7
	10458	P1945G Cook and Porridge binary search constructive algorithms data structures implementation *2500	0 / 0	9
	10456	P1946A Median of an Array greedy implementation *800	0 / 0	3
	10454	P1946C Tree Cutting binary search dp greedy implementation trees *1600	0 / 0	5
	10453	P1946D Birthday Gift bitmasks brute force constructive algorithms dsu greedy implementation *1900	0 / 0	6
	10441	P1949J Amanda the Amoeba graphs implementation trees two pointers	0 / 0	(None)
	10521	P1950A Stair, Peak, or Neither? implementation	0 / 0	(None)
	10520	P1950B Upscaling implementation	0 / 0	(None)
	10519	P1950C Clock Conversion implementation 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)
	10515	P1950G Shuffling Songs bitmasks dfs and similar dp graphs hashing implementation strings	0 / 0	(None)
	10510	P1951E No Palindromes brute force constructive algorithms divide and conquer greedy hashing implementation math strings	0 / 0	(None)
	10502	P1952D Are You a Procrastinator? implementation	0 / 0	(None)
	10498	P1952H Palindrome implementation strings	0 / 0	(None)
	10496	P1952J Help, what does it mean to be "Based" brute force constructive algorithms expression parsing implementation sortings	0 / 0	(None)
	10494	P1954B Make It Ugly implementation math	0 / 0	(None)
	10491	P1954E Chain Reaction binary search data structures dsu greedy implementation math number theory	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)
	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)
	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)
	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
	10618	P1967D Long Way to be Non-decreasing binary search dfs and similar graphs implementation shortest paths two pointers *2800	0 / 0	10
	10615	P1967F Next and Prev brute force data structures implementation *3200	0 / 0	10
	10606	P1969A Two Friends constructive algorithms implementation math *800	0 / 0	3
	10604	P1969C Minimizing the Sum dp implementation *1700	0 / 0	5
	10601	P1969F Card Pairing dp greedy hashing implementation *3000	0 / 0	10
	10600	P1970A1 Balanced Shuffle (Easy) implementation sortings *1000	0 / 0	3
	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
	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
	10574	P1971F Circle Perimeter binary search brute force dfs and similar geometry implementation math *1600	0 / 0	5

Pick a problem randomly based on the current filter.