*2200 - 题库 - CZOJ

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	8417	P7D Palindrome Degree hashing strings *2200	0 / 0	8
	8398	P11C How Many Squares? implementation *2200	0 / 0	8
	8397	P11D A Simple Task bitmasks dp graphs *2200	0 / 0	8
	8388	P13C Sequence dp sortings *2200	0 / 0	8
	8358	P19C Deletion of Repeats greedy hashing string suffix structures *2200	0 / 0	8
	8329	P25E Test hashing strings *2200	0 / 0	8
	8320	P27D Ring Road 2 2-sat dfs and similar dsu graphs *2200	0 / 0	8
	8316	P28C Bath Queue combinatorics dp probabilities *2200	0 / 0	8
	8276	P36C Bowls geometry implementation *2200	0 / 0	8
	8237	P42C Safe cracking brute force constructive algorithms *2200	0 / 0	8
	8218	P45B School dp dsu *2200	0 / 0	8
	8213	P45G Prime Problem number theory *2200	0 / 0	8
	8199	P47D Safe brute force *2200	0 / 0	8
	8198	P47E Cannon data structures geometry sortings *2200	0 / 0	8
	8176	P51D Geometrical problem implementation *2200	0 / 0	8
	8171	P52C Circular RMQ data structures *2200	0 / 0	8
	8151	P56E Domino Principle binary search data structures sortings *2200	0 / 0	8
	8109	P64G Path Canonization special problem 2200	0 / 0	8
	8103	P65D Harry Potter and the Sorting Hat brute force dfs and similar hashing *2200	0 / 0	8
	8089	P68C Synchrophasotron brute force *2200	0 / 0	8
	8079	P70C Lucky Tickets binary search data structures sortings two pointers *2200	0 / 0	8
	8073	P71D Solitaire brute force implementation *2200	0 / 0	8
	8072	P71E Nuclear Fusion bitmasks dp *2200	0 / 0	8
	8070	P72B INI-file special problem implementation 2200	0 / 0	8
	8059	P73D FreeDiv dfs and similar graphs greedy *2200	0 / 0	8
	8046	P76A Gift dsu graphs sortings trees *2200	0 / 0	8
	8004	P85C Petya and Tree binary search dfs and similar probabilities sortings trees *2200	0 / 0	8
	8000	P86B Tetris revisited constructive algorithms graph matchings greedy math *2200	0 / 0	8
	7998	P86D Powerful array data structures implementation math two pointers *2200	0 / 0	8
	7957	P97E Leaders dfs and similar dsu graphs trees *2200	0 / 0	8
	7955	P98B Help King implementation probabilities trees *2200	0 / 0	8
	7924	P105C Item World brute force implementation sortings *2200	0 / 0	8
	7893	P113C Double Happiness brute force math number theory *2200	0 / 0	8
	7886	P115C Plumber math *2200	0 / 0	8
	7858	P120I Luck is in Numbers greedy *2200	0 / 0	8
	7839	P125D Two progressions constructive algorithms greedy *2200	0 / 0	8
	7798	P134C Swaps constructive algorithms graphs greedy *2200	0 / 0	8
	7783	P138C Mushroom Gnomes - 2 binary search data structures probabilities sortings *2200	0 / 0	8
	7756	P144E Competition data structures greedy *2200	0 / 0	8
	7734	P150C Smart Cheater data structures math probabilities *2200	0 / 0	8
	7722	P153C Caesar Cipher special problem 2200	0 / 0	8
	7661	P165E Compatible Numbers bitmasks brute force dfs and similar dp *2200	0 / 0	8
	7634	P172E BHTML+BCSS special problem dfs and similar expression parsing 2200	0 / 0	8
	7584	P178F2 Representative Sampling dp sortings strings *2200	0 / 0	8
	7574	P182A Battlefield geometry graphs implementation shortest paths *2200	0 / 0	8
	7567	P183C Cyclic Coloring dfs and similar *2200	0 / 0	8
	7533	P191E Thwarting Demonstrations binary search data structures trees *2200	0 / 0	8
	7516	P196C Paint Tree constructive algorithms divide and conquer geometry sortings trees *2200	0 / 0	8
	7473	P207C2 Game with Two Trees *2200	0 / 0	8
	7420	P219E Parking Lot data structures *2200	0 / 0	8

根据当前过滤条件随机选择一道题