data structures - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1554	P1354D Multiset binary search data structures *1900	0 / 0	(None)
	1512	P1358E Are You Fired? constructive algorithms data structures greedy implementation *2400	0 / 0	(None)
	1507	P1359D Yet Another Yet Another Task data structures dp implementation two pointers *2000	0 / 0	(None)
	1505	P1359F RC Kaboom Show binary search brute force data structures geometry math *2900	0 / 0	(None)
	1491	P1361F Johnny and New Toy data structures implementation math *3300	0 / 0	(None)
	1481	P1364A XXXXX brute force data structures number theory two pointers *1200	0 / 0	(None)
	1474	P1365C Rotation Matching constructive algorithms data structures greedy implementation *1400	0 / 0	(None)
	1463	P1366G Construct the String data structures dp strings *2700	0 / 0	(None)
	1456	P1367F2 Flying Sort (Hard Version) binary search data structures dp greedy sortings two pointers *2400	0 / 0	(None)
	1449	P1368G Shifting Dominoes data structures geometry graphs trees *3200	0 / 0	(None)
	1442	P1369E DeadLee data structures dfs and similar greedy implementation sortings *2400	0 / 0	(None)
	1436	P1370E Binary Subsequence Rotation binary search constructive algorithms data structures greedy *2100	0 / 0	(None)
	1427	P1371F Raging Thunder data structures divide and conquer implementation *2800	0 / 0	(None)
	1415	P1373F Network Coverage binary search constructive algorithms data structures greedy *2400	0 / 0	(None)
	1414	P1373G Pawns data structures divide and conquer greedy *2600	0 / 0	(None)
	1409	P1374E1 Reading Books (easy version) data structures greedy sortings *1600	0 / 0	(None)
	1408	P1374E2 Reading Books (hard version) data structures greedy implementation sortings ternary search two pointers *2500	0 / 0	(None)
	1404	P1375C Element Extermination constructive algorithms data structures greedy *1400	0 / 0	(None)
	1395	P1379C Choosing flowers binary search brute force data structures dfs and similar dp greedy sortings two pointers *2000	0 / 0	(None)
	1394	P1379D New Passenger Trams binary search brute force data structures sortings two pointers *2300	0 / 0	(None)

Pick a problem randomly based on the current filter.