*2300 - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1724	P1322C Instant Noodles graphs hashing math number theory *2300	0 / 0	(None)
	1614	P1342E Placing Rooks combinatorics fft math *2300	0 / 0	(None)
	1592	P1346G Two IP Cameras special problem math number theory 2300	0 / 0	(None)
	1428	P1371E2 Asterism (Hard Version) binary search combinatorics dp math number theory sortings *2300	0 / 0	(None)
	1394	P1379D New Passenger Trams binary search brute force data structures sortings two pointers *2300	0 / 0	(None)
	1386	P1380E Merging Towers data structures dsu implementation trees *2300	0 / 0	(None)
	1361	P1385F Removing Leaves data structures greedy implementation trees *2300	0 / 0	(None)
	1360	P1385G Columns Swaps 2-sat dfs and similar dsu graphs implementation *2300	0 / 0	(None)
	1319	P1394B Boboniu Walks on Graph brute force dfs and similar graphs hashing *2300	0 / 0	(None)
	1310	P1396C Monster Invaders dp greedy implementation *2300	0 / 0	(None)
	1292	P1399F Yet Another Segments Subset data structures dp graphs sortings *2300	0 / 0	(None)
	1274	P1403B Spring cleaning special problem data structures dfs and similar graphs trees 2300	0 / 0	(None)
	1270	P1404C Fixed Point Removal binary search constructive algorithms data structures greedy two pointers *2300	0 / 0	(None)
	1250	P1408F Two Different constructive algorithms divide and conquer *2300	0 / 0	(None)
	1236	P1411E Poman Numbers bitmasks greedy math strings *2300	0 / 0	(None)
	1185	P1422D Returning Home graphs shortest paths sortings *2300	0 / 0	(None)
	1163	P1425D Danger of Mad Snakes combinatorics dp math *2300	0 / 0	(None)
	1054	P1450C2 Errich-Tac-Toe (Hard Version) constructive algorithms math *2300	0 / 0	(None)
	1042	P1451E2 Bitwise Queries (Hard Version) bitmasks constructive algorithms interactive math *2300	0 / 0	(None)
	1029	P1453E Dog Snacks binary search dfs and similar dp greedy trees *2300	0 / 0	(None)

Pick a problem randomly based on the current filter.