*2400 - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2465	P1174F Ehab and the Big Finale constructive algorithms divide and conquer graphs implementation interactive trees *2400	0 / 0	(None)
	2424	P1182D Complete Mirror constructive algorithms dfs and similar dp hashing implementation trees *2400	0 / 0	(None)
	2400	P1184E3 Daleks' Invasion (hard) data structures dsu graphs trees *2400	0 / 0	(None)
	2386	P1186F Vus the Cossack and a Graph dfs and similar graphs greedy implementation *2400	0 / 0	(None)
	2382	P1187D Subarray Sorting data structures sortings *2400	0 / 0	(None)
	2350	P1194F Crossword Expert combinatorics dp number theory probabilities two pointers *2400	0 / 0	(None)
	2304	P1202E You Are Given Some Strings... brute force string suffix structures strings *2400	0 / 0	(None)
	2286	P1205C Palindromic Paths implementation interactive *2400	0 / 0	(None)
	2252	P1210D Konrad and Company Evaluation graphs *2400	0 / 0	(None)
	2200	P1218D Xor Spanning Tree divide and conquer fft graphs *2400	0 / 0	(None)
	2180	P1221F Choose a Square binary search data structures sortings *2400	0 / 0	(None)
	2156	P1227F2 Wrong Answer on test 233 (Hard Version) combinatorics math *2400	0 / 0	(None)
	2126	P1237E Balanced Binary Search Trees dp math *2400	0 / 0	(None)
	2112	P1239D Catowice City 2-sat dfs and similar graph matchings graphs *2400	0 / 0	(None)
	2106	P1242C Sum Balance bitmasks dfs and similar dp graphs *2400	0 / 0	(None)
	2094	P1244G Running in Pairs constructive algorithms greedy math *2400	0 / 0	(None)
	2055	P1251E2 Voting (Hard Version) binary search data structures greedy *2400	0 / 0	(None)
	2048	P1252F Regular Forestation hashing trees *2400	0 / 0	(None)
	2015	P1257F Make Them Similar bitmasks brute force hashing meet-in-the-middle *2400	0 / 0	(None)
	2009	P1260E Tournament brute force dp greedy *2400	0 / 0	(None)

Pick a problem randomly based on the current filter.