Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1498	P1360G A/B Matrix constructive algorithms greedy math *1900	0 / 0	(None)
	1497	P1360H Binary Median binary search bitmasks brute force constructive algorithms *2100	0 / 0	(None)
	1496	P1361A Johnny and Contribution constructive algorithms graphs greedy sortings *1700	0 / 0	(None)
	1495	P1361B Johnny and Grandmaster greedy implementation math sortings *1900	0 / 0	(None)
	1494	P1361C Johnny and Megan's Necklace binary search bitmasks constructive algorithms dfs and similar dsu graphs *2500	0 / 0	(None)
	1493	P1361D Johnny and James greedy implementation math trees *2900	0 / 0	(None)
	1492	P1361E James and the Chase dfs and similar graphs probabilities trees *3000	0 / 0	(None)
	1491	P1361F Johnny and New Toy data structures implementation math *3300	0 / 0	(None)
	1490	P1362A Johnny and Ancient Computer implementation *1000	0 / 0	(None)
	1489	P1362B Johnny and His Hobbies bitmasks brute force *1200	0 / 0	(None)
	1488	P1362C Johnny and Another Rating Drop bitmasks greedy math *1400	0 / 0	(None)
	1487	P1363A Odd Selection brute force implementation math *1200	0 / 0	(None)
	1486	P1363B Subsequence Hate implementation strings *1400	0 / 0	(None)
	1485	P1363C Game On Leaves games trees *1600	0 / 0	(None)
	1484	P1363D Guess The Maximums binary search implementation interactive math *2100	0 / 0	(None)
	1483	P1363E Tree Shuffling dfs and similar dp greedy trees *2000	0 / 0	(None)
	1482	P1363F Rotating Substrings dp strings *2600	0 / 0	(None)
	1481	P1364A XXXXX brute force data structures number theory two pointers *1200	0 / 0	(None)
	1480	P1364B Most socially-distanced subsequence greedy two pointers *1300	0 / 0	(None)
	1479	P1364C Ehab and Prefix MEXs brute force constructive algorithms greedy *1600	0 / 0	(None)

Pick a problem randomly based on the current filter.