*1700 - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2758	P1111C Creative Snap binary search brute force divide and conquer math *1700	0 / 0	(None)
	2751	P1114C Trailing Loves (or L'oeufs?) brute force implementation math number theory *1700	0 / 0	(None)
	2742	P1115U3 Block unitary special problem 1700	0 / 0	(None)
	2719	P1118C Palindromic Matrix constructive algorithms implementation *1700	0 / 0	(None)
	2718	P1118D1 Coffee and Coursework (Easy version) brute force greedy *1700	0 / 0	(None)
	2717	P1118D2 Coffee and Coursework (Hard Version) binary search greedy *1700	0 / 0	(None)
	2716	P1118E Yet Another Ball Problem constructive algorithms implementation *1700	0 / 0	(None)
	2696	P1129A1 Toy Train (Simplified) brute force greedy *1700	0 / 0	(None)
	2682	P1131F Asya And Kittens constructive algorithms dsu *1700	0 / 0	(None)
	2678	P1132C Painting the Fence brute force *1700	0 / 0	(None)
	2636	P1141E Superhero Battle math *1700	0 / 0	(None)
	2632	P1142A The Beatles brute force math *1700	0 / 0	(None)
	2619	P1144F Graph Without Long Directed Paths dfs and similar graphs *1700	0 / 0	(None)
	2608	P1146C Tree Diameter bitmasks graphs interactive *1700	0 / 0	(None)
	2594	P1148C Crazy Diamond constructive algorithms sortings *1700	0 / 0	(None)
	2566	P1153C Serval and Parenthesis Sequence greedy strings *1700	0 / 0	(None)
	2539	P1157C2 Increasing Subsequence (hard version) greedy *1700	0 / 0	(None)
	2537	P1157E Minimum Array binary search data structures greedy *1700	0 / 0	(None)
	2495	P1168A Increasing by Modulo binary search greedy *1700	0 / 0	(None)
	2453	P1176E Cover it! dfs and similar dsu graphs shortest paths trees *1700	0 / 0	(None)

Pick a problem randomly based on the current filter.