Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1063	P1690F Shifting String graphs math number theory strings *1700	0 / 0	5
	1062	P1690G Count the Trains binary search data structures greedy sortings *2000	0 / 0	7
	1061	P1691A Beat The Odds brute force greedy math *800	0 / 0	3
	1060	P1691B Shoe Shuffling constructive algorithms greedy implementation two pointers *1000	0 / 0	3
	1059	P1691C Sum of Substrings brute force constructive algorithms greedy math strings *1400	0 / 0	4
	1058	P1691D Max GEQ Sum binary search constructive algorithms data structures divide and conquer implementation two pointers *1800	0 / 0	6
	1057	P1691E Number of Groups data structures dfs and similar dsu graphs greedy sortings *2300	0 / 0	8
	1056	P1691F K-Set Tree combinatorics dfs and similar dp math trees *2500	0 / 0	9
	1055	P1692A Marathon implementation *800	0 / 0	3
	1054	P1692B All Distinct greedy sortings *800	0 / 0	3
	1053	P1692C Where's the Bishop? implementation *800	0 / 0	3
	1052	P1692D The Clock brute force implementation *1100	0 / 0	3
	1051	P1692E Binary Deque binary search implementation two pointers *1200	0 / 0	4
	1050	P1692F 3SUM brute force math *1300	0 / 0	4
	1049	P1692G 2^Sort data structures dp sortings two pointers *1400	0 / 0	4
	1048	P1692H Gambling data structures dp greedy math *1700	0 / 0	5
	1047	P1693A Directional Increase greedy *1300	0 / 0	4
	1046	P1693B Fake Plastic Trees dfs and similar dp greedy trees *1700	0 / 0	5
	1045	P1693C Keshi in Search of AmShZ graphs greedy shortest paths *2300	0 / 0	8
	1044	P1693D Decinc Dividing brute force data structures divide and conquer dp greedy *2800	0 / 0	10
	1043	P1693E Outermost Maximums data structures greedy *3400	0 / 0	10
	1042	P1693F I Might Be Wrong binary search greedy two pointers *3400	0 / 0	10
	1041	P1694A Creep greedy implementation *800	0 / 0	3
	1039	P1694B Paranoid String constructive algorithms greedy *1200	0 / 0	4
	1037	P1695A Subrectangle Guess games *800	0 / 0	3
	1035	P1695B Circle Game games greedy *1000	0 / 0	3
	1033	P1695C Zero Path brute force data structures dp graphs greedy shortest paths *1700	0 / 0	5
	1032	P1695D1 Tree Queries (Easy Version) brute force constructive algorithms dfs and similar dp greedy trees *2200	0 / 0	8
	1030	P1695D2 Tree Queries (Hard Version) constructive algorithms dfs and similar dp greedy trees *2300	0 / 0	8
	1029	P1695E Ambiguous Dominoes constructive algorithms dfs and similar graphs *2700	0 / 0	10
	1028	P1696A NIT orz! bitmasks greedy *800	0 / 0	3
	1027	P1696B NIT Destroys the Universe greedy *900	0 / 0	3
	1026	P1696C Fishingprince Plays With Array constructive algorithms greedy implementation math *1400	0 / 0	4
	1023	P1696D Permutation Graph binary search constructive algorithms data structures divide and conquer greedy shortest paths *1900	0 / 0	6
	1021	P1696E Placing Jinas combinatorics math *2000	0 / 0	7
	1019	P1696F Tree Recovery brute force constructive algorithms dfs and similar dsu graphs trees *2600	0 / 0	10
	1017	P1696G Fishingprince Plays With Array Again brute force data structures geometry math *3300	0 / 0	10
	1016	P1696H Maximum Product? brute force combinatorics dp greedy implementation math two pointers *3500	0 / 0	10
	1013	P1697A Parkway Walk greedy implementation *800	0 / 0	3
	1011	P1697B Promo greedy sortings *900	0 / 0	3
	1010	P1697C awoo's Favorite Problem binary search constructive algorithms data structures greedy implementation strings two pointers *1400	0 / 0	4
	1007	P1697D Guess The String binary search constructive algorithms interactive *1900	0 / 0	6
	1005	P1697E Coloring brute force combinatorics constructive algorithms dp geometry graphs greedy implementation math *2400	0 / 0	9
	1003	P1697F Too Many Constraints 2-sat constructive algorithms graphs implementation *2800	0 / 0	10
	1001	P1698A XOR Mixup bitmasks brute force *800	0 / 0	3
	999	P1698B Rising Sand constructive algorithms greedy implementation *800	0 / 0	3
	998	P1698C 3SUM Closure brute force data structures *1300	0 / 0	4
	996	P1698D Fixed Point Guessing binary search constructive algorithms interactive *1600	0 / 0	5
	993	P1698E PermutationForces II brute force combinatorics greedy sortings trees two pointers *2300	0 / 0	8
	991	P1698F Equal Reversal constructive algorithms graphs implementation math *2800	0 / 0	10
	990	P1698G Long Binary String bitmasks math matrices meet-in-the-middle number theory *2900	0 / 0	10
	988	P1699A The Third Three Number Problem constructive algorithms math *800	0 / 0	3
	985	P1699B Almost Ternary Matrix bitmasks constructive algorithms matrices *900	0 / 0	3
	984	P1699C The Third Problem combinatorics constructive algorithms math *1700	0 / 0	5
	983	P1699D Almost Triple Deletions data structures dp greedy *2300	0 / 0	8
	982	P1699E Three Days Grace data structures dp greedy math number theory two pointers *2600	0 / 0	10
	981	P1700A Optimal Path constructive algorithms greedy math *800	0 / 0	3
	980	P1700B Palindromic Numbers constructive algorithms implementation math *1100	0 / 0	3
	979	P1700C Helping the Nature constructive algorithms data structures greedy *1700	0 / 0	5
	978	P1700D River Locks binary search dp greedy math *1900	0 / 0	6
	977	P1700E Serega the Pirate brute force constructive algorithms *2600	0 / 0	10
	976	P1700F Puzzle constructive algorithms dp greedy *2600	0 / 0	10
	975	P1701A Grass Field implementation *800	0 / 0	3
	974	P1701B Permutation greedy *800	0 / 0	3
	973	P1701C Schedule Management binary search greedy implementation two pointers *1400	0 / 0	4
	972	P1701D Permutation Restoration binary search data structures greedy math sortings two pointers *1900	0 / 0	6
	971	P1701E Text Editor brute force dp greedy strings *2500	0 / 0	9
	970	P1701F Points combinatorics data structures implementation math matrices *2500	0 / 0	9
	969	P1702A Round Down the Price constructive algorithms *800	0 / 0	3
	968	P1702B Polycarp Writes a String from Memory greedy *800	0 / 0	3
	967	P1702C Train and Queries data structures greedy *1100	0 / 0	3
	966	P1702D Not a Cheap String greedy *1000	0 / 0	3
	965	P1702E Split Into Two Sets dfs and similar dsu graphs *1600	0 / 0	5
	964	P1702F Equate Multisets constructive algorithms data structures greedy math number theory *1700	0 / 0	5
	963	P1702G1 Passable Paths (easy version) dfs and similar trees *1900	0 / 0	6
	962	P1702G2 Passable Paths (hard version) data structures dfs and similar trees *2000	0 / 0	7
	961	P1703A YES or YES? brute force implementation strings *800	0 / 0	3
	960	P1703B ICPC Balloons data structures implementation *800	0 / 0	3
	959	P1703C Cypher brute force implementation strings *800	0 / 0	3
	958	P1703D Double Strings brute force data structures strings *1100	0 / 0	3
	957	P1703E Mirror Grid implementation *1200	0 / 0	4
	956	P1703F Yet Another Problem About Pairs Satisfying an Inequality binary search data structures dp greedy sortings *1300	0 / 0	4
	955	P1703G Good Key, Bad Key bitmasks brute force dp greedy math *1600	0 / 0	5
	954	P1704A Two 0-1 Sequences constructive algorithms greedy *800	0 / 0	3
	953	P1704B Luke is a Foodie brute force greedy implementation *1000	0 / 0	3
	952	P1704C Virus greedy implementation sortings *1200	0 / 0	4
	951	P1704D Magical Array constructive algorithms hashing implementation math *1900	0 / 0	6
	950	P1704E Count Seconds brute force constructive algorithms dp graphs implementation math *2200	0 / 0	8
	949	P1704F Colouring Game constructive algorithms dp games *2600	0 / 0	10
	948	P1704G Mio and Lucky Array constructive algorithms fft math strings *3500	0 / 0	10
	947	P1704H1 Game of AI (easy version) combinatorics constructive algorithms dp fft math *3200	0 / 0	10
	946	P1704H2 Game of AI (hard version) combinatorics fft math *3500	0 / 0	10
	945	P1705A Mark the Photographer greedy sortings *800	0 / 0	3
	944	P1705B Mark the Dust Sweeper constructive algorithms greedy implementation *900	0 / 0	3
	943	P1705C Mark and His Unfinished Essay brute force implementation *1400	0 / 0	4
	942	P1705D Mark and Lightbulbs combinatorics constructive algorithms greedy math sortings *1800	0 / 0	6
	941	P1705E Mark and Professor Koro binary search bitmasks brute force combinatorics data structures greedy *2300	0 / 0	8
	940	P1705F Mark and the Online Exam bitmasks constructive algorithms interactive probabilities *2900	0 / 0	10
	939	P1706A Another String Minimization Problem 2-sat constructive algorithms greedy string suffix structures strings *800	0 / 0	3
	938	P1706B Making Towers dp greedy math *1100	0 / 0	3

Pick a problem randomly based on the current filter.