implementation - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2464	P1175A From Hero to Zero implementation math *900	0 / 0	(None)
	2463	P1175B Catch Overflow! data structures expression parsing implementation *1600	0 / 0	(None)
	2460	P1175E Minimal Segment Cover data structures dfs and similar divide and conquer dp greedy implementation trees *2200	0 / 0	(None)
	2457	P1176A Divide it! brute force greedy implementation *800	0 / 0	(None)
	2455	P1176C Lose it! dp greedy implementation *1300	0 / 0	(None)
	2452	P1176F Destroy it! dp implementation sortings *2100	0 / 0	(None)
	2451	P1177A Digits Sequence (Easy Edition) implementation *1000	0 / 0	(None)
	2450	P1177B Digits Sequence (Hard Edition) binary search divide and conquer implementation *1800	0 / 0	(None)
	2440	P1179A Valeriy and Deque data structures implementation *1500	0 / 0	(None)
	2438	P1179C Serge and Dining Room binary search data structures graph matchings greedy implementation math trees *2200	0 / 0	(None)
	2435	P1180A Alex and a Rhombus dp implementation math *800	0 / 0	(None)
	2434	P1180B Nick and Array greedy implementation *1500	0 / 0	(None)
	2432	P1181B Split a Number greedy implementation strings *1500	0 / 0	(None)
	2431	P1181C Flag brute force combinatorics dp implementation *1900	0 / 0	(None)
	2430	P1181D Irrigation binary search data structures implementation sortings trees two pointers *2200	0 / 0	(None)
	2426	P1182B Plus from Picture dfs and similar implementation strings *1300	0 / 0	(None)
	2424	P1182D Complete Mirror constructive algorithms dfs and similar dp hashing implementation trees *2400	0 / 0	(None)
	2421	P1183A Nearest Interesting Number implementation *800	0 / 0	(None)
	2417	P1183E Subsequences (easy version) dp graphs implementation shortest paths *2000	0 / 0	(None)
	2415	P1183G Candy Box (hard version) greedy implementation sortings *2000	0 / 0	(None)

Pick a problem randomly based on the current filter.