Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1938	P1275E1 Контрольная сумма *special problem	0 / 0	(None)
	1937	P1275E2 Контрольная сумма *special problem	0 / 0	(None)
	1936	P1275E3 Контрольная сумма *special problem	0 / 0	(None)
	1935	P1275F Шардирование постов *special problem binary search interactive	0 / 0	(None)
	1934	P1276A As Simple as One and Two dp greedy *1400	0 / 0	(None)
	1933	P1276B Two Fairs combinatorics dfs and similar dsu graphs *1900	0 / 0	(None)
	1932	P1276C Beautiful Rectangle brute force combinatorics constructive algorithms data structures greedy math *2300	0 / 0	(None)
	1931	P1276D Tree Elimination dp trees *2900	0 / 0	(None)
	1930	P1276E Four Stones constructive algorithms *3500	0 / 0	(None)
	1929	P1276F Asterisk Substrings string suffix structures *3400	0 / 0	(None)
	1928	P1277A Happy Birthday, Polycarp! implementation *1000	0 / 0	(None)
	1927	P1277B Make Them Odd greedy number theory *1200	0 / 0	(None)
	1926	P1277D Let's Play the Words? data structures hashing implementation math *1900	0 / 0	(None)
	1925	P1278A Shuffle Hashing brute force implementation strings *1000	0 / 0	(None)
	1924	P1278B A and B greedy math *1500	0 / 0	(None)
	1923	P1278C Berry Jam data structures dp greedy implementation *1700	0 / 0	(None)
	1922	P1278D Segment Tree data structures dsu graphs trees *2100	0 / 0	(None)
	1921	P1278E Tests for problem D constructive algorithms dfs and similar divide and conquer trees *2200	0 / 0	(None)
	1920	P1278F Cards combinatorics dp math number theory probabilities *2600	0 / 0	(None)
	1919	P1279A New Year Garland math *900	0 / 0	(None)

Pick a problem randomly based on the current filter.