Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	198	P1612E Messages brute force dp greedy probabilities sortings *2000	0 / 0	(None)
	197	P1612F Armor and Weapons brute force dp greedy shortest paths *2800	0 / 0	(None)
	196	P1612G Max Sum Array combinatorics constructive algorithms greedy sortings *2500	0 / 0	(None)
	195	P1613A Long Comparison implementation math *900	0 / 0	(None)
	194	P1613B Absent Remainder greedy implementation sortings *1000	0 / 0	(None)
	193	P1613C Poisoned Dagger binary search *1200	0 / 0	(None)
	192	P1613D MEX Sequences dp math *1900	0 / 0	(None)
	191	P1613E Crazy Robot dfs and similar graphs *2000	0 / 0	(None)
	190	P1613F Tree Coloring combinatorics divide and conquer fft *2600	0 / 0	(None)
	189	P1614A Divan and a Store brute force constructive algorithms greedy *800	0 / 0	(None)
	188	P1614B Divan and a New Project constructive algorithms sortings *1000	0 / 0	(None)
	187	P1614C Divan and bitwise operations bitmasks combinatorics constructive algorithms dp math *1500	0 / 0	(None)
	186	P1614D1 Divan and Kostomuksha (easy version) dp number theory *2100	0 / 0	(None)
	185	P1614D2 Divan and Kostomuksha (hard version) dp number theory *2300	0 / 0	(None)
	184	P1614E Divan and a Cottage binary search data structures *2600	0 / 0	(None)
	183	P1615A Closing The Gap greedy math *800	0 / 0	(None)
	182	P1615B And It's Non-Zero bitmasks greedy math *1300	0 / 0	(None)
	181	P1615C Menorah brute force graphs greedy math *1600	0 / 0	(None)
	180	P1615D X(or)-mas Tree bitmasks dfs and similar dsu graphs trees *2200	0 / 0	(None)
	179	P1615E Purple Crayon data structures dfs and similar games graphs greedy math sortings trees *2400	0 / 0	(None)

Pick a problem randomly based on the current filter.