*2600 - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1099	P1437F Emotional Fishermen combinatorics dp math two pointers *2600	0 / 0	(None)
	1098	P1437G Death DBMS data structures string suffix structures strings trees *2600	0 / 0	(None)
	1089	P1439B Graph Subset Problem constructive algorithms data structures graphs *2600	0 / 0	(None)
	1088	P1439C Greedy Shopping binary search data structures divide and conquer greedy implementation *2600	0 / 0	(None)
	1063	P1446D1 Frequency Problem (Easy Version) data structures greedy *2600	0 / 0	(None)
	979	P1466G Song of the Sirens combinatorics divide and conquer hashing math string suffix structures strings *2600	0 / 0	(None)
	952	P1469F Power Sockets binary search data structures greedy *2600	0 / 0	(None)
	866	P1486F Pairs of Paths combinatorics data structures dfs and similar dp trees *2600	0 / 0	(None)
	823	P1493E Enormous XOR bitmasks constructive algorithms greedy math strings two pointers *2600	0 / 0	(None)
	822	P1493F Enchanted Matrix bitmasks interactive number theory *2600	0 / 0	(None)
	812	P1495D BFS Trees combinatorics dfs and similar graphs math shortest paths trees *2600	0 / 0	(None)
	785	P1500C Matrix Sorting bitmasks brute force constructive algorithms greedy two pointers *2600	0 / 0	(None)
	776	P1503D Flip the Cards 2-sat constructive algorithms data structures greedy sortings two pointers *2600	0 / 0	(None)
	765	P1505G Encoded message special problem implementation 2600	0 / 0	(None)
	745	P1510B Button Lock flows graph matchings graphs *2600	0 / 0	(None)
	705	P1515F Phoenix and Earthquake constructive algorithms dfs and similar dsu graphs greedy trees *2600	0 / 0	(None)
	665	P1523E Crypto Lights combinatorics dp math probabilities *2600	0 / 0	(None)
	629	P1530F Bingo bitmasks combinatorics dp math probabilities *2600	0 / 0	(None)
	582	P1536F Omkar and Akmar chinese remainder theorem combinatorics constructive algorithms fft games geometry math meet-in-the-middle string suffix structures *2600	0 / 0	(None)
	562	P1539F Strange Array data structures greedy sortings *2600	0 / 0	(None)

Pick a problem randomly based on the current filter.