Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3286	P557A Ilya and Diplomas greedy implementation math *1100	0 / 0	(None)
	3287	P557C Arthur and Table brute force data structures dp greedy math sortings *1900	0 / 0	(None)
	3288	P557D Vitaly and Cycle combinatorics dfs and similar graphs math *2000	0 / 0	(None)
	3289	P558A Lala Land and Apple Trees brute force implementation sortings *1100	0 / 0	(None)
	3294	P558B Amr and The Large Array implementation *1300	0 / 0	(None)
	3295	P558C Amr and Chemistry brute force graphs greedy math shortest paths *1900	0 / 0	(None)
	3296	P558E A Simple Task data structures sortings strings *2300	0 / 0	(None)
	3297	P559A Gerald's Hexagon brute force geometry math *1600	0 / 0	(None)
	3298	P559C Gerald and Giant Chess combinatorics dp math number theory *2200	0 / 0	(None)
	3299	P559D Randomizer combinatorics geometry probabilities *2800	0 / 0	(None)
	3300	P560A Currency System in Geraldion implementation sortings *1000	0 / 0	(None)
	3301	P566A Matching Names dfs and similar strings trees *2300	0 / 0	(None)
	3302	P566C Logistical Questions dfs and similar divide and conquer trees *3000	0 / 0	(None)
	3303	P566E Restoring Map bitmasks constructive algorithms trees *3200	0 / 0	(None)
	3304	P566F Clique in the Divisibility Graph dp math number theory *1500	0 / 0	(None)
	3305	P567A Lineland Mail greedy implementation *900	0 / 0	(None)
	3306	P567B Berland National Library implementation *1300	0 / 0	(None)
	3307	P567C Geometric Progression binary search data structures dp *1700	0 / 0	(None)
	3308	P567E President and Roads dfs and similar graphs hashing shortest paths *2200	0 / 0	(None)
	3309	P568A Primes or Palindromes? brute force implementation math number theory *1600	0 / 0	(None)

Pick a problem randomly based on the current filter.