brute force - 题库 - CZOJ

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	191	P1765E Exchange brute force math *1000	0 / 0	普及/提高-
	184	P1765L Project Manager brute force data structures implementation *2400	0 / 0	9
	181	P1766A Extremely Round brute force implementation *800	0 / 0	普及/提高-
	177	P1766E Decomposition binary search brute force data structures divide and conquer dp two pointers *2300	0 / 0	8
	171	P1767E Algebra Flash bitmasks brute force dp graphs math meet-in-the-middle trees *2500	0 / 0	9
	163	P1770A Koxia and Whiteboards brute force greedy *1000	0 / 0	普及/提高-
	161	P1770C Koxia and Number Theory brute force chinese remainder theorem math number theory *1700	0 / 0	提高+/省选-
	152	P1771D Hossam and (sub-)palindromic tree brute force data structures dfs and similar dp strings trees *2100	0 / 0	NOI/NOI+/CTSC
	151	P1771E Hossam and a Letter brute force dp implementation two pointers *2500	0 / 0	9
	141	P1773I Interactive Factorial Guessing brute force games implementation interactive *2500	0 / 0	9
	134	P1774D Same Count One brute force constructive algorithms greedy implementation two pointers *1600	0 / 0	提高+/省选-
	132	P1774F1 Magician and Pigs (Easy Version) brute force data structures implementation *2400	0 / 0	9
	131	P1774F2 Magician and Pigs (Hard Version) binary search brute force data structures implementation *2700	0 / 0	10
	130	P1774G Segment Covering brute force combinatorics constructive algorithms data structures dp trees *3200	0 / 0	10
	128	P1775A1 Gardener and the Capybaras (easy version) brute force constructive algorithms implementation *800	0 / 0	普及/提高-
	99	P1778C Flexible String bitmasks brute force strings *1600	0 / 0	提高+/省选-
	88	P1779H Olympic Team Building brute force meet-in-the-middle *3500	0 / 0	10
	86	P1780B GCD Partition brute force greedy math number theory *1100	0 / 0	普及/提高-
	84	P1780E Josuke and Complete Graph binary search brute force data structures math number theory *2400	0 / 0	9
	83	P1780F Three Chairs bitmasks brute force combinatorics data structures dp number theory sortings *2300	0 / 0	8
	80	P1781B Going to the Cinema brute force greedy sortings *1000	0 / 0	普及/提高-
	79	P1781C Equal Frequencies brute force constructive algorithms greedy implementation sortings strings *1600	0 / 0	提高+/省选-
	78	P1781D Many Perfect Squares brute force math number theory *1800	0 / 0	省选/NOI-
	77	P1781E Rectangle Shrinking binary search brute force data structures greedy implementation two pointers *2300	0 / 0	8
	69	P1783D Different Arrays brute force dp implementation *2000	0 / 0	NOI/NOI+/CTSC
	68	P1783E Game of the Year brute force data structures math number theory *2300	0 / 0	8
	65	P1784A Monsters (easy version) brute force greedy *1000	0 / 0	普及/提高-
	61	P1784E Infinite Game brute force combinatorics dp games probabilities *3100	0 / 0	10
	57	P1786B Cake Assembly Line brute force sortings *1300	0 / 0	普及+/提高
	50	P1787G Colorful Tree Again brute force data structures trees *3000	0 / 0	10
	47	P1788A One and Two brute force implementation math *800	0 / 0	普及/提高-
	44	P1788D Moving Dots binary search brute force combinatorics math two pointers *2000	0 / 0	NOI/NOI+/CTSC
	41	P1789A Serval and Mocha's Array brute force math number theory	0 / 0	暂无评定
	40	P1789B Serval and Inversion Magic brute force implementation strings two pointers	0 / 0	暂无评定
	38	P1789D Serval and Shift-Shift-Shift bitmasks brute force constructive algorithms implementation	0 / 0	暂无评定
	37	P1789E Serval and Music Game brute force implementation math number theory	0 / 0	暂无评定
	36	P1789F Serval and Brain Power bitmasks brute force dp greedy implementation strings	0 / 0	暂无评定
	33	P1790C Premutation brute force implementation math *1000	0 / 0	普及/提高-
	30	P1790F Timofey and Black-White Tree brute force dfs and similar divide and conquer graphs greedy math shortest paths trees *2100	0 / 0	NOI/NOI+/CTSC
	25	P1791D Distinct Split brute force greedy strings *1000	0 / 0	普及/提高-
	23	P1791F Range Update Point Query binary search brute force data structures *1500	0 / 0	提高+/省选-
	18	P1792C Min Max Sort binary search brute force greedy math two pointers *1500	0 / 0	提高+/省选-
	16	P1792E Divisors and Table brute force dfs and similar dp number theory *2400	0 / 0	9
	14	P1792F2 Graph Coloring (hard version) brute force combinatorics divide and conquer dp fft graphs *2900	0 / 0	10
	8	P1793F Rebrending brute force data structures divide and conquer implementation *2600	0 / 0	10
	7	P1795A Two Towers brute force implementation strings *800	0 / 0	普及/提高-
	6	P1795B Ideal Point brute force geometry greedy *900	0 / 0	普及/提高-
	3500	P1796C Maximum Set binary search brute force combinatorics dp math	0 / 0	暂无评定
	8527	P1798B Three Sevens brute force data structures greedy implementation *1000	0 / 0	普及/提高-
	8524	P1798E Multitest Generator brute force dp *2300	0 / 0	8

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