graphs - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	906	P1477D Nezzar and Hidden Permutations constructive algorithms dfs and similar graphs *2800	0 / 0	(None)
	889	P1481D AB Graph brute force constructive algorithms graphs greedy implementation *2000	0 / 0	(None)
	881	P1482F Useful Edges graphs shortest paths *2400	0 / 0	(None)
	875	P1485D Multiples and Power Differences constructive algorithms graphs math number theory *2200	0 / 0	(None)
	867	P1486E Paired Payment binary search brute force constructive algorithms dp flows graphs shortest paths *2200	0 / 0	(None)
	863	P1487C Minimum Ties brute force constructive algorithms dfs and similar graphs greedy implementation math *1500	0 / 0	(None)
	861	P1487E Cheap Dinner brute force data structures graphs greedy implementation sortings two pointers *2000	0 / 0	(None)
	835	P1491G Switch and Flip constructive algorithms graphs math *2800	0 / 0	(None)
	817	P1494E A-Z Graph constructive algorithms data structures graphs hashing *2400	0 / 0	(None)
	816	P1494F Delete The Edges brute force constructive algorithms dfs and similar graphs implementation *2900	0 / 0	(None)
	813	P1495C Garden of the Sun constructive algorithms graphs *2300	0 / 0	(None)
	812	P1495D BFS Trees combinatorics dfs and similar graphs math shortest paths trees *2600	0 / 0	(None)
	810	P1495F Squares constructive algorithms data structures dp graphs trees *3300	0 / 0	(None)
	803	P1497D Genius bitmasks dp graphs number theory *2500	0 / 0	(None)
	797	P1498D Bananas in a Microwave dfs and similar dp graphs implementation *2200	0 / 0	(None)
	796	P1498E Two Houses brute force graphs greedy interactive sortings *2200	0 / 0	(None)
	788	P1499G Graph Coloring data structures graphs interactive *3100	0 / 0	(None)
	774	P1503F Balance the Cards constructive algorithms data structures divide and conquer geometry graphs implementation *3500	0 / 0	(None)
	757	P1506F Triangular Paths constructive algorithms graphs math shortest paths sortings *2000	0 / 0	(None)
	753	P1508C Complete the MST bitmasks brute force data structures dfs and similar dsu graphs greedy trees *2500	0 / 0	(None)

Pick a problem randomly based on the current filter.