Problem Set - 追梦算法网

ID	Problem Show tags Hide tags	AC / Tried	Difficulty
1913	P22B Bargaining Table brute force dp *1500	0 / 0	(None)
1914	P22D Segments greedy sortings *1900	0 / 0	(None)
1915	P23A You're Given a String... brute force greedy *1200	0 / 0	(None)
1916	P23C Oranges and Apples constructive algorithms sortings *2500	0 / 0	(None)
1917	P23E Tree dp *2500	0 / 0	(None)
1918	P24A Ring road graphs *1400	0 / 0	(None)
1919	P24C Sequence of points geometry implementation math *1800	0 / 0	(None)
1920	P24E Berland collider binary search *2300	0 / 0	(None)
1921	P25A IQ test brute force *1300	0 / 0	(None)
1922	P25C Roads in Berland graphs shortest paths *1900	0 / 0	(None)
1923	P25D Roads not only in Berland dsu graphs trees *1900	0 / 0	(None)
1924	P26A Almost Prime number theory *900	16 / 42	5
1925	P26B Regular Bracket Sequence greedy *1400	0 / 0	(None)
1926	P26D Tickets combinatorics math probabilities *2400	0 / 0	(None)
1927	P26E Multithreading constructive algorithms *2400	0 / 0	(None)
1928	P27A Next Test implementation sortings *1200	0 / 0	(None)
1929	P27C Unordered Subsequence constructive algorithms greedy *1900	0 / 0	(None)
1930	P27D Ring Road 2 2-sat dfs and similar dsu graphs *2200	0 / 0	(None)
1931	P28A Bender Problem implementation *1600	0 / 0	(None)
1932	P28C Bath Queue combinatorics dp probabilities *2200	0 / 0	(None)

Pick a problem randomly based on the current filter.

Categories