Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	8731	P213D Stars constructive algorithms geometry *2300	0 / 0	8
	8730	P213E Two Permutations data structures hashing strings *2700	0 / 0	10
	8729	P214A System of Equations brute force *800	0 / 0	3
	8728	P214B Hometask brute force constructive algorithms greedy math *1600	0 / 0	5
	8727	P215A Bicycle Chain brute force implementation *900	0 / 0	3
	8726	P215B Olympic Medal greedy math *1300	0 / 0	4
	8725	P215C Crosses brute force implementation *2100	0 / 0	7
	8724	P215D Hot Days greedy *1900	0 / 0	6
	8723	P215E Periodical Numbers combinatorics dp number theory *2100	0 / 0	7
	8722	P216A Tiling with Hexagons implementation math *1200	1 / 1	4
	8721	P216B Forming Teams dfs and similar implementation *1700	0 / 0	5
	8720	P216C Hiring Staff greedy *1800	0 / 0	6
	8719	P216D Spider's Web binary search sortings two pointers *1700	0 / 0	5
	8718	P216E Martian Luck math number theory *2000	0 / 0	7
	8717	P217A Ice Skating brute force dfs and similar dsu graphs *1200	0 / 0	4
	8716	P217B Blackboard Fibonacci brute force math *2100	0 / 0	7
	8715	P217C Formurosa divide and conquer dp expression parsing *2600	0 / 0	10
	8714	P217D Bitonix' Patrol bitmasks brute force combinatorics dfs and similar math *2900	0 / 0	10
	8713	P217E Alien DNA data structures dsu trees *2800	0 / 0	10
	8712	P218A Mountain Scenery brute force constructive algorithms implementation *1100	0 / 0	3
	8711	P218B Airport implementation *1100	0 / 0	3
	8710	P219A k-String implementation strings *1000	0 / 0	3
	8709	P219B Special Offer! Super Price 999 Bourles! implementation *1400	0 / 0	4
	8708	P219C Color Stripe brute force dp greedy *1600	0 / 0	5
	8707	P219D Choosing Capital for Treeland dfs and similar dp graphs trees *1700	0 / 0	5
	8706	P219E Parking Lot data structures *2200	0 / 0	8
	8705	P220A Little Elephant and Problem implementation sortings *1300	0 / 0	4
	8704	P220B Little Elephant and Array constructive algorithms data structures *1800	2 / 2	6
	8703	P220C Little Elephant and Shifts data structures *2100	0 / 0	7
	8702	P220D Little Elephant and Triangle geometry math *2500	0 / 0	9
	8701	P220E Little Elephant and Inversions data structures two pointers *2400	0 / 0	9
	8700	P221A Little Elephant and Function implementation math *1000	0 / 0	3
	8699	P221B Little Elephant and Numbers implementation *1300	0 / 0	4
	8698	P222A Shooshuns and Sequence brute force implementation *1200	0 / 0	4
	8697	P222B Cosmic Tables data structures implementation *1300	0 / 0	4
	8696	P222C Reducing Fractions implementation math number theory sortings *1800	0 / 0	6
	8695	P222D Olympiad binary search greedy sortings two pointers *1900	0 / 0	6
	8694	P222E Decoding Genome dp matrices *1900	0 / 0	6
	8693	P223A Bracket Sequence data structures expression parsing implementation *1700	0 / 0	5
	8692	P223B Two Strings data structures dp strings *1900	0 / 0	6
	8691	P223C Partial Sums combinatorics math number theory *1900	0 / 0	6
	8690	P223D Spider geometry graphs *3000	0 / 0	10
	8689	P223E Planar Graph flows geometry graphs *3000	0 / 0	10
	8688	P224A Parallelepiped brute force geometry math *1100	0 / 0	3
	8687	P224B Array bitmasks implementation two pointers *1500	0 / 0	5
	8686	P225A Dice Tower constructive algorithms greedy *1100	0 / 0	3
	8685	P225B Well-known Numbers binary search greedy number theory *1600	0 / 0	5
	8684	P225C Barcode dp matrices *1700	0 / 0	5
	8683	P225D Snake bitmasks dfs and similar graphs implementation *2200	0 / 0	8
	8682	P225E Unsolvable math number theory *2100	0 / 0	7
	8681	P226A Flying Saucer Segments math *1400	0 / 0	4
	8680	P226B Naughty Stone Piles greedy *1900	0 / 0	6
	8679	P226C Anniversary data structures implementation math matrices number theory *2400	0 / 0	9
	8678	P226D The table constructive algorithms greedy *2100	0 / 0	7
	8677	P226E Noble Knight's Path data structures trees *2900	0 / 0	10
	8676	P227A Where do I Turn? geometry *1300	0 / 0	4
	8675	P227B Effective Approach implementation *1100	0 / 0	3
	8674	P228A Is your horseshoe on the other hoof? implementation *800	0 / 0	3
	8673	P228B Two Tables brute force implementation *1400	0 / 0	4
	8672	P228C Fractal Detector dp hashing *2000	0 / 0	7
	8671	P228D Zigzag data structures *2100	0 / 0	7
	8670	P228E The Road to Berland is Paved With Good Intentions 2-sat dfs and similar dsu graphs *1900	0 / 0	6
	8669	P229A Shifts brute force two pointers *1500	0 / 0	5
	8668	P229B Planets binary search data structures graphs shortest paths *1700	1 / 1	5
	8667	P229C Triangles combinatorics graphs math *1900	0 / 0	6
	8666	P229D Towers dp greedy two pointers *2100	0 / 0	7
	8665	P229E Gifts combinatorics dp math probabilities *2600	0 / 0	10
	8664	P230A Dragons greedy sortings *1000	0 / 0	3
	8663	P230B T-primes binary search implementation math number theory *1300	0 / 0	4
	8662	P231A Team brute force greedy *800	0 / 0	3
	8661	P231B Magic, Wizardry and Wonders constructive algorithms greedy *1500	0 / 0	5
	8660	P231C To Add or Not to Add binary search sortings two pointers *1600	0 / 0	5
	8659	P231D Magic Box brute force geometry *1600	0 / 0	5
	8658	P231E Cactus data structures dfs and similar dp graphs trees *2100	0 / 0	7
	8657	P232A Cycles binary search constructive algorithms graphs greedy *1600	0 / 0	5
	8656	P232B Table bitmasks combinatorics dp math *1900	0 / 0	6
	8655	P232C Doe Graphs constructive algorithms divide and conquer dp graphs shortest paths *2600	0 / 0	10
	8654	P232D Fence binary search data structures string suffix structures *2900	0 / 0	10
	8653	P232E Quick Tortoise bitmasks divide and conquer dp *3000	0 / 0	10
	8652	P233A Perfect Permutation implementation math *800	0 / 0	3
	8651	P233B Non-square Equation binary search brute force math *1400	0 / 0	4
	8650	P234A Lefthanders and Righthanders implementation *1200	0 / 0	4
	8649	P234B Reading sortings *1000	0 / 0	3
	8648	P234C Weather dp implementation *1300	0 / 0	4
	8647	P234D Cinema implementation *1600	0 / 0	5
	8646	P234E Champions' League implementation *1600	0 / 0	5
	8645	P234F Fence dp *1800	0 / 0	6
	8644	P234G Practice constructive algorithms divide and conquer implementation *1600	0 / 0	5
	8643	P234H Merging Two Decks constructive algorithms greedy *2000	0 / 0	7
	8642	P235A LCM Challenge number theory *1600	0 / 0	5
	8641	P235B Let's Play Osu! dp math probabilities *2000	0 / 0	7
	8640	P235C Cyclical Quest data structures string suffix structures strings *2700	0 / 0	10
	8639	P235D Graph Game graphs *3000	0 / 0	10
	8638	P235E Number Challenge combinatorics dp implementation math number theory *2600	0 / 0	10
	8637	P236A Boy or Girl brute force implementation strings *800	0 / 0	3
	8636	P236B Easy Number Challenge implementation number theory *1300	0 / 0	4
	8635	P237A Free Cash implementation *1000	0 / 0	3
	8634	P237B Young Table implementation sortings *1500	0 / 0	5
	8633	P237C Primes on Interval binary search number theory two pointers *1600	0 / 0	5
	8632	P237D T-decomposition dfs and similar graphs greedy trees *2000	0 / 0	7

Pick a problem randomly based on the current filter.