divide and conquer - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	9728	P9D How many trees? combinatorics divide and conquer dp *1900	0 / 0	6
	9677	P19E Fairy dfs and similar divide and conquer dsu *2900	0 / 0	10
	9409	P68D Half-decay tree data structures divide and conquer dp math probabilities *2500	0 / 0	9
	9281	P97B Superset constructive algorithms divide and conquer *2300	0 / 0	8
	9256	P101E Candies and Stones divide and conquer dp *2500	0 / 0	9
	9199	P117D Not Quick Transformation divide and conquer math *2500	0 / 0	9
	9198	P117E Tree or not Tree data structures divide and conquer implementation trees *2900	0 / 0	10
	9178	P120J Minimum Sum divide and conquer geometry sortings *1900	0 / 0	6
	9053	P150E Freezing with Style binary search data structures divide and conquer trees *3000	0 / 0	10
	9009	P161C Abracadabra divide and conquer *2400	0 / 0	9
	8973	P167D Wizards and Roads data structures divide and conquer graph matchings graphs greedy *3000	0 / 0	10
	8833	P196C Paint Tree constructive algorithms divide and conquer geometry sortings trees *2200	0 / 0	8
	8715	P217C Formurosa divide and conquer dp expression parsing *2600	0 / 0	10
	8655	P232C Doe Graphs constructive algorithms divide and conquer dp graphs shortest paths *2600	0 / 0	10
	8653	P232E Quick Tortoise bitmasks divide and conquer dp *3000	0 / 0	10
	8644	P234G Practice constructive algorithms divide and conquer implementation *1600	0 / 0	5
	8403	P293E Close Vertices data structures divide and conquer trees *2700	0 / 0	10
	8295	P321C Ciel the Commander constructive algorithms dfs and similar divide and conquer greedy trees *2100	0 / 0	7
	8293	P321E Ciel and Gondolas data structures divide and conquer dp *2600	0 / 0	10
	8230	P337D Book of Evil dfs and similar divide and conquer dp trees *2000	0 / 0	7
	8210	P342E Xenia and Tree data structures divide and conquer trees *2400	0 / 0	9
	8205	P343E Pumping Stations brute force dfs and similar divide and conquer flows graphs greedy trees *2900	0 / 0	10
	8119	P364E Empty Rectangles divide and conquer two pointers *3000	0 / 0	10
	8088	P372B Counting Rectangles is Fun brute force divide and conquer dp *1900	0 / 0	6
	8058	P379F New Year Tree data structures divide and conquer trees *2400	0 / 0	9
	8040	P383E Vowels combinatorics divide and conquer dp *2700	0 / 0	10
	7916	P413E Maze 2D data structures divide and conquer *2200	0 / 0	8
	7913	P414C Mashmokh and Reverse Operation combinatorics divide and conquer *2100	0 / 0	7
	7869	P429D Tricky Function data structures divide and conquer geometry *2200	0 / 0	8
	7849	P434E Furukawa Nagisa's Tree binary search divide and conquer sortings trees *3000	0 / 0	10
	7831	P438E The Child and Binary Tree combinatorics divide and conquer fft number theory *3100	0 / 0	10
	7823	P440C One-Based Arithmetic brute force dfs and similar divide and conquer *1800	0 / 0	6
	7793	P448C Painting Fence divide and conquer dp greedy *1900	0 / 0	6
	7773	P452F Permutation data structures divide and conquer hashing *2700	0 / 0	10
	7749	P459D Pashmak and Parmida's problem data structures divide and conquer sortings *1800	0 / 0	6
	7656	P480E Parking Lot data structures divide and conquer *2800	0 / 0	10
	7578	P500F New Year Shopping divide and conquer dp *2700	0 / 0	10
	7540	P512E Fox And Polygon constructive algorithms divide and conquer *2900	0 / 0	10
	7537	P513B2 Permutations bitmasks divide and conquer math *1800	0 / 0	6
	7452	P526F Pudding Monsters data structures divide and conquer *3000	0 / 0	10
	7403	P536E Tavas on the Path data structures divide and conquer trees *3100	0 / 0	10
	7354	P549F Yura and Developers data structures divide and conquer *2800	0 / 0	10
	7311	P559B Equivalent Strings divide and conquer hashing sortings strings *1700	0 / 0	5
	7303	P566C Logistical Questions dfs and similar divide and conquer trees *3000	0 / 0	10
	7270	P573D Bear and Cavalry data structures divide and conquer dp *3000	0 / 0	10
	7255	P576C Points on Plane constructive algorithms divide and conquer geometry greedy sortings *2100	0 / 0	7
	7143	P603E Pastoral Oddities data structures divide and conquer dsu math trees *3000	0 / 0	10
	7098	P613D Kingdom and its Cities dfs and similar divide and conquer dp graphs sortings trees *2800	1 / 4	10
	7033	P627C Package Delivery data structures divide and conquer greedy *2200	0 / 0	8
	6991	P632E Thief in a Shop divide and conquer dp fft math *2400	0 / 1	9
	6990	P632F Magic Matrix brute force divide and conquer graphs matrices trees *2400	0 / 0	9
	6898	P660F Bear and Bowling 4 binary search data structures divide and conquer geometry ternary search *2500	0 / 0	9
	6879	P662C Binary Table bitmasks brute force divide and conquer dp fft math *2600	0 / 0	10
	6870	P665E Beautiful Subarrays data structures divide and conquer strings trees *2100	0 / 0	7
	6824	P678F Lena and Queries data structures divide and conquer geometry *2500	0 / 0	9
	6792	P685E Travelling Through the Snow Queen's Kingdom bitmasks brute force divide and conquer graphs *2800	0 / 0	10
	6670	P715C Digit Tree dfs and similar divide and conquer dsu trees *2700	0 / 0	10
	6536	P744B Hongcow's Game bitmasks divide and conquer interactive *1900	0 / 0	6
	6502	P750E New Year and Old Subsequence data structures divide and conquer dp matrices *2600	0 / 0	10
	6484	P755G PolandBall and Many Other Balls combinatorics divide and conquer dp fft math number theory *3200	0 / 0	10
	6471	P757G Can Bash Save the Day? data structures divide and conquer graphs trees *3400	0 / 0	10
	6446	P763E Timofey and our friends animals data structures divide and conquer dsu *2900	0 / 0	10
	6425	P768B Code For 1 constructive algorithms dfs and similar divide and conquer *1600	0 / 0	5
	6401	P772E Verifying Kingdom binary search divide and conquer interactive trees *3200	0 / 0	10
	6395	P773F Test Data Generation combinatorics divide and conquer dp fft math number theory *3400	0 / 0	10
	6369	P776F Sherlock's bet to Moriarty constructive algorithms data structures divide and conquer geometry graphs implementation trees *2800	0 / 0	10
	6312	P786C Till I Collapse data structures divide and conquer *2400	0 / 0	9
	6304	P788D Finding lines constructive algorithms divide and conquer interactive *3000	0 / 0	10
	6288	P793F Julia the snail data structures divide and conquer dp *3000	0 / 0	10
	6287	P793G Oleg and chess data structures divide and conquer flows graph matchings *3400	0 / 0	10
	6212	P809C Find a car combinatorics divide and conquer dp *2600	0 / 0	10
	6210	P809E Surprise me! divide and conquer math number theory trees *3100	0 / 0	10
	6144	P817D Imbalanced Array data structures divide and conquer dsu sortings *1900	0 / 0	6
	6044	P833B The Bakery binary search data structures divide and conquer dp two pointers *2200	1 / 1	8
	6042	P833D Red-Black Cobweb data structures divide and conquer implementation trees *2800	0 / 0	10
	6003	P842E Nikita and game binary search dfs and similar divide and conquer graphs trees *2800	0 / 0	10
	5967	P848C Goodbye Souvenir data structures divide and conquer *2600	0 / 0	10
	5965	P848E Days of Floral Colours combinatorics divide and conquer dp fft math *3400	0 / 0	10
	5956	P850E Random Elections bitmasks brute force divide and conquer fft math *2800	0 / 0	10
	5906	P862D Mahmoud and Ehab and the binary string binary search divide and conquer interactive *2000	0 / 0	7
	5885	P865F Egg Roulette bitmasks brute force divide and conquer math meet-in-the-middle *3300	0 / 0	10
	5877	P868F Yet Another Minimization Problem divide and conquer dp *2500	0 / 0	9
	5860	P873D Merge Sort constructive algorithms divide and conquer *1800	0 / 0	6
	5854	P875D High Cry binary search bitmasks combinatorics data structures divide and conquer *2200	0 / 0	8
	5801	P888E Maximum Subsequence bitmasks divide and conquer meet-in-the-middle *1800	0 / 0	6
	5688	P914E Palindromes in a Tree bitmasks data structures divide and conquer trees *2400	0 / 0	9
	5686	P914G Sum the Fibonacci bitmasks divide and conquer dp fft math *2600	0 / 0	10
	5481	P960E Alternating Tree combinatorics dfs and similar divide and conquer dp probabilities trees *2300	0 / 0	8
	5410	P981E Addition on Segments bitmasks data structures divide and conquer dp *2200	0 / 0	8
	5360	P990G GCD Counting divide and conquer dp dsu number theory trees *2400	0 / 0	9
	5336	P995E Number Clicker divide and conquer graphs meet-in-the-middle number theory *2700	0 / 0	10
	5329	P997D Cycles in product combinatorics divide and conquer trees *2900	0 / 0	10
	5314	P1000F One Occurrence data structures divide and conquer *2400	0 / 0	9
	5277	P1004F Sonya and Bitwise OR bitmasks data structures divide and conquer *2600	0 / 0	10
	5207	P1019E Raining season data structures divide and conquer trees *3200	0 / 0	10
	5104	P1041F Ray in the tube data structures divide and conquer dp math *2500	0 / 0	9
	5100	P1042D Petya and Array data structures divide and conquer two pointers *1800	0 / 0	6
	5091	P1043G Speckled Band data structures divide and conquer hashing string suffix structures strings *3500	0 / 0	10
	4969	P1070M Algoland and Berland constructive algorithms divide and conquer geometry *3000	0 / 0	10
	4839	P1096G Lucky Tickets divide and conquer dp fft *2400	1 / 1	9

Pick a problem randomly based on the current filter.