constructive algorithms - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2220	P1520C Not Adjacent Matrix constructive algorithms *1000	0 / 0	3
	2214	P1520F2 Guess the K-th Zero (Hard version) binary search constructive algorithms data structures interactive *2200	0 / 0	8
	2212	P1521A Nastia and Nearly Good Numbers constructive algorithms math number theory *1000	0 / 0	3
	2211	P1521B Nastia and a Good Array constructive algorithms math number theory *1300	0 / 0	4
	2210	P1521C Nastia and a Hidden Permutation constructive algorithms interactive *2000	0 / 0	7
	2209	P1521D Nastia Plays with a Tree constructive algorithms data structures dfs and similar dp dsu greedy implementation trees *2500	0 / 0	9
	2208	P1521E Nastia and a Beautiful Matrix binary search constructive algorithms dp greedy *2700	0 / 0	10
	2206	P1523B Lord of the Values constructive algorithms *1100	0 / 0	3
	2193	P1525B Permutation Sort constructive algorithms greedy *900	0 / 0	3
	2188	P1526A Mean Inequality constructive algorithms sortings *800	0 / 0	3
	2180	P1526D Kill Anton brute force constructive algorithms data structures math strings *2200	0 / 0	8
	2178	P1526E Oolimry and Suffix Array combinatorics constructive algorithms math *2400	0 / 0	9
	2177	P1526F Median Queries constructive algorithms interactive probabilities *3000	0 / 0	10
	2175	P1527B1 Palindrome Game (easy version) constructive algorithms games *1200	0 / 0	4
	2174	P1527B2 Palindrome Game (hard version) constructive algorithms games *1900	0 / 0	6
	2162	P1528D It's a bird! No, it's a plane! No, it's AaParsa! constructive algorithms graphs shortest paths *2500	0 / 0	9
	2157	P1529A Eshag Loves Big Arrays constructive algorithms greedy math *800	0 / 0	3
	2152	P1530B Putting Plates constructive algorithms implementation *800	0 / 0	3
	2150	P1530D Secret Santa constructive algorithms flows graphs greedy math *1600	0 / 0	5
	2149	P1530E Minimax constructive algorithms greedy strings *2100	0 / 0	7
	2147	P1530G What a Reversal constructive algorithms *3300	0 / 0	10
	2131	P1533G Biome Map *special problem constructive algorithms dfs and similar graphs	0 / 0	(None)
	2128	P1533I Excursions *special problem constructive algorithms dfs and similar flows graph matchings graphs	0 / 0	(None)
	2122	P1534D Lost Tree constructive algorithms interactive trees *1800	0 / 0	6
	2112	P1534H Lost Nodes constructive algorithms dp graphs interactive sortings trees *3500	0 / 0	10
	2102	P1536A Omkar and Bad Story brute force constructive algorithms *800	0 / 0	3
	2100	P1536B Prinzessin der Verurteilung brute force constructive algorithms strings *1200	0 / 0	4
	2096	P1536F Omkar and Akmar chinese remainder theorem combinatorics constructive algorithms fft games geometry math meet-in-the-middle string suffix structures *2600	0 / 0	10
	2093	P1537B Bad Boy constructive algorithms greedy math *900	0 / 0	3
	2092	P1537C Challenging Cliffs constructive algorithms greedy implementation math *1200	0 / 0	4
	2085	P1537F Figure Fixing constructive algorithms dfs and similar dsu graphs greedy math *2200	0 / 0	8
	2081	P1538D Another Problem About Dividing Numbers constructive algorithms math number theory *1700	0 / 0	5
	2073	P1539E Game with Cards binary search constructive algorithms data structures dp greedy implementation *2500	0 / 0	9
	2071	P1540A Great Graphs constructive algorithms graphs greedy shortest paths sortings *1400	0 / 0	4
	2065	P1541A Pretty Permutations constructive algorithms greedy implementation *800	0 / 0	3
	2062	P1542B Plus and Multiply constructive algorithms math number theory *1500	0 / 0	5
	2053	P1543D1 RPD and Rap Sheet (Easy Version) bitmasks constructive algorithms interactive math *1700	0 / 0	5
	2052	P1543D2 RPD and Rap Sheet (Hard Version) brute force constructive algorithms interactive math *2200	0 / 0	8
	2051	P1543E The Final Pursuit bitmasks constructive algorithms divide and conquer graphs greedy math *2700	0 / 0	10
	2048	P1545C AquaMoon and Permutations 2-sat brute force combinatorics constructive algorithms graph matchings graphs *2800	0 / 0	10
	2047	P1545D AquaMoon and Wrong Coordinate constructive algorithms interactive math *3000	0 / 0	10
	2038	P1547D Co-growing Sequence bitmasks constructive algorithms greedy *1300	0 / 0	4
	2013	P1550D Excellent Arrays binary search combinatorics constructive algorithms implementation math sortings two pointers *2300	0 / 0	8
	2002	P1551B2 Wonderful Coloring - 2 binary search constructive algorithms data structures greedy *1400	0 / 0	4
	1999	P1551D1 Domino (easy version) constructive algorithms math *1700	0 / 0	5
	1997	P1551D2 Domino (hard version) constructive algorithms implementation math *2100	0 / 0	7
	1987	P1552C Maximize the Intersections combinatorics constructive algorithms geometry greedy sortings *1800	0 / 0	6
	1984	P1552D Array Differentiation bitmasks brute force constructive algorithms dfs and similar dp graphs math *1800	0 / 0	6
	1983	P1552E Colors and Intervals constructive algorithms data structures greedy sortings *2300	0 / 0	8
	1965	P1553E Permutation Shift brute force combinatorics constructive algorithms dfs and similar dsu graphs math *2100	0 / 0	7
	1962	P1553G Common Divisor Graph brute force constructive algorithms dsu graphs hashing math number theory *2700	0 / 0	10
	1950	P1554D Diane constructive algorithms greedy strings *1800	0 / 0	6
	1946	P1555C Coin Rows brute force constructive algorithms dp implementation *1300	0 / 0	4
	1944	P1555D Say No to Palindromes brute force constructive algorithms dp strings *1600	0 / 0	5
	1938	P1556D Take a Guess bitmasks constructive algorithms interactive math *1800	0 / 0	6
	1928	P1557E Assiut Chess brute force constructive algorithms interactive *2800	0 / 0	10
	1925	P1558C Bottom-Tier Reversals constructive algorithms greedy *2000	0 / 0	7
	1921	P1559A Mocha and Math bitmasks constructive algorithms math *900	0 / 0	3
	1919	P1559C Mocha and Hiking constructive algorithms graphs *1200	0 / 0	4
	1918	P1559D1 Mocha and Diana (Easy Version) brute force constructive algorithms dsu graphs greedy trees *1400	0 / 0	4
	1917	P1559D2 Mocha and Diana (Hard Version) brute force constructive algorithms dfs and similar dsu graphs greedy trees two pointers *2500	0 / 0	9
	1906	P1560F1 Nearest Beautiful Number (easy version) binary search bitmasks brute force constructive algorithms dfs and similar greedy *1900	0 / 0	6
	1905	P1560F2 Nearest Beautiful Number (hard version) bitmasks brute force constructive algorithms dfs and similar dp greedy *2100	0 / 0	7
	1900	P1562B Scenes From a Memory brute force constructive algorithms implementation math number theory *1000	0 / 0	3
	1899	P1562C Rings constructive algorithms math *1500	0 / 0	5
	1893	P1566B MIN-MEX Cut bitmasks constructive algorithms dp greedy *800	0 / 0	3
	1892	P1566C MAX-MEX Cut bitmasks constructive algorithms dp greedy *1000	0 / 0	3
	1889	P1566E Buds Re-hanging constructive algorithms dfs and similar dp greedy trees *2000	0 / 0	7
	1886	P1566G Four Vertices constructive algorithms data structures graphs greedy implementation shortest paths *3100	0 / 0	10
	1883	P1566H Xor-quiz constructive algorithms dp interactive math number theory *3200	0 / 0	10
	1875	P1567D Expression Evaluation Error constructive algorithms greedy implementation math *2000	0 / 0	7
	1871	P1567F One-Four Overload 2-sat constructive algorithms dfs and similar dsu graphs implementation *2700	0 / 0	10
	1868	P1569B Chess Tournament constructive algorithms *1000	0 / 0	3
	1852	P1571D Sweepstake special problem brute force constructive algorithms implementation math 1800	0 / 0	6
	1848	P1571F Kotlinforces special problem constructive algorithms dp 2000	0 / 0	7
	1837	P1572B Xor of 3 brute force constructive algorithms greedy two pointers *2500	0 / 0	9
	1825	P1574A Regular Bracket Sequences constructive algorithms *800	0 / 0	3
	1817	P1574E Coloring combinatorics constructive algorithms implementation math *2500	0 / 0	9
	1794	P1578A Anti-Tetris constructive algorithms graphs shortest paths *2800	0 / 0	10
	1776	P1578M The Mind constructive algorithms interactive probabilities *2700	0 / 0	10
	1770	P1579D Productive Meeting constructive algorithms graphs greedy *1400	0 / 0	4
	1769	P1579E1 Permutation Minimization by Deque constructive algorithms greedy math *1000	0 / 0	3
	1761	P1580E Railway Construction brute force constructive algorithms data structures graphs shortest paths *3400	0 / 0	10
	1758	P1581B Diameter of Graph constructive algorithms graphs greedy math *1200	0 / 0	4
	1754	P1582D Vupsen, Pupsen and 0 constructive algorithms math *1600	0 / 0	5
	1744	P1583B Omkar and Heavenly Tree constructive algorithms trees *1200	0 / 0	4
	1740	P1583D Omkar and the Meaning of Life constructive algorithms greedy interactive *1800	0 / 0	6
	1738	P1583E Moment of Bloom constructive algorithms dfs and similar graph matchings graphs greedy trees *2200	0 / 0	8
	1737	P1583F Defender of Childhood Dreams bitmasks constructive algorithms divide and conquer *2500	0 / 0	9
	1709	P1586I Omkar and Mosaic combinatorics constructive algorithms math *3500	0 / 0	10
	1706	P1592B Hemose Shopping constructive algorithms dsu math sortings *1200	0 / 0	4
	1705	P1592C Bakry and Partitioning bitmasks constructive algorithms dfs and similar dp graphs trees *1700	0 / 0	5
	1701	P1592F1 Alice and Recoloring 1 constructive algorithms greedy *2600	0 / 0	10
	1699	P1592F2 Alice and Recoloring 2 constructive algorithms flows graph matchings greedy *2800	0 / 0	10
	1689	P1593G Changing Brackets constructive algorithms data structures dp greedy *2200	0 / 0	8
	1682	P1594D The Number of Imposters constructive algorithms dfs and similar dp dsu graphs *1700	0 / 0	5
	1678	P1594F Ideal Farm constructive algorithms math *2400	0 / 0	9
	1663	P1599A Weights constructive algorithms greedy two pointers *2600	0 / 0	10
	1633	P1602B Divine Array constructive algorithms implementation *1100	0 / 0	3
	1632	P1603A Di-visible Confusion constructive algorithms math number theory *1300	0 / 0	4

Pick a problem randomly based on the current filter.