Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1818	P1299C Water Balance data structures geometry greedy *2100	0 / 0	(None)
	1817	P1299D Around the World bitmasks combinatorics dfs and similar dp graphs graphs math trees *3000	0 / 0	(None)
	1816	P1299E So Mean interactive math *3400	0 / 0	(None)
	1815	P1300A Non-zero implementation math *800	0 / 0	(None)
	1814	P1300B Assigning to Classes greedy implementation sortings *1000	0 / 0	(None)
	1813	P1301A Three Strings implementation strings *800	0 / 0	(None)
	1812	P1301B Motarack's Birthday binary search greedy ternary search *1500	0 / 0	(None)
	1811	P1301C Ayoub's function binary search combinatorics greedy math strings *1700	0 / 0	(None)
	1810	P1301D Time to Run constructive algorithms graphs implementation *2000	0 / 0	(None)
	1809	P1301E Nanosoft binary search data structures dp implementation *2500	0 / 0	(None)
	1808	P1301F Super Jaber dfs and similar graphs implementation shortest paths *2600	0 / 0	(None)
	1807	P1302A Nash equilibrium	0 / 0	(None)
	1806	P1302B DAG constructive algorithms	0 / 0	(None)
	1805	P1302C Segment tree or Fenwick? data structures	0 / 0	(None)
	1804	P1302D Dijkstra	0 / 0	(None)
	1803	P1302E Amazing bitset	0 / 0	(None)
	1802	P1302F Keep talking and nobody explodes – easy bitmasks brute force expression parsing	0 / 0	(None)
	1801	P1302G Keep talking and nobody explodes – medium	0 / 0	(None)
	1800	P1302H Who needs suffix structures?	0 / 0	(None)
	1799	P1302I Deja vu	0 / 0	(None)

Pick a problem randomly based on the current filter.