Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	6190	P1610G AmShZ Wins a Bet data structures greedy hashing *3300	0 / 0	(None)
	6191	P1610I Mashtali vs AtCoder games trees *3100	0 / 0	(None)
	6192	P1611B Team Composition: Programmers and Mathematicians binary search constructive algorithms math *800	0 / 0	(None)
	6193	P1611C Polycarp Recovers the Permutation constructive algorithms *1000	0 / 0	(None)
	6194	P1611D Weights Assignment For Tree Edges constructive algorithms trees *1500	0 / 0	(None)
	6195	P1611E2 Escape The Maze (hard version) dfs and similar dp greedy shortest paths trees *1900	0 / 0	(None)
	6196	P1611G Robot and Candies data structures graph matchings greedy *2500	0 / 0	(None)
	6197	P1612A Distance brute force constructive algorithms *800	0 / 0	(None)
	6198	P1612C Chat Ban binary search math *1300	0 / 0	(None)
	6199	P1612E Messages brute force dp greedy probabilities sortings *2000	0 / 0	(None)
	6200	P1612F Armor and Weapons brute force dp greedy shortest paths *2800	0 / 0	(None)
	6201	P1612G Max Sum Array combinatorics constructive algorithms greedy sortings *2500	0 / 0	(None)
	6202	P1613B Absent Remainder greedy implementation sortings *1000	0 / 0	(None)
	6203	P1613C Poisoned Dagger binary search *1200	0 / 0	(None)
	6204	P1613D MEX Sequences dp math *1900	0 / 0	(None)
	6205	P1613F Tree Coloring combinatorics divide and conquer fft *2600	0 / 0	(None)
	6206	P1614A Divan and a Store brute force constructive algorithms greedy *800	0 / 0	(None)
	6207	P1614C Divan and bitwise operations bitmasks combinatorics constructive algorithms dp math *1500	0 / 0	(None)
	6208	P1614D1 Divan and Kostomuksha (easy version) dp number theory *2100	0 / 0	(None)
	6209	P1614E Divan and a Cottage binary search data structures *2600	0 / 0	(None)

Pick a problem randomly based on the current filter.