*3500 - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	8493	P1824E LuoTianyi and Cartridge data structures trees *3500	0 / 0	10
	8484	P1827F Copium Permutation constructive algorithms data structures greedy *3500	0 / 0	10
	8477	P1830E Bully Sort data structures math *3500	0 / 0	10
	8553	P1835E Old Mobile combinatorics dp probabilities *3500	0 / 0	10
	8552	P1835F Good Graph bitmasks dfs and similar graph matchings graphs implementation *3500	0 / 0	10
	8541	P1842I Tenzing and Necklace divide and conquer dp greedy *3500	0 / 0	10
	8624	P1854F Mark and Spaceship brute force dp *3500	0 / 0	10
	8741	P1870H Standard Graph Problem data structures graphs greedy trees *3500	0 / 0	10
	8873	P1893E Cacti Symphony combinatorics dfs and similar dp graphs *3500	0 / 0	10
	8862	P1896H2 Cyclic Hamming (Hard Version) brute force dp fft math number theory *3500	0 / 0	10
	8967	P1909H Parallel Swaps Sort constructive algorithms data structures *3500	0 / 0	10
	8966	P1909I Short Permutation Problem combinatorics dp fft math *3500	0 / 0	10
	8937	P1916G Optimizations From Chelsu divide and conquer dp number theory trees *3500	0 / 0	10
	8921	P1919G Tree LGM constructive algorithms games trees *3500	0 / 0	10
	8920	P1919H Tree Diameter interactive trees *3500	0 / 0	10
	9102	P1943F Minimum Hamming Distance dp *3500	0 / 0	10
	9196	P1967E2 Again Counting Arrays (Hard Version) combinatorics dp math *3500	0 / 0	10
	9284	P1975H 378QAQ and Core greedy strings *3500	0 / 0	10
	9283	P1975I Mind Bloom dp *3500	0 / 0	10
	9320	P1987G2 Spinning Round (Hard Version) divide and conquer dp trees *3500	0 / 0	10

Pick a problem randomly based on the current filter.