Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2558	P1154E Two Teams data structures implementation sortings *1800	0 / 0	(None)
	2557	P1154F Shovels Shop dp greedy sortings *2100	0 / 0	(None)
	2556	P1154G Minimum Possible LCM brute force greedy math number theory *2200	0 / 0	(None)
	2555	P1155A Reverse a Substring implementation sortings strings *1000	0 / 0	(None)
	2554	P1155B Game with Telephone Numbers games greedy implementation *1200	0 / 0	(None)
	2553	P1155C Alarm Clocks Everywhere math number theory *1300	0 / 0	(None)
	2552	P1155D Beautiful Array brute force data structures divide and conquer dp greedy *1900	0 / 0	(None)
	2551	P1155E Guess the Root brute force interactive math *2200	0 / 0	(None)
	2550	P1155F Delivery Oligopoly brute force dp graphs *2800	0 / 0	(None)
	2549	P1156A Inscribed Figures geometry *1400	0 / 0	(None)
	2548	P1156B Ugly Pairs dfs and similar greedy implementation sortings strings *1800	0 / 0	(None)
	2547	P1156C Match Points binary search greedy sortings ternary search two pointers *2000	0 / 0	(None)
	2546	P1156D 0-1-Tree dfs and similar divide and conquer dp dsu trees *2200	0 / 0	(None)
	2545	P1156E Special Segments of Permutation data structures divide and conquer dsu two pointers *2200	0 / 0	(None)
	2544	P1156F Card Bag dp math probabilities *2300	0 / 0	(None)
	2543	P1156G Optimizer graphs greedy hashing implementation *2700	0 / 0	(None)
	2542	P1157A Reachable Numbers implementation *1100	0 / 0	(None)
	2541	P1157B Long Number greedy *1300	0 / 0	(None)
	2540	P1157C1 Increasing Subsequence (easy version) greedy *1300	0 / 0	(None)
	2539	P1157C2 Increasing Subsequence (hard version) greedy *1700	0 / 0	(None)

Pick a problem randomly based on the current filter.