Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1998	P1264C Beautiful Mirrors with queries data structures probabilities *2400	0 / 0	(None)
	1997	P1264D1 Beautiful Bracket Sequence (easy version) combinatorics dp probabilities *2600	0 / 0	(None)
	1996	P1264D2 Beautiful Bracket Sequence (hard version) combinatorics probabilities *2900	0 / 0	(None)
	1995	P1264E Beautiful League constructive algorithms flows graph matchings *2700	0 / 0	(None)
	1994	P1264F Beautiful Fibonacci Problem constructive algorithms number theory *3500	0 / 0	(None)
	1993	P1265A Beautiful String constructive algorithms greedy *1000	0 / 0	(None)
	1992	P1265B Beautiful Numbers data structures implementation math two pointers *1300	0 / 0	(None)
	1991	P1265E Beautiful Mirrors data structures dp math probabilities *2100	0 / 0	(None)
	1990	P1266A Competitive Programmer chinese remainder theorem math *1000	0 / 0	(None)
	1989	P1266B Dice Tower constructive algorithms math *1000	0 / 0	(None)
	1988	P1266C Diverse Matrix constructive algorithms greedy math number theory *1400	0 / 0	(None)
	1987	P1266D Decreasing Debts constructive algorithms data structures graphs greedy implementation math two pointers *2000	0 / 0	(None)
	1986	P1266E Spaceship Solitaire data structures greedy implementation *2100	0 / 0	(None)
	1985	P1266F Almost Same Distance dfs and similar graphs *2900	0 / 0	(None)
	1984	P1266G Permutation Concatenation string suffix structures *3300	0 / 0	(None)
	1983	P1266H Red-Blue Graph dp graphs math matrices meet-in-the-middle *3400	0 / 0	(None)
	1982	P1267A __NO_TITLE__	0 / 0	(None)
	1981	P1267B Balls of Buma *900	0 / 0	(None)
	1980	P1267C __NO_TITLE__	0 / 0	(None)
	1979	P1267D DevOps Best Practices constructive algorithms *2800	0 / 0	(None)

Pick a problem randomly based on the current filter.