Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3509	P660E Different Subsets For All Tuples combinatorics math *2300	0 / 0	(None)
	3510	P660F Bear and Bowling 4 binary search data structures divide and conquer geometry ternary search *2500	0 / 0	(None)
	3511	P661A Lazy Caterer Sequence special problem 1300	0 / 0	(None)
	3512	P661C Array Sum special problem 2000	0 / 0	(None)
	3513	P661D Maximal Difference special problem 2100	0 / 0	(None)
	3514	P661F Primes in Interval special problem 1900	0 / 0	(None)
	3515	P661G Hungarian Notation special problem 2200	0 / 0	(None)
	3516	P662A Gambling Nim bitmasks math matrices probabilities *2400	0 / 0	(None)
	3517	P662C Binary Table bitmasks brute force divide and conquer dp fft math *2600	0 / 0	(None)
	3518	P662D International Olympiad constructive algorithms greedy implementation math *2000	0 / 0	(None)
	3519	P663A Rebus constructive algorithms expression parsing greedy math *1800	0 / 0	(None)
	3520	P664A Complicated GCD math number theory *800	0 / 0	(None)
	3521	P665B Shopping brute force *1400	0 / 0	(None)
	3522	P665D Simple Subset constructive algorithms greedy number theory *1800	0 / 0	(None)
	3523	P665E Beautiful Subarrays data structures divide and conquer strings trees *2100	0 / 0	(None)
	3524	P666A Reberland Linguistics dp implementation strings *1800	0 / 0	(None)
	3525	P666C Codeword combinatorics strings *2500	0 / 0	(None)
	3526	P666D Chain Reaction brute force geometry *3000	0 / 0	(None)
	3527	P667A Pouring Rain geometry math *1100	0 / 0	(None)
	3528	P669A Little Artem and Presents math *800	0 / 0	(None)

Pick a problem randomly based on the current filter.