brute force - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	8199	P1790C Premutation brute force implementation math *1000	0 / 0	3
	8196	P1790F Timofey and Black-White Tree brute force dfs and similar divide and conquer graphs greedy math shortest paths trees *2100	0 / 0	7
	8191	P1791D Distinct Split brute force greedy strings *1000	0 / 0	3
	8189	P1791F Range Update Point Query binary search brute force data structures *1500	0 / 0	5
	8184	P1792C Min Max Sort binary search brute force greedy math two pointers *1500	0 / 0	5
	8182	P1792E Divisors and Table brute force dfs and similar dp number theory *2400	0 / 0	9
	8180	P1792F2 Graph Coloring (hard version) brute force combinatorics divide and conquer dp fft graphs *2900	0 / 0	10
	8239	P1793F Rebrending brute force data structures divide and conquer implementation *2600	0 / 0	10
	8238	P1795A Two Towers brute force implementation strings *800	0 / 0	3
	8237	P1795B Ideal Point brute force geometry greedy *900	0 / 0	3
	8274	P1796A Typical Interview Problem brute force implementation strings *800	0 / 0	3
	8269	P1796F Strange Triples brute force math number theory *2900	0 / 0	10
	8329	P1798B Three Sevens brute force data structures greedy implementation	0 / 0	(None)
	8326	P1798E Multitest Generator brute force dp	0 / 0	(None)
	8267	P1799B Equalize by Divide brute force constructive algorithms greedy math	0 / 0	(None)
	8262	P1799F Halve or Subtract binary search brute force dp greedy sortings	0 / 0	(None)
	8254	P1800E1 Unforgivable Curse (easy version) brute force constructive algorithms dsu graphs greedy	0 / 0	(None)
	8253	P1800E2 Unforgivable Curse (hard version) brute force constructive algorithms dsu graphs greedy	0 / 0	(None)
	8300	P1804C Pull Your Luck brute force greedy math number theory	0 / 0	(None)
	8299	P1804D Accommodation brute force greedy implementation	0 / 0	(None)

Pick a problem randomly based on the current filter.