Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1978	P1267E Elections greedy *1700	0 / 0	(None)
	1977	P1267F __NO_TITLE__	0 / 0	(None)
	1976	P1267G Game Relics math probabilities *3000	0 / 0	(None)
	1975	P1267H Help BerLine constructive algorithms *3200	0 / 0	(None)
	1974	P1267I Intriguing Selection brute force constructive algorithms implementation interactive sortings *2600	0 / 0	(None)
	1973	P1267J Just Arrange the Icons greedy implementation math *1800	0 / 0	(None)
	1972	P1267K Key Storage combinatorics math *2100	0 / 0	(None)
	1971	P1267L Lexicography constructive algorithms strings *1800	0 / 0	(None)
	1970	P1268A Long Beautiful Integer constructive algorithms greedy implementation strings *1700	0 / 0	(None)
	1969	P1268B Domino for Young dp greedy math *2000	0 / 0	(None)
	1968	P1268C K Integers binary search data structures *2300	0 / 0	(None)
	1967	P1268D Invertation in Tournament brute force divide and conquer graphs math *3200	0 / 0	(None)
	1966	P1268E Happy Cactus dp *3400	0 / 0	(None)
	1965	P1269A Equation brute force math *800	0 / 0	(None)
	1964	P1269B Modulo Equality brute force sortings *1500	0 / 0	(None)
	1963	P1270A Card Game games greedy math *800	0 / 0	(None)
	1962	P1270B Interesting Subarray constructive algorithms greedy math *1200	0 / 0	(None)
	1961	P1270C Make Good bitmasks constructive algorithms math *1400	0 / 0	(None)
	1960	P1270D Strange Device constructive algorithms interactive math sortings *1900	0 / 0	(None)
	1959	P1270E Divide Points constructive algorithms geometry math *2300	0 / 0	(None)

Pick a problem randomly based on the current filter.