Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	4592	P1107B Digital root math number theory *1000	0 / 0	(None)
	4593	P1107D Compression dp implementation math number theory *1800	0 / 0	(None)
	4594	P1107F Vasya and Endless Credits dp flows graph matchings graphs sortings *2600	0 / 0	(None)
	4595	P1107G Vasya and Maximum Profit binary search constructive algorithms data structures dp dsu *2400	0 / 0	(None)
	112	P1108 街上的树贪心	42 / 201	7
	4596	P1108A Two distinct points implementation *800	0 / 0	(None)
	4597	P1108C Nice Garland brute force greedy math *1300	0 / 0	(None)
	4598	P1108D Diverse Garland constructive algorithms dp greedy *1400	0 / 0	(None)
	4599	P1108E2 Array and Segments (Hard version) data structures implementation *2100	0 / 0	(None)
	4600	P1108F MST Unification binary search dsu graphs greedy *2100	0 / 0	(None)
	113	P1109 Dividing a String 贪心	36 / 122	6
	4601	P1109B Sasha and One More Name constructive algorithms hashing strings *1800	0 / 0	(None)
	4602	P1109D Sasha and Interesting Fact from Graph Theory brute force combinatorics dp math trees *2400	0 / 0	(None)
	4603	P1109E Sasha and a Very Easy Test data structures number theory *2700	0 / 0	(None)
	126	P1110 Alice and Bob 博弈论 SG定理多校训练牛客多校	2 / 9	10
	4604	P1110A Parity math *900	0 / 0	(None)
	4605	P1110B Tape greedy sortings *1400	0 / 0	(None)
	4606	P1110D Jongmah dp *2200	0 / 0	(None)
	4607	P1110F Nearest Leaf data structures trees *2600	0 / 0	(None)
	4608	P1110H Modest Substrings dp strings *3500	0 / 0	(None)

Pick a problem randomly based on the current filter.