brute force - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	7742	P1695D1 Tree Queries (Easy Version) brute force constructive algorithms dfs and similar dp greedy trees *2200	0 / 0	(None)
	7734	P1696F Tree Recovery brute force constructive algorithms dfs and similar graphs trees	0 / 0	(None)
	7733	P1696G Fishingprince Plays With Array Again brute force data structures geometry math	0 / 0	(None)
	7732	P1696H Maximum Product? brute force combinatorics dp greedy implementation math two pointers	0 / 0	(None)
	7627	P1697E Coloring brute force combinatorics constructive algorithms geometry graphs greedy implementation math *2400	0 / 0	(None)
	7760	P1698A XOR Mixup bitmasks brute force *800	0 / 0	(None)
	7758	P1698C 3SUM Closure brute force data structures *1300	0 / 0	(None)
	7756	P1698E PermutationForces II brute force combinatorics constructive algorithms greedy sortings trees two pointers *2300	0 / 0	(None)
	7727	P1700E Serega the Pirate brute force constructive algorithms *2600	0 / 0	(None)
	7798	P1703A YES or YES? brute force implementation strings	0 / 0	(None)
	7796	P1703C Cypher brute force implementation strings	0 / 0	(None)
	7795	P1703D Double Strings brute force data structures strings	0 / 0	(None)
	7792	P1703G Good Key, Bad Key bitmasks brute force dp greedy math	0 / 0	(None)
	7846	P1704B Luke is a Foodie brute force greedy implementation *1000	0 / 0	(None)
	7843	P1704E Count Seconds brute force constructive algorithms dp graphs implementation math *2200	0 / 0	(None)
	7789	P1705C Mark and His Unfinished Essay brute force implementation	0 / 0	(None)
	7787	P1705E Mark and Professor Koro binary search bitmasks brute force combinatorics data structures greedy schedules	0 / 0	(None)
	7782	P1706D1 Chopping Carrots (Easy Version) binary search brute force constructive algorithms dp greedy number theory	0 / 0	(None)
	7778	P1707B Difference Array brute force data structures implementation sortings	0 / 0	(None)
	7838	P1709A Three Doors brute force greedy implementation math *800	0 / 0	(None)

Pick a problem randomly based on the current filter.