brute force - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	675	P1520G To Go Or Not To Go? brute force dfs and similar graphs greedy implementation shortest paths *2200	0 / 0	(None)
	667	P1523C Compression and Expansion brute force data structures greedy implementation trees *1600	0 / 0	(None)
	666	P1523D Love-Hate bitmasks brute force dp probabilities *2400	0 / 0	(None)
	656	P1525F Goblins And Gnomes brute force dp flows graph matchings *2800	0 / 0	(None)
	653	P1526C1 Potions (Easy Version) brute force data structures dp greedy *1500	0 / 0	(None)
	651	P1526D Kill Anton brute force constructive algorithms data structures math strings *2200	0 / 0	(None)
	632	P1530C Pursuit binary search brute force greedy sortings *1200	0 / 0	(None)
	620	P1531E2 Сортировка слиянием special problem special problem brute force	0 / 0	(None)
	602	P1534A Colour the Flag brute force implementation *800	0 / 0	(None)
	593	P1535A Fair Playoff brute force implementation *800	0 / 0	(None)
	592	P1535B Array Reodering brute force greedy math number theory sortings *900	0 / 0	(None)
	588	P1535F String Distance binary search brute force data structures hashing implementation strings *3000	0 / 0	(None)
	587	P1536A Omkar and Bad Story brute force constructive algorithms *800	0 / 0	(None)
	586	P1536B Prinzessin der Verurteilung brute force constructive algorithms strings *1200	0 / 0	(None)
	577	P1537E1 Erase and Extend (Easy Version) binary search brute force dp greedy hashing implementation string suffix structures strings two pointers *1600	0 / 0	(None)
	574	P1538A Stone Game brute force dp greedy *800	0 / 0	(None)
	560	P1540B Tree Array brute force combinatorics dp graphs math probabilities trees *2300	0 / 0	(None)
	557	P1540D Inverse Inversions binary search brute force data structures *3200	0 / 0	(None)
	554	P1541B Pleasant Pairs brute force implementation math number theory *1200	0 / 0	(None)
	545	P1543C Need for Pink Slips bitmasks brute force dfs and similar implementation math probabilities *1900	0 / 0	(None)

Pick a problem randomly based on the current filter.