constructive algorithms - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	680	P1520C Not Adjacent Matrix constructive algorithms *1000	0 / 0	(None)
	676	P1520F2 Guess the K-th Zero (Hard version) binary search constructive algorithms data structures interactive *2200	0 / 0	(None)
	674	P1521A Nastia and Nearly Good Numbers constructive algorithms math number theory *1000	0 / 0	(None)
	673	P1521B Nastia and a Good Array constructive algorithms math number theory *1300	0 / 0	(None)
	672	P1521C Nastia and a Hidden Permutation constructive algorithms interactive *2000	0 / 0	(None)
	671	P1521D Nastia Plays with a Tree constructive algorithms data structures dfs and similar dp dsu greedy implementation trees *2500	0 / 0	(None)
	670	P1521E Nastia and a Beautiful Matrix binary search constructive algorithms dp greedy *2700	0 / 0	(None)
	668	P1523B Lord of the Values constructive algorithms *1100	0 / 0	(None)
	660	P1525B Permutation Sort constructive algorithms greedy *900	0 / 0	(None)
	655	P1526A Mean Inequality constructive algorithms sortings *800	0 / 0	(None)
	651	P1526D Kill Anton brute force constructive algorithms data structures math strings *2200	0 / 0	(None)
	650	P1526E Oolimry and Suffix Array combinatorics constructive algorithms math *2400	0 / 0	(None)
	649	P1526F Median Queries constructive algorithms interactive probabilities *3000	0 / 0	(None)
	647	P1527B1 Palindrome Game (easy version) constructive algorithms games *1200	0 / 0	(None)
	646	P1527B2 Palindrome Game (hard version) constructive algorithms games *1900	0 / 0	(None)
	639	P1528D It's a bird! No, it's a plane! No, it's AaParsa! constructive algorithms graphs shortest paths *2500	0 / 0	(None)
	636	P1529A Eshag Loves Big Arrays constructive algorithms greedy math *800	0 / 0	(None)
	633	P1530B Putting Plates constructive algorithms implementation *800	0 / 0	(None)
	631	P1530D Secret Santa constructive algorithms flows graphs greedy math *1600	0 / 0	(None)
	630	P1530E Minimax constructive algorithms greedy strings *2100	0 / 0	(None)

Pick a problem randomly based on the current filter.