	ID	题目显示标签隐藏标签	AC / 尝试	难度
	7180	P9D How many trees? combinatorics divide and conquer dp *1900	0 / 0	(无)
	7129	P19E Fairy dfs and similar divide and conquer dsu *2900	0 / 0	(无)
	6861	P68D Half-decay tree data structures divide and conquer dp math probabilities *2500	0 / 0	(无)
	6733	P97B Superset constructive algorithms divide and conquer *2300	0 / 0	(无)
	6708	P101E Candies and Stones divide and conquer dp *2500	0 / 0	(无)
	6651	P117D Not Quick Transformation divide and conquer math *2500	0 / 0	(无)
	6650	P117E Tree or not Tree data structures divide and conquer implementation trees *2900	0 / 0	(无)
	6630	P120J Minimum Sum divide and conquer geometry sortings *1900	0 / 0	(无)
	6505	P150E Freezing with Style binary search data structures divide and conquer trees *3000	0 / 0	(无)
	6461	P161C Abracadabra divide and conquer *2400	0 / 0	(无)
	6425	P167D Wizards and Roads data structures divide and conquer graph matchings graphs greedy *3000	0 / 0	(无)
	6289	P196C Paint Tree constructive algorithms divide and conquer geometry sortings trees *2200	0 / 0	(无)
	6202	P217C Formurosa divide and conquer dp expression parsing *2600	0 / 0	(无)
	6142	P232C Doe Graphs constructive algorithms divide and conquer dp graphs shortest paths *2600	0 / 0	(无)
	6140	P232E Quick Tortoise bitmasks divide and conquer dp *3000	0 / 0	(无)
	6131	P234G Practice constructive algorithms divide and conquer implementation *1600	0 / 0	(无)
	5890	P293E Close Vertices data structures divide and conquer trees *2700	0 / 0	(无)
	5782	P321C Ciel the Commander constructive algorithms dfs and similar divide and conquer greedy trees *2100	0 / 0	(无)
	5780	P321E Ciel and Gondolas data structures divide and conquer dp *2600	0 / 0	(无)
	5717	P337D Book of Evil dfs and similar divide and conquer dp trees *2000	0 / 0	(无)
	5697	P342E Xenia and Tree data structures divide and conquer trees *2400	0 / 0	(无)
	5692	P343E Pumping Stations brute force dfs and similar divide and conquer flows graphs greedy trees *2900	0 / 0	(无)
	5606	P364E Empty Rectangles divide and conquer two pointers *3000	0 / 0	(无)
	5575	P372B Counting Rectangles is Fun brute force divide and conquer dp *1900	0 / 0	(无)
	5545	P379F New Year Tree data structures divide and conquer trees *2400	0 / 0	(无)
	5527	P383E Vowels combinatorics divide and conquer dp *2700	0 / 0	(无)
	5403	P413E Maze 2D data structures divide and conquer *2200	0 / 0	(无)
	5400	P414C Mashmokh and Reverse Operation combinatorics divide and conquer *2100	0 / 0	(无)
	5356	P429D Tricky Function data structures divide and conquer geometry *2200	0 / 0	(无)
	5336	P434E Furukawa Nagisa's Tree binary search divide and conquer sortings trees *3000	0 / 0	(无)
	5318	P438E The Child and Binary Tree combinatorics divide and conquer fft number theory *3100	0 / 0	(无)
	5310	P440C One-Based Arithmetic brute force dfs and similar divide and conquer *1800	0 / 0	(无)
	5280	P448C Painting Fence divide and conquer dp greedy *1900	0 / 0	(无)
	5260	P452F Permutation data structures divide and conquer hashing *2700	0 / 0	(无)
	5236	P459D Pashmak and Parmida's problem data structures divide and conquer sortings *1800	0 / 0	(无)
	5143	P480E Parking Lot data structures divide and conquer *2800	0 / 0	(无)
	5065	P500F New Year Shopping divide and conquer dp *2700	0 / 0	(无)
	5027	P512E Fox And Polygon constructive algorithms divide and conquer *2900	0 / 0	(无)
	5024	P513B2 Permutations bitmasks divide and conquer math *1800	0 / 0	(无)
	4959	P526F Pudding Monsters data structures divide and conquer *3000	0 / 0	(无)
	4922	P536E Tavas on the Path data structures divide and conquer trees *3100	0 / 0	(无)
	4873	P549F Yura and Developers data structures divide and conquer *2800	0 / 0	(无)
	4830	P559B Equivalent Strings divide and conquer hashing sortings strings *1700	0 / 0	(无)
	4822	P566C Logistical Questions dfs and similar divide and conquer trees *3000	0 / 0	(无)
	4789	P573D Bear and Cavalry data structures divide and conquer dp *3000	0 / 0	(无)
	4774	P576C Points on Plane constructive algorithms divide and conquer geometry greedy sortings *2100	0 / 0	(无)
	4662	P603E Pastoral Oddities data structures divide and conquer dsu math trees *3000	0 / 0	(无)
	4617	P613D Kingdom and its Cities dfs and similar divide and conquer dp graphs sortings trees *2800	0 / 0	(无)
	4552	P627C Package Delivery data structures divide and conquer greedy *2200	0 / 0	(无)
	4510	P632E Thief in a Shop divide and conquer dp fft math *2400	0 / 0	(无)
	4509	P632F Magic Matrix brute force divide and conquer graphs matrices trees *2400	0 / 0	(无)
	4409	P662C Binary Table bitmasks brute force divide and conquer dp fft math *2600	0 / 0	(无)
	4400	P665E Beautiful Subarrays data structures divide and conquer strings trees *2100	0 / 0	(无)
	4354	P678F Lena and Queries data structures divide and conquer geometry *2500	0 / 0	(无)
	4322	P685E Travelling Through the Snow Queen's Kingdom bitmasks brute force divide and conquer graphs *2800	0 / 0	(无)
	4200	P715C Digit Tree dfs and similar divide and conquer dsu trees *2700	0 / 0	(无)
	4066	P744B Hongcow's Game bitmasks divide and conquer interactive *1900	0 / 0	(无)
	4032	P750E New Year and Old Subsequence data structures divide and conquer dp matrices *2600	0 / 0	(无)
	4014	P755G PolandBall and Many Other Balls combinatorics divide and conquer dp fft math number theory *3200	0 / 0	(无)
	4001	P757G Can Bash Save the Day? data structures divide and conquer graphs trees *3400	0 / 0	(无)
	3976	P763E Timofey and our friends animals data structures divide and conquer dsu *2900	0 / 0	(无)
	3955	P768B Code For 1 constructive algorithms dfs and similar divide and conquer *1600	0 / 0	(无)
	3931	P772E Verifying Kingdom binary search divide and conquer interactive trees *3200	0 / 0	(无)
	3925	P773F Test Data Generation combinatorics divide and conquer dp fft math number theory *3400	0 / 0	(无)
	3906	P776F Sherlock's bet to Moriarty constructive algorithms data structures divide and conquer geometry graphs implementation trees *2800	0 / 0	(无)
	3869	P786C Till I Collapse data structures divide and conquer *2400	0 / 0	(无)
	3861	P788D Finding lines constructive algorithms divide and conquer interactive *3000	0 / 0	(无)
	3845	P793F Julia the snail data structures divide and conquer dp *3000	0 / 0	(无)
	3844	P793G Oleg and chess data structures divide and conquer flows graph matchings *3400	0 / 0	(无)
	3769	P809C Find a car combinatorics divide and conquer dp *2600	0 / 0	(无)
	3767	P809E Surprise me! divide and conquer math number theory trees *3100	0 / 0	(无)
	3733	P817D Imbalanced Array data structures divide and conquer dsu sortings *1900	0 / 0	(无)
	3676	P833B The Bakery binary search data structures divide and conquer dp two pointers *2200	0 / 0	(无)
	3674	P833D Red-Black Cobweb data structures divide and conquer implementation trees *2800	0 / 0	(无)
	3635	P842E Nikita and game binary search dfs and similar divide and conquer graphs trees *2800	0 / 0	(无)
	3599	P848C Goodbye Souvenir data structures divide and conquer *2600	0 / 0	(无)
	3597	P848E Days of Floral Colours combinatorics divide and conquer dp fft math *3400	0 / 0	(无)
	3590	P850E Random Elections bitmasks brute force divide and conquer fft math *2800	0 / 0	(无)
	3540	P862D Mahmoud and Ehab and the binary string binary search divide and conquer interactive *2000	0 / 0	(无)
	3519	P865F Egg Roulette bitmasks brute force divide and conquer math meet-in-the-middle *3300	0 / 0	(无)
	3511	P868F Yet Another Minimization Problem divide and conquer dp *2500	0 / 0	(无)
	3494	P873D Merge Sort constructive algorithms divide and conquer *1800	0 / 0	(无)
	3488	P875D High Cry binary search bitmasks combinatorics data structures divide and conquer *2200	0 / 0	(无)
	3435	P888E Maximum Subsequence bitmasks divide and conquer meet-in-the-middle *1800	0 / 0	(无)
	3322	P914E Palindromes in a Tree bitmasks data structures divide and conquer trees *2400	0 / 0	(无)
	3320	P914G Sum the Fibonacci bitmasks divide and conquer dp fft math *2600	0 / 0	(无)
	3111	P960E Alternating Tree combinatorics dfs and similar divide and conquer dp probabilities trees *2300	0 / 0	(无)
	3040	P981E Addition on Segments bitmasks data structures divide and conquer dp *2200	0 / 0	(无)
	2990	P990G GCD Counting divide and conquer dp dsu number theory trees *2400	0 / 0	(无)
	2966	P995E Number Clicker divide and conquer graphs meet-in-the-middle number theory *2700	0 / 0	(无)
	2959	P997D Cycles in product combinatorics divide and conquer trees *2900	0 / 0	(无)
	2944	P1000F One Occurrence data structures divide and conquer *2400	0 / 0	(无)
	2907	P1004F Sonya and Bitwise OR bitmasks data structures divide and conquer *2600	0 / 0	(无)
	2837	P1019E Raining season data structures divide and conquer trees *3200	0 / 0	(无)
	2734	P1041F Ray in the tube data structures divide and conquer dp math *2500	0 / 0	(无)
	2730	P1042D Petya and Array data structures divide and conquer two pointers *1800	0 / 0	(无)
	2721	P1043G Speckled Band data structures divide and conquer hashing string suffix structures strings *3500	0 / 0	(无)
	2599	P1070M Algoland and Berland constructive algorithms divide and conquer geometry *3000	0 / 0	(无)
	2469	P1096G Lucky Tickets divide and conquer dp fft *2400	0 / 0	(无)
	2445	P1100F Ivan and Burgers data structures divide and conquer greedy math *2500	0 / 0	(无)

HGNU

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

状态

支持

开发与维护

杨旭龙、王树淳、王国斌、宋文宇、朱天伦

特别鸣谢

肖飞、关玉蓉、魏银珍、周芬

Worker 0, 104ms
Powered by Hydro v4.13.4
Modified by HGNU ACM TEAM (Repo Link)