Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	4792	P661C Array Sum special problem 2000	0 / 0	(None)
	4791	P661D Maximal Difference special problem 2100	0 / 0	(None)
	4790	P661E Divisibility Check special problem 2000	0 / 0	(None)
	4789	P661F Primes in Interval special problem 1900	0 / 0	(None)
	4788	P661G Hungarian Notation special problem 2200	0 / 0	(None)
	4787	P661H Rotate Matrix special problem 2400	0 / 0	(None)
	4786	P662A Gambling Nim bitmasks math matrices probabilities *2400	0 / 0	(None)
	4785	P662B Graph Coloring dfs and similar graphs *2200	0 / 0	(None)
	4784	P662C Binary Table bitmasks brute force divide and conquer dp fft math *2600	0 / 0	(None)
	4783	P662D International Olympiad constructive algorithms greedy implementation math *2000	0 / 0	(None)
	4782	P662E To Hack or not to Hack brute force dp greedy *3100	0 / 0	(None)
	4781	P663A Rebus constructive algorithms expression parsing greedy math *1800	0 / 0	(None)
	4780	P664A Complicated GCD math number theory *800	0 / 0	(None)
	4779	P665A Buses Between Cities implementation *1600	0 / 0	(None)
	4778	P665B Shopping brute force *1400	0 / 0	(None)
	4777	P665C Simple Strings dp greedy strings *1300	0 / 0	(None)
	4776	P665D Simple Subset constructive algorithms greedy number theory *1800	0 / 0	(None)
	4775	P665E Beautiful Subarrays data structures divide and conquer strings trees *2100	0 / 0	(None)
	4774	P665F Four Divisors data structures dp math number theory sortings two pointers *2400	0 / 0	(None)
	4773	P666A Reberland Linguistics dp implementation strings *1800	0 / 0	(None)

Pick a problem randomly based on the current filter.