Problem Set - *2700 - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2090	codeforces#P1521E Nastia and a Beautiful Matrix binary search constructive algorithms dp greedy *2700	0 / 0	10
	1987	codeforces#P1540C1 Converging Array (Easy Version) dp math *2700	0 / 0	10
	1976	codeforces#P1542E2 Abnormal Permutation Pairs (hard version) combinatorics dp fft math *2700	0 / 0	10
	1970	codeforces#P1543E The Final Pursuit bitmasks constructive algorithms divide and conquer graphs greedy math *2700	0 / 0	10
	1940	codeforces#P1550F Jumping Around binary search data structures divide and conquer dp dsu graphs shortest paths *2700	0 / 0	10
	1916	codeforces#P1553G Common Divisor Graph brute force constructive algorithms dsu graphs hashing math number theory *2700	0 / 0	10
	1903	codeforces#P1555F Good Graph data structures dsu graphs trees *2700	0 / 0	10
	1846	codeforces#P1567F One-Four Overload 2-sat constructive algorithms dfs and similar dsu graphs implementation *2700	0 / 0	10
	1827	codeforces#P1572C Paint dp greedy *2700	0 / 0	10
	1816	codeforces#P1574F Occurrences combinatorics dfs and similar dp dsu fft graphs *2700	0 / 0	10
	1789	codeforces#P1578M The Mind constructive algorithms interactive probabilities *2700	0 / 0	10
	1706	codeforces#P1599F Mars hashing *2700	0 / 0	10
	1705	codeforces#P1599G Shortest path brute force geometry math shortest paths *2700	0 / 0	10
	1703	codeforces#P1599I Desert data structures graphs *2700	0 / 0	10
	1695	codeforces#P1601D Difficult Mountain data structures dp greedy sortings *2700	0 / 0	10
	1685	codeforces#P1603F October 18, 2017 combinatorics dp implementation math *2700	0 / 0	10
	1590	codeforces#P1617E Christmas Chocolates dfs and similar dp games graphs implementation math number theory shortest paths trees *2700	0 / 0	10
	1562	codeforces#P1621F Strange Instructions data structures greedy implementation *2700	0 / 0	10
	1523	codeforces#P1627F Not Splitting geometry graphs greedy implementation shortest paths *2700	0 / 0	10
	1500	codeforces#P1632E2 Distance Tree (hard version) binary search dfs and similar shortest paths trees *2700	0 / 0	10
	1488	codeforces#P1634F Fibonacci Additions brute force data structures hashing implementation math *2700	0 / 0	10
	1453	codeforces#P1641D Two Arrays bitmasks brute force combinatorics greedy hashing math two pointers *2700	0 / 0	10
	1380	codeforces#P1658F Juju and Binary String brute force constructive algorithms greedy math *2700	0 / 0	10
	1293	codeforces#P1671F Permutation Counting brute force combinatorics dp fft math *2700	0 / 0	10
	1284	codeforces#P1672H Zigu Zagu constructive algorithms data structures greedy *2700	0 / 0	10
	1222	codeforces#P1682E Unordered Swaps constructive algorithms dfs and similar graphs greedy math sortings trees *2700	0 / 0	10
	1221	codeforces#P1682F MCMF? data structures flows graphs greedy sortings two pointers *2700	0 / 0	10
	1156	codeforces#P1695E Ambiguous Dominoes constructive algorithms dfs and similar graphs *2700	0 / 0	10
	1035	codeforces#P1715F Crop Squares constructive algorithms geometry interactive math *2700	0 / 0	10
	1007	codeforces#P1720E Misha and Paintings constructive algorithms data structures greedy implementation math *2700	0 / 0	10
	966	codeforces#P1728G Illumination binary search bitmasks brute force combinatorics dp math two pointers *2700	0 / 0	10
	954	codeforces#P1730E Maximums and Minimums combinatorics data structures divide and conquer number theory *2700	0 / 0	10
	953	codeforces#P1730F Almost Sorted bitmasks data structures dp *2700	0 / 0	10
	934	codeforces#P1733E Conveyor constructive algorithms dp math *2700	0 / 0	10
	827	codeforces#P1750F Majority combinatorics dp math strings *2700	0 / 0	10
	700	codeforces#P1774F2 Magician and Pigs (Hard Version) binary search brute force data structures implementation *2700	0 / 0	10
	645	codeforces#P1781F Bracket Insertion combinatorics dp math trees *2700	0 / 0	10
	605	codeforces#P1789F Serval and Brain Power bitmasks brute force dp greedy implementation strings *2700	0 / 0	10
	584	codeforces#P1792F1 Graph Coloring (easy version) combinatorics dp graphs *2700	0 / 0	10
	565	codeforces#P1795G Removal Sequences bitmasks dfs and similar graphs *2700	0 / 0	10
	540	codeforces#P1799F Halve or Subtract binary search brute force dp greedy sortings *2700	0 / 0	10
	523	codeforces#P1801F Another n-dimensional chocolate bar dp math meet-in-the-middle number theory *2700	0 / 0	10
	514	codeforces#P1804F Approximate Diameter binary search divide and conquer graphs shortest paths *2700	0 / 0	10
	444	codeforces#P1814F Communication Towers brute force divide and conquer dsu *2700	0 / 0	10
	432	codeforces#P1817D Toy Machine constructive algorithms games implementation *2700	0 / 0	10
	302	codeforces#P1841F Monocarp and a Strategic Game geometry sortings two pointers *2700	0 / 0	10
	245	codeforces#P1849F XOR Partition binary search bitmasks data structures divide and conquer greedy trees *2700	0 / 0	10
	207	codeforces#P1856E2 PermuTree (hard version) bitmasks dfs and similar dp fft greedy implementation math trees *2700	0 / 0	10
	146	codeforces#P1866E Elevators of Tamem dp *2700	0 / 0	10
	131	codeforces#P1867F Most Different Tree brute force constructive algorithms dfs and similar greedy hashing *2700	0 / 0	10
	32	codeforces#P1887D Split binary search data structures divide and conquer dsu math trees two pointers *2700	0 / 0	10
	6681	codeforces#P1910G Pool Records special problem greedy 2700	0 / 0	10
	6679	codeforces#P1910I Inverse Problem special problem combinatorics dp 2700	0 / 0	10
	6636	codeforces#P1916H1 Matrix Rank (Easy Version) brute force combinatorics dp math matrices *2700	0 / 0	10
	6635	codeforces#P1916H2 Matrix Rank (Hard Version) combinatorics dp math matrices string suffix structures *2700	0 / 0	10
	8201	codeforces#P1918G Permutation of Given constructive algorithms math *2700	0 / 0	10
	8177	codeforces#P1924D Balanced Subsequences combinatorics dp math *2700	0 / 0	10
	9388	codeforces#P1957F2 Frequency Mismatch (Hard Version) binary search data structures dfs and similar hashing probabilities trees *2700	0 / 0	10

Pick a problem randomly based on the current filter.