Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1956	codeforces#P1547E Air Conditioners data structures dp implementation shortest paths sortings two pointers *1500	0 / 0	5
	1955	codeforces#P1547F Array Stabilization (GCD version) binary search brute force data structures divide and conquer number theory two pointers *1900	0 / 0	6
	1954	codeforces#P1547G How Many Paths? dfs and similar dp graphs trees *2100	0 / 0	7
	1953	codeforces#P1548A Web of Lies brute force graphs greedy *1400	0 / 0	4
	1952	codeforces#P1548B Integers Have Friends binary search data structures divide and conquer math number theory two pointers *1800	0 / 0	6
	1951	codeforces#P1548C The Three Little Pigs combinatorics dp fft math *2500	0 / 0	9
	1950	codeforces#P1548D1 Gregor and the Odd Cows (Easy) bitmasks geometry math number theory *2300	0 / 0	8
	1949	codeforces#P1548D2 Gregor and the Odd Cows (Hard) brute force geometry math number theory *3300	0 / 0	10
	1948	codeforces#P1548E Gregor and the Two Painters data structures divide and conquer graphs greedy math *3400	0 / 0	10
	1947	codeforces#P1549A Gregor and Cryptography math number theory *800	0 / 0	3
	1946	codeforces#P1549B Gregor and the Pawn Game dfs and similar dp flows graph matchings graphs greedy implementation *800	0 / 0	3
	1945	codeforces#P1550A Find The Array greedy math *800	0 / 0	3
	1944	codeforces#P1550B Maximum Cost Deletion greedy math *1000	0 / 0	3
	1943	codeforces#P1550C Manhattan Subarrays brute force geometry greedy implementation *1700	0 / 0	5
	1942	codeforces#P1550D Excellent Arrays binary search combinatorics constructive algorithms implementation math sortings two pointers *2300	0 / 0	8
	1941	codeforces#P1550E Stringforces binary search bitmasks brute force dp strings two pointers *2500	0 / 0	9
	1940	codeforces#P1550F Jumping Around binary search data structures divide and conquer dp dsu graphs shortest paths *2700	0 / 0	10
	1939	codeforces#P1551A Polycarp and Coins greedy math *800	0 / 0	3
	1938	codeforces#P1551B1 Wonderful Coloring - 1 greedy strings *800	0 / 0	3
	1937	codeforces#P1551B2 Wonderful Coloring - 2 binary search constructive algorithms data structures greedy *1400	0 / 0	4
	1936	codeforces#P1551C Interesting Story greedy sortings strings *1500	0 / 0	5
	1935	codeforces#P1551D1 Domino (easy version) constructive algorithms math *1700	0 / 0	5
	1934	codeforces#P1551D2 Domino (hard version) constructive algorithms implementation math *2100	0 / 0	7
	1933	codeforces#P1551E Fixed Points binary search brute force dp *2000	0 / 0	7
	1932	codeforces#P1551F Equidistant Vertices brute force combinatorics dfs and similar dp trees *2200	0 / 0	8
	1931	codeforces#P1552A Subsequence Permutation sortings strings *800	0 / 0	3
	1930	codeforces#P1552B Running for Gold combinatorics graphs greedy sortings *1500	0 / 0	5
	1929	codeforces#P1552C Maximize the Intersections combinatorics constructive algorithms geometry greedy sortings *1800	0 / 0	6
	1928	codeforces#P1552D Array Differentiation bitmasks brute force constructive algorithms dfs and similar dp graphs math *1800	0 / 0	6
	1927	codeforces#P1552E Colors and Intervals constructive algorithms data structures greedy sortings *2300	0 / 0	8
	1926	codeforces#P1552F Telepanting binary search data structures dp sortings *2200	0 / 0	8
	1925	codeforces#P1552G A Serious Referee bitmasks brute force dfs and similar sortings *3000	0 / 0	10
	1924	codeforces#P1552H Guess the Perimeter binary search interactive number theory *3300	0 / 0	10
	1923	codeforces#P1552I Organizing a Music Festival dfs and similar math *3400	0 / 0	10
	1922	codeforces#P1553A Digits Sum math number theory *800	0 / 0	3
	1921	codeforces#P1553B Reverse String brute force dp hashing implementation strings *1300	0 / 0	4
	1920	codeforces#P1553C Penalty bitmasks brute force dp greedy *1200	0 / 0	4
	1919	codeforces#P1553D Backspace dp greedy strings two pointers *1500	0 / 0	5
	1918	codeforces#P1553E Permutation Shift brute force combinatorics constructive algorithms dfs and similar dsu graphs math *2100	0 / 0	7
	1917	codeforces#P1553F Pairwise Modulo data structures math *2300	0 / 0	8
	1916	codeforces#P1553G Common Divisor Graph brute force constructive algorithms dsu graphs hashing math number theory *2700	0 / 0	10
	1915	codeforces#P1553H XOR and Distance bitmasks divide and conquer trees *2900	0 / 0	10
	1914	codeforces#P1553I Stairs combinatorics divide and conquer dp fft math *3400	0 / 0	10
	1913	codeforces#P1554A Cherry greedy *800	0 / 0	3
	1912	codeforces#P1554B Cobb bitmasks brute force greedy math *1700	0 / 0	5
	1911	codeforces#P1554C Mikasa binary search bitmasks greedy implementation *1800	0 / 0	6
	1910	codeforces#P1554D Diane constructive algorithms greedy strings *1800	0 / 0	6
	1909	codeforces#P1554E You dfs and similar dp math number theory *2600	0 / 0	10
	1908	codeforces#P1555A PizzaForces brute force math *900	0 / 0	3
	1907	codeforces#P1555B Two Tables brute force *1300	0 / 0	4
	1906	codeforces#P1555C Coin Rows brute force constructive algorithms dp implementation *1300	0 / 0	4
	1905	codeforces#P1555D Say No to Palindromes brute force constructive algorithms dp strings *1600	0 / 0	5
	1904	codeforces#P1555E Boring Segments data structures sortings trees two pointers *2100	0 / 0	7
	1903	codeforces#P1555F Good Graph data structures dsu graphs trees *2700	0 / 0	10
	1902	codeforces#P1556A A Variety of Operations math *800	0 / 0	3
	1901	codeforces#P1556B Take Your Places! implementation *1300	0 / 0	4
	1900	codeforces#P1556C Compressed Bracket Sequence brute force implementation *1800	0 / 0	6
	1899	codeforces#P1556D Take a Guess bitmasks constructive algorithms interactive math *1800	0 / 0	6
	1898	codeforces#P1556E Equilibrium data structures dp greedy *2200	0 / 0	8
	1897	codeforces#P1556F Sports Betting bitmasks combinatorics dp graphs math probabilities *2500	0 / 0	9
	1896	codeforces#P1556G Gates to Another World bitmasks data structures dsu two pointers *3300	0 / 0	10
	1895	codeforces#P1556H DIY Tree graphs greedy math probabilities *3300	0 / 0	10
	1894	codeforces#P1557A Ezzat and Two Subsequences brute force math sortings *800	0 / 0	3
	1893	codeforces#P1557B Moamen and k-subarrays greedy sortings *1100	0 / 0	3
	1892	codeforces#P1557C Moamen and XOR bitmasks combinatorics dp math matrices *1700	0 / 0	5
	1891	codeforces#P1557D Ezzat and Grid data structures dp greedy *2200	0 / 0	8
	1890	codeforces#P1557E Assiut Chess brute force constructive algorithms interactive *2800	0 / 0	10
	1889	codeforces#P1558A Charmed by the Game brute force math *1300	0 / 0	4
	1888	codeforces#P1558B Up the Strip brute force dp math number theory two pointers *1900	0 / 0	6
	1887	codeforces#P1558C Bottom-Tier Reversals constructive algorithms greedy *2000	0 / 0	7
	1886	codeforces#P1558D Top-Notch Insertions combinatorics data structures *2600	0 / 0	10
	1885	codeforces#P1558E Down Below binary search dfs and similar graphs greedy meet-in-the-middle shortest paths *3000	0 / 0	10
	1884	codeforces#P1558F Strange Sort data structures sortings *3300	0 / 0	10
	1883	codeforces#P1559A Mocha and Math bitmasks constructive algorithms math *900	0 / 0	3
	1882	codeforces#P1559B Mocha and Red and Blue dp greedy *900	0 / 0	3
	1881	codeforces#P1559C Mocha and Hiking constructive algorithms graphs *1200	0 / 0	4
	1880	codeforces#P1559D1 Mocha and Diana (Easy Version) brute force constructive algorithms dsu graphs greedy trees *1400	0 / 0	4
	1879	codeforces#P1559D2 Mocha and Diana (Hard Version) brute force constructive algorithms dfs and similar dsu graphs greedy trees two pointers *2500	0 / 0	9
	1878	codeforces#P1559E Mocha and Stars combinatorics dp fft math number theory *2200	0 / 0	8
	1877	codeforces#P1560A Dislike of Threes implementation *800	0 / 0	3
	1876	codeforces#P1560B Who's Opposite? math *800	0 / 0	3
	1875	codeforces#P1560C Infinity Table implementation math *800	0 / 0	3
	1874	codeforces#P1560D Make a Power of Two greedy math strings *1300	0 / 0	4
	1873	codeforces#P1560E Polycarp and String Transformation binary search implementation sortings strings *1800	0 / 0	6
	1872	codeforces#P1560F1 Nearest Beautiful Number (easy version) binary search bitmasks brute force constructive algorithms dfs and similar greedy *1900	0 / 0	6
	1871	codeforces#P1560F2 Nearest Beautiful Number (hard version) bitmasks brute force constructive algorithms dfs and similar dp greedy *2100	0 / 0	7
	1870	codeforces#P1561A Simply Strange Sort brute force implementation sortings *800	0 / 0	3
	1869	codeforces#P1561C Deep Down Below binary search greedy sortings *1300	0 / 0	4
	1868	codeforces#P1561D1 Up the Strip (simplified version) brute force data structures dp math number theory *1700	0 / 0	5
	1867	codeforces#P1562A The Miracle and the Sleeper greedy math *800	0 / 0	3
	1866	codeforces#P1562B Scenes From a Memory brute force constructive algorithms implementation math number theory *1000	0 / 0	3
	1865	codeforces#P1562C Rings constructive algorithms math *1500	0 / 0	5
	1864	codeforces#P1562D1 Two Hundred Twenty One (easy version) data structures dp math *1700	0 / 0	5
	1863	codeforces#P1562D2 Two Hundred Twenty One (hard version) data structures math *2200	0 / 0	8
	1862	codeforces#P1562E Rescue Niwen! dp greedy string suffix structures strings *2500	0 / 0	9
	1861	codeforces#P1562F Tubular Bells interactive math number theory probabilities *2900	0 / 0	10
	1860	codeforces#P1566A Median Maximization binary search greedy math *800	0 / 0	3
	1859	codeforces#P1566B MIN-MEX Cut bitmasks constructive algorithms dp greedy *800	0 / 0	3
	1858	codeforces#P1566C MAX-MEX Cut bitmasks constructive algorithms dp greedy *1000	0 / 0	3
	1857	codeforces#P1566D1 Seating Arrangements (easy version) data structures greedy sortings *1100	0 / 0	3

Pick a problem randomly based on the current filter.