Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	553	P1762C Binary Strings are Fun combinatorics math *1400	0 / 0	4
	552	P1762D GCD Queries constructive algorithms interactive number theory *2100	0 / 11	7
	551	P1762E Tree Sum combinatorics math trees *2600	0 / 0	10
	549	P1762F Good Pairs binary search data structures dp *2600	0 / 0	10
	548	P1762G Unequal Adjacent Elements constructive algorithms sortings *3100	0 / 0	10
	545	P1763A Absolute Maximization bitmasks constructive algorithms greedy math *800	0 / 0	3
	544	P1763B Incinerate binary search brute force data structures implementation math sortings *1200	1 / 1	4
	541	P1763C Another Array Problem brute force constructive algorithms greedy *2000	0 / 0	7
	539	P1763D Valid Bitonic Permutations combinatorics dp implementation math number theory *2200	0 / 0	8
	538	P1763E Node Pairs dp graphs math number theory *2200	0 / 0	8
	535	P1763F Edge Queries data structures dfs and similar dp dsu graphs trees *3000	0 / 0	10
	534	P1764A Doremy's Paint greedy *800	0 / 0	3
	532	P1764B Doremy's Perfect Math Class math number theory *900	0 / 0	3
	531	P1764C Doremy's City Construction graphs greedy *1400	0 / 0	4
	529	P1764D Doremy's Pegging Game combinatorics dp math *2000	0 / 0	7
	528	P1764E Doremy's Number Line dp greedy sortings *2400	0 / 0	9
	525	P1764F Doremy's Experimental Tree brute force constructive algorithms dfs and similar dsu sortings trees *2500	0 / 0	9
	524	P1764G1 Doremy's Perfect DS Class (Easy Version) binary search interactive *2900	0 / 0	10
	521	P1764G2 Doremy's Perfect DS Class (Medium Version) binary search interactive *3000	0 / 0	10
	519	P1764G3 Doremy's Perfect DS Class (Hard Version) binary search interactive *3300	0 / 0	10
	518	P1764H Doremy's Paint 2 data structures *3400	0 / 0	10
	515	P1765A Access Levels bitmasks dsu flows graph matchings *2400	0 / 0	9
	513	P1765B Broken Keyboard greedy *800	0 / 0	3
	512	P1765C Card Guessing combinatorics dp probabilities *2600	0 / 0	10
	511	P1765D Watch the Videos binary search constructive algorithms two pointers *1700	0 / 0	5
	509	P1765E Exchange brute force math *1000	0 / 0	3
	507	P1765F Chemistry Lab dp geometry probabilities *2200	0 / 0	8
	505	P1765G Guess the String constructive algorithms interactive probabilities *2600	0 / 0	10
	504	P1765H Hospital Queue binary search graphs greedy implementation *2200	0 / 0	8
	502	P1765I Infinite Chess implementation shortest paths *2800	0 / 0	10
	499	P1765J Hero to Zero graph matchings math *2900	0 / 0	10
	497	P1765K Torus Path greedy math *1500	0 / 0	5
	496	P1765L Project Manager brute force data structures implementation *2400	0 / 0	9
	493	P1765M Minimum LCM math number theory *1000	1 / 1	3
	492	P1765N Number Reduction greedy *1500	0 / 0	5
	489	P1766A Extremely Round brute force implementation *800	1 / 1	3
	488	P1766B Notepad# implementation *1000	1 / 1	3
	486	P1766C Hamiltonian Wall dp implementation *1300	0 / 0	4
	484	P1766D Lucky Chains math number theory *1600	0 / 0	5
	482	P1766E Decomposition binary search brute force data structures divide and conquer dp two pointers *2300	0 / 0	8
	480	P1766F MCF flows *2800	0 / 0	10
	479	P1767A Cut the Triangle implementation *800	0 / 0	3
	478	P1767B Block Towers data structures greedy sortings *800	0 / 0	3
	477	P1767C Count Binary Strings data structures dp *2100	0 / 0	7
	476	P1767D Playoff combinatorics constructive algorithms dp greedy math *1500	0 / 0	5
	475	P1767E Algebra Flash bitmasks brute force dp graphs math meet-in-the-middle trees *2500	0 / 0	9
	474	P1767F Two Subtrees data structures trees *3100	0 / 0	10
	473	P1768A Greatest Convex greedy math number theory *800	0 / 0	3
	472	P1768B Quick Sort greedy math *900	0 / 0	3
	471	P1768C Elemental Decompress constructive algorithms greedy implementation sortings *1300	0 / 0	4
	469	P1768D Lucky Permutation constructive algorithms dfs and similar graphs greedy *1800	0 / 0	6
	468	P1768E Partial Sorting combinatorics math number theory *2300	0 / 0	8
	465	P1768F Wonderful Jump dp greedy *2900	0 / 0	10
	464	P1770A Koxia and Whiteboards brute force greedy *1000	1 / 1	3
	462	P1770B Koxia and Permutation constructive algorithms *1000	1 / 1	3
	459	P1770C Koxia and Number Theory brute force chinese remainder theorem math number theory *1700	1 / 1	5
	458	P1770D Koxia and Game constructive algorithms data structures dfs and similar dsu flows games graph matchings graphs implementation *2000	0 / 0	7
	456	P1770E Koxia and Tree combinatorics dfs and similar dp dsu math probabilities trees *2400	0 / 0	9
	453	P1770F Koxia and Sequence bitmasks combinatorics dp math number theory *3100	0 / 0	10
	451	P1770G Koxia and Bracket divide and conquer fft math *3400	0 / 0	10
	449	P1770H Koxia, Mahiru and Winter Festival constructive algorithms *3500	0 / 0	10
	447	P1771A Hossam and Combinatorics combinatorics math sortings *900	0 / 0	3
	445	P1771B Hossam and Friends binary search constructive algorithms dp two pointers *1400	0 / 0	4
	444	P1771C Hossam and Trainees greedy math number theory *1600	0 / 0	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
	438	P1771F Hossam and Range Minimum Query binary search bitmasks data structures hashing probabilities strings trees *2500	0 / 0	9
	435	P1773A Amazing Trick constructive algorithms graph matchings math probabilities *1900	0 / 0	6
	433	P1773B BinCoin binary search divide and conquer hashing implementation probabilities trees *2200	0 / 0	8
	765	P1773C __NO_TITLE__	0 / 0	(None)
	432	P1773D Dominoes combinatorics flows graph matchings greedy *2600	0 / 0	10
	431	P1773E Easy Assembly greedy sortings *1400	0 / 0	4
	430	P1773F Football constructive algorithms *800	0 / 0	3
	429	P1773G Game of Questions bitmasks combinatorics dp fft math probabilities *2800	0 / 0	10
	428	P1773H Hot and Cold binary search interactive *2600	0 / 0	10
	427	P1773I Interactive Factorial Guessing brute force games implementation interactive *2500	0 / 0	9
	426	P1773J Jumbled Trees constructive algorithms math *2900	0 / 0	10
	425	P1773K __NO_TITLE__	0 / 0	(None)
	423	P1773L Lisa's Sequences dp *3500	0 / 0	10
	421	P1774A Add Plus Minus Sign constructive algorithms math *800	0 / 0	3
	419	P1774B Coloring constructive algorithms greedy math *1500	0 / 0	5
	418	P1774C Ice and Fire constructive algorithms dp greedy *1300	0 / 0	4
	416	P1774D Same Count One brute force constructive algorithms greedy implementation two pointers *1600	0 / 0	5
	413	P1774E Two Chess Pieces dfs and similar dp greedy trees *1900	0 / 0	6
	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
	406	P1774H Maximum Permutation constructive algorithms *3500	0 / 0	10
	405	P1775A1 Gardener and the Capybaras (easy version) brute force constructive algorithms implementation *800	1 / 2	3
	404	P1775A2 Gardener and the Capybaras (hard version) constructive algorithms greedy *900	0 / 0	3
	403	P1775B Gardener and the Array bitmasks constructive algorithms *1300	0 / 0	4
	402	P1775C Interesting Sequence bitmasks math *1600	0 / 0	5
	401	P1775D Friendly Spiders dfs and similar graphs math number theory shortest paths *1800	0 / 0	6
	400	P1775E The Human Equation greedy implementation *2100	0 / 0	7
	397	P1775F Laboratory on Pluto constructive algorithms dp greedy math *2500	0 / 0	9
	396	P1776A Walking Boy greedy *800	0 / 0	3
	393	P1776B Vittorio Plays with LEGO Bricks dp geometry *2200	0 / 0	8
	392	P1776C Library game games greedy interactive sortings *2500	0 / 0	9
	391	P1776D Teamwork constructive algorithms greedy math *2800	0 / 0	10
	390	P1776E Crossing the Railways data structures dp *3500	0 / 0	10

Pick a problem randomly based on the current filter.