Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	7731	P463E Caisa and Tree brute force dfs and similar math number theory trees *2100	0 / 0	7
	7730	P464A No to Palindromes! greedy strings *1700	0 / 0	5
	7729	P464B Restore Cube brute force geometry *2000	0 / 0	7
	7728	P464C Substitutes in Number dp *2100	0 / 0	7
	7727	P464D World of Darkraft - 2 dp probabilities *2700	0 / 0	10
	7726	P464E The Classic Problem data structures graphs shortest paths *3000	0 / 0	10
	7725	P465A inc ARG implementation *900	0 / 0	3
	7724	P465B Inbox (100500) implementation *1000	0 / 0	3
	7723	P466A Cheap Travel implementation *1200	0 / 0	4
	7722	P466B Wonder Room brute force math *2000	0 / 0	7
	7721	P466C Number of Ways binary search brute force data structures dp two pointers *1700	0 / 0	5
	7720	P466D Increase Sequence combinatorics dp *2100	0 / 0	7
	7719	P466E Information Graph dfs and similar dsu graphs trees *2100	0 / 0	7
	7718	P467A George and Accommodation implementation *800	0 / 0	3
	7717	P467B Fedor and New Game bitmasks brute force constructive algorithms implementation *1100	0 / 0	3
	7716	P467C George and Job dp implementation *1700	0 / 0	5
	7715	P467D Fedor and Essay dfs and similar dp graphs hashing strings *2400	0 / 0	9
	7714	P467E Alex and Complicated Task data structures dp greedy *2300	0 / 0	8
	7713	P468A 24 Game constructive algorithms greedy math *1500	0 / 0	5
	7712	P468B Two Sets 2-sat dfs and similar dsu graph matchings greedy *2000	0 / 0	7
	7711	P468C Hack it! binary search constructive algorithms math *2500	0 / 0	9
	7710	P468D Tree graph matchings *3100	0 / 0	10
	7709	P468E Permanent dp graph matchings math meet-in-the-middle *3100	0 / 0	10
	7708	P469A I Wanna Be the Guy greedy implementation *800	0 / 0	3
	7707	P469B Chat Online implementation *1300	0 / 0	4
	7706	P470A Crystal Ball Sequence special problem implementation 1400	0 / 0	4
	7705	P470B Hexakosioihexekontahexaphobia special problem 1800	0 / 0	6
	7704	P470C Eval special problem 1900	0 / 0	6
	7703	P470D Caesar Cipher special problem 1900	0 / 0	6
	7702	P470E Chessboard special problem 1900	0 / 0	6
	7701	P470F Pairwise Sums special problem 2300	0 / 0	8
	7700	P470G Hamming Distance special problem 2300	0 / 0	8
	7699	P470H Array Sorting special problem 2300	0 / 0	8
	7698	P471A MUH and Sticks implementation *1100	0 / 0	3
	7697	P471B MUH and Important Things implementation sortings *1300	0 / 0	4
	7696	P471C MUH and House of Cards binary search brute force greedy math *1700	0 / 0	5
	7695	P471D MUH and Cube Walls string suffix structures strings *1800	0 / 0	6
	7694	P471E MUH and Lots and Lots of Segments data structures dsu *2700	0 / 0	10
	7693	P472A Design Tutorial: Learn from Math math number theory *800	0 / 0	3
	7692	P472B Design Tutorial: Learn from Life *1300	0 / 0	4
	7691	P472C Design Tutorial: Make It Nondeterministic greedy *1400	0 / 0	4
	7690	P472D Design Tutorial: Inverse the Problem dfs and similar dsu shortest paths trees *1900	1 / 1	6
	7689	P472E Design Tutorial: Learn from a Game constructive algorithms implementation *2800	0 / 0	10
	7688	P472F Design Tutorial: Change the Goal constructive algorithms math matrices *2700	0 / 0	10
	7687	P472G Design Tutorial: Increase the Constraints bitmasks data structures fft *2800	0 / 0	10
	7686	P474A Keyboard implementation *900	0 / 0	3
	7685	P474B Worms binary search implementation *1200	0 / 0	4
	7684	P474C Captain Marmot brute force geometry *2000	0 / 0	7
	7683	P474D Flowers dp *1700	0 / 0	5
	7682	P474E Pillars binary search data structures dp sortings trees *2000	0 / 0	7
	7681	P474F Ant colony data structures math number theory *2100	0 / 0	7
	7680	P475A Bayan Bus implementation *1100	1 / 3	3
	7679	P475B Strongly Connected City brute force dfs and similar graphs implementation *1400	0 / 0	4
	7678	P475C Kamal-ol-molk's Painting brute force constructive algorithms greedy *2100	0 / 0	7
	7677	P475D CGCDSSQ brute force data structures math *2000	1 / 1	7
	7676	P475E Strongly Connected City 2 dfs and similar *2700	0 / 0	10
	7675	P475F Meta-universe data structures *2900	0 / 0	10
	7674	P476A Dreamoon and Stairs implementation math *1000	0 / 0	3
	7673	P476B Dreamoon and WiFi bitmasks brute force combinatorics dp math probabilities *1300	0 / 0	4
	7672	P476C Dreamoon and Sums math *1600	0 / 0	5
	7671	P476D Dreamoon and Sets constructive algorithms greedy math *1900	0 / 0	6
	7670	P476E Dreamoon and Strings dp strings *2200	0 / 0	8
	7669	P477D Dreamoon and Binary dp strings *2700	0 / 0	10
	7668	P477E Dreamoon and Notepad data structures *3100	0 / 0	10
	7667	P478A Initial Bet implementation *1100	0 / 0	3
	7666	P478B Random Teams combinatorics constructive algorithms greedy math *1300	0 / 0	4
	7665	P478C Table Decorations greedy *1800	0 / 0	6
	7664	P478D Red-Green Towers dp *2000	0 / 0	7
	7663	P478E Wavy numbers brute force dfs and similar meet-in-the-middle sortings *2900	0 / 0	10
	7662	P479A Expression brute force math *1000	0 / 0	3
	7661	P479B Towers brute force constructive algorithms greedy implementation sortings *1400	0 / 0	4
	7660	P479C Exams greedy sortings *1400	0 / 0	4
	7659	P479D Long Jumps binary search greedy implementation *1700	0 / 0	5
	7658	P479E Riding in a Lift combinatorics dp *1900	0 / 0	6
	7657	P480D Parcels dp graphs *2600	0 / 0	10
	7656	P480E Parking Lot data structures divide and conquer *2800	0 / 0	10
	7655	P482A Diverse Permutation constructive algorithms greedy *1200	0 / 0	4
	7654	P482B Interesting Array constructive algorithms data structures trees *1800	0 / 0	6
	7653	P482C Game with Strings bitmasks dp probabilities *2600	0 / 0	10
	7652	P482D Random Function and Tree combinatorics dp trees *2700	0 / 0	10
	7651	P482E ELCA data structures trees *3200	0 / 0	10
	7650	P483A Counterexample brute force implementation math number theory *1100	0 / 0	3
	7649	P483B Friends and Presents binary search math *1800	0 / 0	6
	7648	P484A Bits bitmasks constructive algorithms *1700	0 / 0	5
	7647	P484B Maximum Value binary search math sortings two pointers *2100	0 / 0	7
	7646	P484C Strange Sorting implementation math *2600	0 / 0	10
	7645	P484D Kindergarten data structures dp greedy *2400	0 / 0	9
	7644	P484E Sign on Fence binary search constructive algorithms data structures *2500	0 / 0	9
	7643	P485A Factory implementation math matrices *1400	0 / 0	4
	7642	P485B Valuable Resources brute force greedy *1300	0 / 0	4
	7641	P486A Calculating Function implementation math *800	0 / 0	3
	7640	P486B OR in Matrix greedy hashing implementation *1300	0 / 0	4
	7639	P486C Palindrome Transformation brute force greedy implementation *1700	0 / 0	5
	7638	P486D Valid Sets dfs and similar dp math trees *2100	0 / 0	7
	7637	P486E LIS of Sequence data structures dp greedy hashing math *2200	0 / 0	8
	7636	P487A Fight the Monster binary search brute force implementation *1800	0 / 0	6
	7635	P487B Strip binary search data structures dp two pointers *2000	0 / 0	7
	7634	P487C Prefix Product Sequence constructive algorithms math number theory *2300	0 / 0	8
	7633	P487D Conveyor Belts data structures *2700	0 / 0	10
	7632	P487E Tourists data structures dfs and similar graphs trees *3200	1 / 1	10

Pick a problem randomly based on the current filter.