interactive - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1960	P1270D Strange Device constructive algorithms interactive math sortings *1900	0 / 0	(None)
	1935	P1275F Шардирование постов *special problem binary search interactive	0 / 0	(None)
	1901	P1282D Enchanted Artifact constructive algorithms interactive strings *2300	0 / 0	(None)
	1878	P1286C1 Madhouse (Easy version) brute force constructive algorithms interactive math *2400	0 / 0	(None)
	1877	P1286C2 Madhouse (Hard version) brute force constructive algorithms hashing interactive math *2800	0 / 0	(None)
	1862	P1290D Coffee Varieties (hard version) constructive algorithms graphs interactive *3000	0 / 0	(None)
	1857	P1291F Coffee Varieties (easy version) graphs interactive *2800	0 / 0	(None)
	1852	P1292E Rin and The Unknown Flower constructive algorithms greedy interactive math *3500	0 / 0	(None)
	1816	P1299E So Mean interactive math *3400	0 / 0	(None)
	1780	P1305D Kuroni and the Celebration constructive algorithms dfs and similar interactive trees *1900	0 / 0	(None)
	1639	P1336D Yui and Mahjong Set constructive algorithms interactive *3200	0 / 0	(None)
	1622	P1340E Nastya and Bees graphs interactive probabilities *3000	0 / 0	(None)
	1551	P1354G Find a Gift binary search interactive probabilities *2600	0 / 0	(None)
	1545	P1355F Guess Divisors Count constructive algorithms interactive number theory *2600	0 / 0	(None)
	1484	P1363D Guess The Maximums binary search implementation interactive math *2100	0 / 0	(None)
	1477	P1364E X-OR bitmasks constructive algorithms divide and conquer interactive probabilities *2700	0 / 0	(None)
	1470	P1365G Secure Password bitmasks combinatorics constructive algorithms interactive math *2800	0 / 0	(None)
	1450	P1368F Lamps on a Circle games implementation interactive math *2600	0 / 0	(None)
	1435	P1370F1 The Hidden Pair (Easy Version) binary search dfs and similar graphs interactive shortest paths trees *2400	0 / 0	(None)
	1434	P1370F2 The Hidden Pair (Hard Version) binary search dfs and similar graphs interactive shortest paths trees *2700	0 / 0	(None)

Pick a problem randomly based on the current filter.