data structures - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	8035	P385C Bear and Prime Numbers binary search brute force data structures dp implementation math number theory *1700	0 / 0	5
	8024	P387E George and Cards binary search data structures *2200	0 / 0	8
	8014	P390C Inna and Candy Boxes data structures	0 / 0	(None)
	8005	P391D2 Supercollider data structures	0 / 0	(None)
	7996	P392D Three Arrays data structures	0 / 0	(None)
	7985	P396C On Changing Tree data structures graphs trees	0 / 0	(None)
	7977	P398D Instant Messanger data structures	0 / 0	(None)
	7969	P400E Inna and Binary Logic binary search bitmasks data structures *2100	0 / 0	7
	7957	P403E Two Rooted Trees data structures implementation trees *2900	0 / 0	10
	7940	P407E k-d-sequence data structures *3100	0 / 0	10
	7916	P413E Maze 2D data structures divide and conquer *2200	0 / 0	8
	7912	P414D Mashmokh and Water Tanks binary search data structures greedy trees two pointers *2300	0 / 0	8
	7911	P414E Mashmokh's Designed Problem data structures *3200	0 / 0	10
	7898	P418D Big Problems for Organizers data structures graphs trees *2800	0 / 0	10
	7897	P418E Tricky Password data structures *3100	0 / 0	10
	7894	P420C Bug in Code data structures graphs implementation two pointers *1900	0 / 0	6
	7893	P420D Cup Trick data structures *2200	0 / 0	8
	7890	P421D Bug in Code binary search data structures sortings *1900	0 / 0	6
	7886	P424D Biathlon Track binary search brute force constructive algorithms data structures dp *2300	0 / 0	8
	7882	P425C Sereja and Two Sequences data structures dp *2300	0 / 0	8
	7881	P425D Sereja and Squares binary search data structures hashing *2300	0 / 0	8
	7876	P427B Prison Transfer data structures implementation *1100	0 / 0	3
	7869	P429D Tricky Function data structures divide and conquer geometry *2200	0 / 0	8
	7861	P431E Chemistry Experiment binary search data structures ternary search *2200	0 / 0	8
	7839	P436E Cardboard Box data structures greedy *2600	0 / 0	10
	7838	P436F Banners brute force data structures dp *3000	0 / 0	10
	7832	P438D The Child and Sequence data structures math *2300	0 / 0	8
	7814	P442C Artem and Array data structures greedy *2500	0 / 0	9
	7813	P442D Adam and Tree data structures trees *2600	0 / 0	10
	7807	P444C DZY Loves Colors data structures *2400	0 / 0	9
	7801	P446B DZY Loves Modification brute force data structures greedy *2000	0 / 0	7
	7800	P446C DZY Loves Fibonacci Numbers data structures math number theory *2400	0 / 0	9
	7774	P452E Three strings data structures dsu string suffix structures strings *2400	0 / 0	9
	7773	P452F Permutation data structures divide and conquer hashing *2700	0 / 0	10
	7768	P453E Little Pony and Lord Tirek data structures *3100	0 / 0	10
	7762	P455D Serega and Fun data structures *2700	0 / 0	10
	7761	P455E Function data structures *2900	0 / 0	10
	7749	P459D Pashmak and Parmida's problem data structures divide and conquer sortings *1800	0 / 0	6
	7745	P460C Present binary search data structures greedy *1700	0 / 0	5
	7740	P461C Appleman and a Sheet of Paper data structures implementation *2200	0 / 0	8
	7726	P464E The Classic Problem data structures graphs shortest paths *3000	0 / 0	10
	7721	P466C Number of Ways binary search brute force data structures dp two pointers *1700	0 / 0	5
	7714	P467E Alex and Complicated Task data structures dp greedy *2300	0 / 0	8
	7694	P471E MUH and Lots and Lots of Segments data structures dsu *2700	0 / 0	10
	7687	P472G Design Tutorial: Increase the Constraints bitmasks data structures fft *2800	0 / 0	10
	7682	P474E Pillars binary search data structures dp sortings trees *2000	0 / 0	7
	7681	P474F Ant colony data structures math number theory *2100	0 / 0	7
	7677	P475D CGCDSSQ brute force data structures math *2000	1 / 1	7
	7675	P475F Meta-universe data structures *2900	0 / 0	10
	7668	P477E Dreamoon and Notepad data structures *3100	0 / 0	10
	7656	P480E Parking Lot data structures divide and conquer *2800	0 / 0	10
	7654	P482B Interesting Array constructive algorithms data structures trees *1800	0 / 0	6
	7651	P482E ELCA data structures trees *3200	0 / 0	10
	7645	P484D Kindergarten data structures dp greedy *2400	0 / 0	9
	7644	P484E Sign on Fence binary search constructive algorithms data structures *2500	0 / 0	9
	7637	P486E LIS of Sequence data structures dp greedy hashing math *2200	0 / 0	8
	7635	P487B Strip binary search data structures dp two pointers *2000	0 / 0	7
	7633	P487D Conveyor Belts data structures *2700	0 / 0	10
	7632	P487E Tourists data structures dfs and similar graphs trees *3200	1 / 1	10
	7618	P490F Treeland Tour data structures dfs and similar dp trees *2200	0 / 0	8
	7607	P493C Vasya and Basketball binary search brute force data structures implementation sortings two pointers *1600	0 / 0	5
	7601	P494D Birthday data structures dfs and similar dp trees *2700	0 / 0	10
	7600	P494E Sharti data structures games *3200	0 / 0	10
	7587	P498D Traffic Jams in the Land data structures dp number theory *2400	0 / 0	9
	7579	P500E New Year Domino data structures dp dsu *2300	0 / 0	8
	7575	P501B Misha and Changing Handles data structures dsu strings *1100	0 / 0	3
	7574	P501C Misha and Forest constructive algorithms data structures greedy sortings trees *1500	0 / 0	5
	7573	P501D Misha and Permutations Summation data structures *2000	0 / 0	7
	7534	P513D2 Constrained Tree constructive algorithms data structures *2600	0 / 0	10
	7518	P514B Han Solo and Lazer Gun brute force data structures geometry implementation math *1400	0 / 0	4
	7516	P514C Watto and Mechanism binary search data structures hashing string suffix structures strings *2000	0 / 0	7
	7514	P514D R2D2 and Droid Army binary search data structures two pointers *2000	0 / 0	7
	7503	P515E Drazil and Park data structures *2300	0 / 0	8
	7493	P518C Anya and Smartphone constructive algorithms data structures implementation *1600	0 / 0	5
	7485	P519B A and B and Compilation Errors data structures implementation sortings *1100	0 / 0	3
	7483	P519D A and B and Interesting Substrings data structures dp two pointers *1800	0 / 0	6
	7482	P519E A and B and Lecture Rooms binary search data structures dfs and similar dp trees *2100	0 / 0	7
	7473	P522B Photo to Remember special problem data structures dp implementation 1100	0 / 0	3
	7471	P522D Closest Equals special problem data structures 2000	0 / 0	7
	7467	P523D Statistics of Recompressing Videos special problem data structures implementation 1600	0 / 0	5
	7464	P524E Rooks and Rectangles data structures sortings *2400	0 / 0	9
	7463	P524F And Yet Another Bracket Sequence data structures greedy hashing string suffix structures strings *2700	0 / 0	10
	7459	P525D Arthur and Walls constructive algorithms data structures graphs greedy shortest paths *2400	0 / 0	9
	7452	P526F Pudding Monsters data structures divide and conquer *3000	0 / 0	10
	7448	P527C Glass Carving binary search data structures implementation *1500	0 / 0	5
	7447	P527D Clique Problem data structures dp greedy implementation sortings *1800	0 / 0	6
	7422	P533A Berland Miners binary search data structures dfs and similar greedy trees *3000	0 / 0	10
	7418	P533D Landmarks data structures dp *3000	0 / 0	10
	7412	P534D Handshakes binary search constructive algorithms data structures greedy *1900	0 / 0	6
	7403	P536E Tavas on the Path data structures divide and conquer trees *3100	0 / 0	10
	7397	P538F A Heap of Heaps brute force data structures math sortings *2200	0 / 0	8
	7395	P538H Summer Dichotomy 2-sat data structures dfs and similar greedy *3200	0 / 0	10
	7390	P540E Infinite Inversions binary search data structures implementation sortings trees *2100	0 / 0	7
	7389	P542A Place Your Ad Here data structures sortings *2400	0 / 0	9
	7388	P542B Duck Hunt data structures *3100	0 / 0	10
	7379	P543E Listening to Music constructive algorithms data structures *3200	0 / 0	10
	7365	P547B Mike and Feet binary search data structures dp dsu *1900	0 / 0	6
	7362	P547E Mike and Friends data structures string suffix structures strings trees *2800	0 / 0	10
	7354	P549F Yura and Developers data structures divide and conquer *2800	0 / 0	10
	7342	P551E GukiZ and GukiZiana binary search data structures implementation *2500	0 / 0	9

Pick a problem randomly based on the current filter.