Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1958	P1270F Awesome Substrings math strings *2600	0 / 0	(None)
	1957	P1270G Subset with Zero Sum constructive algorithms dfs and similar graphs math *2700	0 / 0	(None)
	1956	P1270H Number of Components data structures *3300	0 / 0	(None)
	1955	P1270I Xor on Figures constructive algorithms fft math *3500	0 / 0	(None)
	1954	P1271A Suits brute force greedy math *800	0 / 0	(None)
	1953	P1271B Blocks greedy math *1300	0 / 0	(None)
	1952	P1271C Shawarma Tent brute force geometry greedy implementation *1300	0 / 0	(None)
	1951	P1271D Portals data structures dp greedy implementation sortings *2100	0 / 0	(None)
	1950	P1271E Common Number binary search combinatorics dp math *2100	0 / 0	(None)
	1949	P1271F Divide The Students brute force *2700	0 / 0	(None)
	1948	P1272A Three Friends brute force greedy math sortings *900	0 / 0	(None)
	1947	P1272B Snow Walking Robot constructive algorithms greedy implementation *1200	0 / 0	(None)
	1946	P1272C Yet Another Broken Keyboard combinatorics dp implementation *1200	0 / 0	(None)
	1945	P1272D Remove One Element brute force dp *1500	0 / 0	(None)
	1944	P1272E Nearest Opposite Parity dfs and similar graphs shortest paths *1900	0 / 0	(None)
	1943	P1272F Two Bracket Sequences dp strings two pointers *2200	0 / 0	(None)
	1942	P1275A Скрытый друг *special problem	0 / 0	(None)
	1941	P1275B Code Review *special problem	0 / 0	(None)
	1940	P1275C #define Задача B ... *special problem	0 / 0	(None)
	1939	P1275D Storage2 *special problem	0 / 0	(None)

Pick a problem randomly based on the current filter.