brute force - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2341	P1196A Three Piles of Candies brute force constructive algorithms math *800	0 / 0	(None)
	2335	P1196F K-th Path brute force constructive algorithms shortest paths sortings *2200	0 / 0	(None)
	2327	P1198B Welfare State binary search brute force data structures sortings *1600	0 / 0	(None)
	2320	P1200A Hotelier brute force data structures implementation *800	0 / 0	(None)
	2317	P1200D White Lines brute force data structures dp implementation two pointers *1900	0 / 0	(None)
	2316	P1200E Compress Words brute force hashing implementation string suffix structures strings *2000	0 / 0	(None)
	2315	P1200F Graph Traveler brute force data structures dfs and similar dp graphs implementation math number theory *2300	0 / 0	(None)
	2307	P1202B You Are Given a Decimal String... brute force dp shortest paths *1700	0 / 0	(None)
	2306	P1202C You Are Given a WASD-string... brute force data structures dp greedy implementation math strings *2100	0 / 0	(None)
	2304	P1202E You Are Given Some Strings... brute force string suffix structures strings *2400	0 / 0	(None)
	2291	P1204D1 Kirk and a Binary String (easy version) brute force greedy strings *2000	0 / 0	(None)
	2287	P1205B Shortest Cycle bitmasks brute force graphs shortest paths *1900	0 / 0	(None)
	2280	P1207A There Are Two Types Of Burgers brute force greedy implementation math *800	0 / 0	(None)
	2275	P1207F Remainder Problem brute force data structures implementation *2100	0 / 0	(None)
	2272	P1208B Uniqueness binary search brute force implementation two pointers *1500	0 / 0	(None)
	2261	P1209E1 Rotate Columns (easy version) bitmasks brute force dp greedy sortings *2000	0 / 0	(None)
	2255	P1210A Anadi and Domino brute force graphs *1700	0 / 0	(None)
	2254	P1210B Marcin and Training Camp brute force greedy *1700	0 / 0	(None)
	2250	P1210F1 Marek and Matching (easy version) brute force probabilities *3100	0 / 0	(None)
	2249	P1210F2 Marek and Matching (hard version) brute force probabilities *3200	0 / 0	(None)

Pick a problem randomly based on the current filter.