*2600 - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3517	P662C Binary Table bitmasks brute force divide and conquer dp fft math *2600	0 / 0	(None)
	3560	P682E Alyona and Triangles geometry two pointers *2600	0 / 0	(None)
	3583	P690B3 Recover Polygon (hard) data structures *2600	0 / 0	(None)
	3599	P698D Limak and Shooting Points brute force geometry math *2600	0 / 0	(None)
	3603	P700C Break Up dfs and similar graphs *2600	0 / 0	(None)
	3612	P703E Mishka and Divisors dp number theory *2600	0 / 0	(None)
	3665	P724G Xor-matic Number of the Graph bitmasks graphs math number theory trees *2600	0 / 0	(None)
	3709	P741C Arpa’s overnight party and Mehrdad’s silent entering constructive algorithms dfs and similar graphs *2600	0 / 0	(None)
	3735	P750E New Year and Old Subsequence data structures divide and conquer dp matrices *2600	0 / 0	(None)
	3741	P754E Dasha and cyclic table bitmasks brute force fft strings trees *2600	0 / 0	(None)
	3761	P761F Dasha and Photos brute force data structures dp implementation *2600	0 / 0	(None)
	3767	P763C Timofey and remoduling brute force implementation math number theory *2600	0 / 0	(None)
	3859	P797F Mice and Holes data structures dp greedy sortings *2600	0 / 0	(None)
	3869	P802C Heidi and Library (hard) flows *2600	0 / 0	(None)
	3894	P809C Find a car combinatorics divide and conquer dp *2600	0 / 0	(None)
	3904	P813D Two Melodies dp flows *2600	0 / 0	(None)
	3909	P814E An unavoidable detour for home combinatorics dp graphs shortest paths *2600	0 / 0	(None)
	3920	P818G Four Melodies flows graphs *2600	0 / 0	(None)
	3947	P832E Vasya and Shifts matrices *2600	0 / 0	(None)
	3992	P848C Goodbye Souvenir data structures divide and conquer *2600	0 / 0	(None)

Pick a problem randomly based on the current filter.