*3000 - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	4957	P1218G Alpha planetary system constructive algorithms graphs shortest paths *3000	0 / 0	(None)
	5037	P1250D Conference Problem dp *3000	0 / 0	(None)
	5051	P1252D Find String in a Grid data structures dp strings trees *3000	0 / 0	(None)
	5054	P1252I Mission Possible *3000	0 / 0	(None)
	5095	P1267G Game Relics math probabilities *3000	0 / 0	(None)
	5169	P1290D Coffee Varieties (hard version) constructive algorithms graphs interactive *3000	0 / 0	(None)
	5315	P1340E Nastya and Bees graphs interactive probabilities *3000	0 / 0	(None)
	5394	P1361E James and the Chase dfs and similar graphs probabilities trees *3000	0 / 0	(None)
	5469	P1381D The Majestic Brown Tree Snake dfs and similar dp greedy trees two pointers *3000	0 / 0	(None)
	5502	P1392H ZS Shuffles Cards combinatorics dp math probabilities *3000	0 / 0	(None)
	5563	P1411F The Thorny Path greedy math *3000	0 / 0	(None)
	5580	P1418F Equal Product data structures math number theory two pointers *3000	0 / 0	(None)
	5667	P1446D2 Frequency Problem (Hard Version) data structures greedy two pointers *3000	0 / 0	(None)
	5751	P1474F 1 2 3 4 ... dp math matrices *3000	0 / 0	(None)
	5759	P1476F Lanterns binary search data structures dp *3000	0 / 0	(None)
	5856	P1508D Swap Pass constructive algorithms geometry sortings *3000	0 / 0	(None)
	5922	P1526F Median Queries constructive algorithms interactive probabilities *3000	0 / 0	(None)
	5955	P1534F2 Falling Sand (Hard Version) dfs and similar dp graphs greedy *3000	0 / 0	(None)
	6037	P1558E Down Below binary search dfs and similar graphs greedy meet-in-the-middle shortest paths *3000	0 / 0	(None)
	6068	P1571J Two Railroads special problem 3000	0 / 0	(None)

Pick a problem randomly based on the current filter.