constructive algorithms - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2579	P1151C Problem for Nazar constructive algorithms math *1800	0 / 0	(None)
	2574	P1152B Neko Performs Cat Furrier Transform bitmasks constructive algorithms dfs and similar math *1300	0 / 0	(None)
	2571	P1152E Neko and Flashback constructive algorithms dfs and similar graphs *2400	0 / 0	(None)
	2567	P1153B Serval and Toy Bricks constructive algorithms greedy *1200	0 / 0	(None)
	2538	P1157D N Problems During K Days constructive algorithms greedy math *1900	0 / 0	(None)
	2536	P1157F Maximum Balanced Circle constructive algorithms dp greedy two pointers *2000	0 / 0	(None)
	2535	P1157G Inverse of Rows and Columns brute force constructive algorithms *2200	0 / 0	(None)
	2534	P1158A The Party and Sweets binary search constructive algorithms greedy implementation math sortings two pointers *1500	0 / 0	(None)
	2533	P1158B The minimal unique substring constructive algorithms math strings *2200	0 / 0	(None)
	2532	P1158C Permutation recovery constructive algorithms data structures dfs and similar graphs greedy math sortings *2100	0 / 0	(None)
	2531	P1158D Winding polygonal line constructive algorithms geometry greedy math *2600	0 / 0	(None)
	2517	P1163E Magical Permutation bitmasks brute force constructive algorithms data structures graphs math *2400	0 / 0	(None)
	2507	P1166B All the Vowels Please constructive algorithms math number theory *1100	0 / 0	(None)
	2504	P1166E The LCMs Must be Large bitmasks brute force constructive algorithms math number theory *2100	0 / 0	(None)
	2499	P1167D Bicolored RBS constructive algorithms greedy *1500	0 / 0	(None)
	2491	P1168E Xor Permutations constructive algorithms math *3100	0 / 0	(None)
	2481	P1170H Longest Saw *special problem constructive algorithms	0 / 0	(None)
	2475	P1172D Nauuo and Portals constructive algorithms *2900	0 / 0	(None)
	2471	P1173B Nauuo and Chess constructive algorithms greedy *1100	0 / 0	(None)
	2470	P1174A Ehab Fails to Be Thanos constructive algorithms greedy sortings *1000	0 / 0	(None)

Pick a problem randomly based on the current filter.