Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	251	P1792E Divisors and Table brute force dfs and similar dp number theory *2400	0 / 0	9
	249	P1792F1 Graph Coloring (easy version) combinatorics dp graphs *2700	0 / 0	10
	247	P1792F2 Graph Coloring (hard version) brute force combinatorics divide and conquer dp fft graphs *2900	0 / 0	10
	248	P1793A Yet Another Promotion greedy math *800	0 / 0	3
	245	P1793B Fedya and Array constructive algorithms math *1100	0 / 0	3
	244	P1793C Dora and Search constructive algorithms data structures two pointers *1200	0 / 0	4
	242	P1793D Moscow Gorillas binary search dp greedy implementation math two pointers *1800	0 / 0	6
	241	P1793E Velepin and Marketing binary search data structures dp greedy sortings two pointers *2600	0 / 0	10
	239	P1793F Rebrending brute force data structures divide and conquer implementation *2600	0 / 0	10
	237	P1794A Prefix and Suffix Array strings *800	0 / 0	3
	236	P1794B Not Dividing constructive algorithms greedy math *900	0 / 0	3
	234	P1794C Scoring Subsequences binary search greedy math two pointers *1300	0 / 0	4
	233	P1794D Counting Factorizations combinatorics divide and conquer dp math number theory *1900	0 / 0	6
	231	P1794E Labeling the Tree with Distances data structures dp greedy hashing implementation trees *2400	0 / 0	9
	230	P1795A Two Towers brute force implementation strings *800	1 / 1	3
	229	P1795B Ideal Point brute force geometry greedy *900	1 / 1	3
	227	P1795C Tea Tasting binary search data structures implementation *1500	0 / 0	5
	225	P1795D Triangle Coloring combinatorics math *1600	1 / 1	5
	224	P1795E Explosions? binary search data structures dp greedy math *2200	0 / 0	8
	222	P1795F Blocking Chips binary search constructive algorithms dfs and similar greedy trees *2400	0 / 0	9
	221	P1795G Removal Sequences bitmasks dfs and similar graphs *2700	0 / 0	10
	219	P1796A Typical Interview Problem brute force implementation strings *800	0 / 13	3
	218	P1796B Asterisk-Minor Template implementation strings *1000	0 / 0	3
	216	P1796C Maximum Set binary search math *1600	0 / 1	5
	215	P1796D Maximum Subarray data structures dp greedy two pointers *2000	0 / 0	7
	213	P1796E Colored Subgraphs dfs and similar dp games greedy trees *2500	0 / 0	9
	212	P1796F Strange Triples brute force math number theory *2900	0 / 0	10
	211	P1797A Li Hua and Maze constructive algorithms flows graphs greedy implementation *800	0 / 0	3
	209	P1797B Li Hua and Pattern constructive algorithms greedy *1100	0 / 0	3
	207	P1797C Li Hua and Chess constructive algorithms greedy interactive *1600	0 / 0	5
	206	P1797D Li Hua and Tree brute force data structures dfs and similar dp implementation trees *1900	0 / 0	6
	204	P1797E Li Hua and Array brute force data structures dsu math number theory two pointers *2300	0 / 0	8
	203	P1797F Li Hua and Path data structures dfs and similar divide and conquer dsu trees *3000	0 / 0	10
	201	P1798A Showstopper greedy implementation sortings *800	1 / 1	3
	199	P1798B Three Sevens brute force data structures greedy implementation *1000	0 / 0	3
	198	P1798C Candy Store greedy math number theory *1700	1 / 1	5
	196	P1798D Shocking Arrangement constructive algorithms greedy math *1600	0 / 0	5
	195	P1798E Multitest Generator brute force dp *2300	0 / 0	8
	193	P1798F Gifts from Grandfather Ahmed dp math number theory *2500	0 / 0	9
	192	P1799A Recent Actions data structures greedy implementation math *800	0 / 0	3
	190	P1799B Equalize by Divide brute force constructive algorithms greedy math *1200	0 / 0	4
	189	P1799C Double Lexicographically Minimum greedy strings *1700	0 / 0	5
	187	P1799D1 Hot Start Up (easy version) dp *1900	0 / 0	6
	186	P1799D2 Hot Start Up (hard version) data structures dp *2100	0 / 0	7
	184	P1799E City Union constructive algorithms dfs and similar dsu geometry greedy implementation math *2300	0 / 0	8
	183	P1799F Halve or Subtract binary search brute force dp greedy sortings *2700	0 / 0	10
	181	P1799G Count Voting combinatorics dp math *2600	0 / 0	10
	180	P1799H Tree Cutting bitmasks dfs and similar dp *3200	0 / 0	10
	179	P1800A Is It a Cat? implementation strings *800	0 / 0	3
	177	P1800B Count the Number of Pairs greedy strings *1000	0 / 0	3
	175	P1800C1 Powering the Hero (easy version) data structures greedy *1000	0 / 0	3
	174	P1800C2 Powering the Hero (hard version) data structures greedy *1100	0 / 0	3
	172	P1800D Remove Two Letters data structures greedy hashing strings *1200	0 / 0	4
	171	P1800E1 Unforgivable Curse (easy version) brute force constructive algorithms dsu graphs greedy strings *1400	0 / 0	4
	169	P1800E2 Unforgivable Curse (hard version) brute force constructive algorithms dfs and similar dsu graphs greedy strings *1500	0 / 0	5
	168	P1800F Dasha and Nightmares bitmasks hashing meet-in-the-middle strings *1900	0 / 0	6
	166	P1800G Symmetree dfs and similar hashing implementation trees *2200	0 / 0	8
	165	P1801A The Very Beautiful Blanket bitmasks constructive algorithms *1600	0 / 0	5
	163	P1801B Buying gifts data structures greedy sortings *1800	0 / 0	6
	162	P1801C Music Festival binary search data structures dp greedy sortings *1900	0 / 0	6
	160	P1801D The way home binary search data structures dp graphs greedy shortest paths sortings *2100	0 / 0	7
	159	P1801E Gasoline prices data structures divide and conquer dsu hashing trees *3000	0 / 0	10
	157	P1801F Another n-dimensional chocolate bar dp math meet-in-the-middle number theory *2700	0 / 0	10
	155	P1801G A task for substrings data structures string suffix structures strings *3400	0 / 0	10
	154	P1802A Likes greedy implementation *800	1 / 1	3
	152	P1802B Settlement of Guinea Pigs greedy implementation math *1000	1 / 1	3
	151	P1804A Lame King greedy math *800	0 / 0	3
	149	P1804B Vaccination greedy implementation *1000	0 / 0	3
	148	P1804C Pull Your Luck brute force greedy math number theory *1500	0 / 0	5
	147	P1804D Accommodation brute force dp greedy implementation *2000	0 / 0	7
	145	P1804E Routing bitmasks brute force dfs and similar dp graphs *2400	0 / 0	9
	144	P1804F Approximate Diameter binary search divide and conquer graphs shortest paths *2700	0 / 0	10
	143	P1804G Flow Control data structures dsu implementation *3500	0 / 0	10
	142	P1804H Code Lock bitmasks dp *3300	0 / 0	10
	141	P1805A We Need the Zero bitmasks brute force *800	0 / 0	3
	140	P1805B The String Has a Target greedy strings *800	0 / 0	3
	139	P1805C Place for a Selfie binary search data structures geometry math *1400	0 / 0	4
	138	P1805D A Wide, Wide Graph dfs and similar dp graphs greedy trees *1800	0 / 0	6
	137	P1805E There Should Be a Lot of Maximums brute force data structures dfs and similar dp trees two pointers *2300	0 / 0	8
	136	P1805F1 Survival of the Weakest (easy version) binary search brute force implementation math sortings *2600	0 / 0	10
	135	P1805F2 Survival of the Weakest (hard version) greedy math sortings two pointers *3100	0 / 0	10
	134	P1806A Walking Master geometry greedy math *800	2 / 2	3
	133	P1806B Mex Master constructive algorithms greedy *900	2 / 2	3
	131	P1806C Sequence Master brute force constructive algorithms math *1600	1 / 1	5
	130	P1806D DSU Master combinatorics dp dsu math *2500	0 / 0	9
	128	P1806E Tree Master brute force data structures dfs and similar trees *2200	0 / 0	8
	127	P1806F1 GCD Master (easy version) greedy math number theory sortings *2900	0 / 0	10
	125	P1806F2 GCD Master (hard version) greedy math sortings *2900	0 / 0	10
	124	P1807A Plus or Minus implementation *800	0 / 0	3
	123	P1807B Grab the Candies greedy *800	0 / 0	3
	121	P1807C Find and Replace greedy implementation strings *800	0 / 0	3
	120	P1807D Odd Queries data structures implementation *900	0 / 0	3
	118	P1807E Interview binary search implementation interactive *1300	0 / 0	4
	116	P1807F Bouncy Ball brute force dfs and similar implementation *1700	0 / 0	5
	114	P1807G1 Subsequence Addition (Easy Version) brute force data structures dp greedy implementation sortings *1100	0 / 0	3
	112	P1807G2 Subsequence Addition (Hard Version) bitmasks dp greedy implementation sortings *1100	0 / 0	3
	111	P1808A Lucky Numbers brute force implementation *900	0 / 0	3
	110	P1808B Playing in a Casino math sortings *1200	0 / 0	4
	108	P1808C Unlucky Numbers brute force dp greedy implementation *1900	0 / 0	6
	106	P1808D Petya, Petya, Petr, and Palindromes binary search brute force data structures two pointers *2100	0 / 0	7

Pick a problem randomly based on the current filter.