Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	278	P1599F Mars hashing *2700	0 / 0	(None)
	277	P1599G Shortest path brute force geometry math shortest paths *2700	0 / 0	(None)
	276	P1599H Hidden Fortress interactive math *2100	0 / 0	(None)
	275	P1599I Desert data structures graphs *2700	0 / 0	(None)
	274	P1599J Bob's Beautiful Array bitmasks brute force greedy *2600	0 / 0	(None)
	273	P1600E Array Game games greedy two pointers *1900	0 / 0	(None)
	272	P1600F Party Organization brute force math probabilities *2300	0 / 0	(None)
	271	P1600J Robot Factory bitmasks dfs and similar *1400	0 / 0	(None)
	270	P1601A Array Elimination bitmasks greedy math number theory *1300	0 / 0	(None)
	269	P1601B Frog Traveler data structures dfs and similar dp graphs shortest paths two pointers *1900	0 / 0	(None)
	268	P1601C Optimal Insertion data structures divide and conquer dp greedy sortings *2300	0 / 0	(None)
	267	P1601D Difficult Mountain data structures dp greedy sortings *2700	0 / 0	(None)
	266	P1601E Phys Ed Online data structures dp greedy *2900	0 / 0	(None)
	265	P1601F Two Sorts binary search dfs and similar math meet-in-the-middle *3400	0 / 0	(None)
	264	P1602A Two Subsequences implementation *800	0 / 0	(None)
	263	P1602B Divine Array constructive algorithms implementation *1100	0 / 0	(None)
	262	P1603A Di-visible Confusion constructive algorithms math number theory *1300	0 / 0	(None)
	261	P1603B Moderate Modular Mode constructive algorithms math number theory *1600	0 / 0	(None)
	260	P1603C Extreme Extension dp greedy math number theory *2300	0 / 0	(None)
	259	P1603D Artistic Partition divide and conquer dp number theory *3000	0 / 0	(None)

Pick a problem randomly based on the current filter.