Problem Set - *3500 - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	886	codeforces#P1740I Arranging Crystal Balls data structures divide and conquer divide and conquer dp geometry graphs number theory *3500	0 / 0	10
	850	codeforces#P1746G Olympiad Training binary search data structures dp flows geometry implementation sortings *3500	0 / 0	10
	825	codeforces#P1750H BinaryStringForces constructive algorithms data structures dp *3500	0 / 0	10
	818	codeforces#P1753F Minecraft Series brute force two pointers *3500	0 / 0	10
	789	codeforces#P1761F2 Anti-median (Hard Version) combinatorics dp math *3500	0 / 0	10
	788	codeforces#P1761G Centroid Guess interactive probabilities trees *3500	0 / 0	10
	725	codeforces#P1770H Koxia, Mahiru and Winter Festival constructive algorithms *3500	0 / 0	10
	707	codeforces#P1773L Lisa's Sequences dp *3500	0 / 0	10
	698	codeforces#P1774H Maximum Permutation constructive algorithms *3500	0 / 0	10
	686	codeforces#P1776E Crossing the Railways data structures dp *3500	0 / 0	10
	677	codeforces#P1776N Count Permutations math *3500	0 / 0	10
	657	codeforces#P1779H Olympic Team Building brute force meet-in-the-middle *3500	0 / 0	10
	642	codeforces#P1781H2 Window Signals (hard version) *3500	0 / 0	10
	513	codeforces#P1804G Flow Control data structures dsu implementation *3500	0 / 0	10
	438	codeforces#P1815F OH NO1 (-2-3-4) constructive algorithms graphs math *3500	0 / 0	10
	430	codeforces#P1817F Entangled Substrings string suffix structures strings *3500	0 / 0	10
	422	codeforces#P1819F Willy-nilly, Crack, Into Release! data structures dp *3500	0 / 0	10
	394	codeforces#P1824E LuoTianyi and Cartridge data structures trees *3500	0 / 0	10
	379	codeforces#P1827F Copium Permutation constructive algorithms data structures greedy *3500	0 / 0	10
	364	codeforces#P1830E Bully Sort data structures math *3500	0 / 0	10
	336	codeforces#P1835E Old Mobile combinatorics dp probabilities *3500	0 / 0	10
	335	codeforces#P1835F Good Graph bitmasks dfs and similar graph matchings graphs implementation *3500	0 / 0	10
	293	codeforces#P1842I Tenzing and Necklace divide and conquer dp greedy *3500	0 / 0	10
	224	codeforces#P1852F Panda Meetups data structures dp flows *3500	0 / 0	10
	215	codeforces#P1854F Mark and Spaceship brute force dp *3500	0 / 0	10
	161	codeforces#P1863H Goldberg Machine 3 dp trees *3500	0 / 0	10
	160	codeforces#P1863I Redundant Routes constructive algorithms dp trees *3500	0 / 0	10
	151	codeforces#P1864I Future Dominators graphs greedy *3500	0 / 0	10
	125	codeforces#P1868E Min-Sum-Max constructive algorithms dp greedy *3500	0 / 0	10
	124	codeforces#P1868F LIS? data structures greedy implementation *3500	0 / 0	10
	114	codeforces#P1870H Standard Graph Problem data structures graphs greedy trees *3500	0 / 0	10
	93	codeforces#P1874F Jellyfish and OEIS dp *3500	0 / 0	10
	92	codeforces#P1874G Jellyfish and Inscryption dp *3500	0 / 0	10
	83	codeforces#P1876F Indefinite Clownfish binary search graphs *3500	0 / 0	10
	82	codeforces#P1876G Clubstep binary search brute force data structures greedy trees *3500	0 / 0	10
	24	codeforces#P1889E Doremy's Swapping Trees dfs and similar graphs trees *3500	0 / 0	10
	23	codeforces#P1889F Doremy's Average Tree data structures dp greedy trees *3500	0 / 0	10
	10	codeforces#P1893E Cacti Symphony combinatorics dfs and similar dp graphs *3500	0 / 0	10
	6689	codeforces#P1909H Parallel Swaps Sort constructive algorithms data structures *3500	0 / 0	10
	6688	codeforces#P1909I Short Permutation Problem combinatorics dp fft math *3500	0 / 0	10
	6637	codeforces#P1916G Optimizations From Chelsu divide and conquer dp number theory trees *3500	0 / 0	10
	7318	codeforces#P1919G Tree LGM constructive algorithms divide and conquer games trees *3500	0 / 0	10
	7317	codeforces#P1919H Tree Diameter interactive trees *3500	0 / 0	10
	8175	codeforces#P1924F Anti-Proxy Attendance constructive algorithms dp interactive ternary search *3500	0 / 0	10
	9363	codeforces#P1967E2 Again Counting Arrays (Hard Version) combinatorics dp math *3500	0 / 0	10

Pick a problem randomly based on the current filter.