Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	418	P1567F One-Four Overload 2-sat constructive algorithms dfs and similar dsu graphs implementation *2700	0 / 0	(None)
	417	P1569A Balanced Substring implementation *800	0 / 0	(None)
	416	P1569B Chess Tournament constructive algorithms *1000	0 / 0	(None)
	415	P1569C Jury Meeting combinatorics math *1500	0 / 0	(None)
	414	P1569D Inconvenient Pairs binary search data structures implementation sortings two pointers *1900	0 / 0	(None)
	413	P1569E Playoff Restoration bitmasks brute force hashing implementation meet-in-the-middle *2600	0 / 0	(None)
	412	P1569F Palindromic Hamiltonian Path brute force dfs and similar dp graphs hashing *3000	0 / 0	(None)
	411	P1571A Sequence of Comparisons special problem 800	0 / 0	(None)
	410	P1571B Epic Novel special problem math 1300	0 / 0	(None)
	409	P1571C Rhyme special problem implementation 1800	0 / 0	(None)
	408	P1571D Sweepstake special problem brute force constructive algorithms implementation math 1800	0 / 0	(None)
	407	P1571E Fix the String special problem bitmasks dp greedy 1700	0 / 0	(None)
	406	P1571F Kotlinforces special problem constructive algorithms dp 2000	0 / 0	(None)
	405	P1571G A Battle Against a Dragon special problem data structures dp 2500	0 / 0	(None)
	404	P1571H Laser Beams special problem geometry probabilities 2900	0 / 0	(None)
	403	P1571I Physical Examination special problem binary search data structures 3200	0 / 0	(None)
	402	P1571J Two Railroads special problem 3000	0 / 0	(None)
	401	P1572A Book binary search brute force data structures dp graphs implementation sortings *1800	0 / 0	(None)
	400	P1572B Xor of 3 brute force constructive algorithms greedy two pointers *2500	0 / 0	(None)
	399	P1572C Paint dp greedy *2700	0 / 0	(None)

Pick a problem randomly based on the current filter.