Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	8631	P237E Build String flows graphs *2000	0 / 0	7
	8630	P238A Not Wool Sequences constructive algorithms math *1300	0 / 0	4
	8629	P238B Boring Partition constructive algorithms *1800	0 / 0	6
	8628	P238C World Eater Brothers dfs and similar dp greedy trees *2100	0 / 0	7
	8627	P238D Tape Programming data structures implementation *2900	0 / 0	10
	8626	P238E Meeting Her dp graphs shortest paths *2600	0 / 0	10
	8625	P239A Two Bags of Potatoes greedy implementation math *1200	0 / 0	4
	8624	P239B Easy Tape Programming brute force implementation *1500	0 / 0	5
	8623	P240E Road Repairs dfs and similar graphs greedy *2800	0 / 0	10
	8622	P240F TorCoder data structures *2600	0 / 0	10
	8621	P241A Old Peykan greedy *1300	0 / 0	4
	8620	P241B Friends binary search bitmasks data structures math *2700	0 / 0	10
	8619	P241C Mirror Box geometry implementation *2000	0 / 0	7
	8618	P241D Numbers *2900	0 / 0	10
	8617	P241E Flights graphs shortest paths *2600	0 / 0	10
	8616	P241F Race brute force implementation *2300	0 / 0	8
	8615	P241G Challenging Balloons constructive algorithms *1900	0 / 0	6
	8614	P242A Heads or Tails brute force implementation *1100	0 / 0	3
	8613	P242B Big Segment implementation sortings *1100	0 / 0	3
	8612	P242C King's Path dfs and similar graphs hashing shortest paths *1800	0 / 0	6
	8611	P242D Dispute dfs and similar graphs greedy *2100	0 / 0	7
	8610	P242E XOR on Segment bitmasks data structures *2000	0 / 0	7
	8609	P243A The Brand New Function bitmasks *1600	0 / 0	5
	8608	P243B Hydra graphs sortings *2000	0 / 0	7
	8607	P243C Colorado Potato Beetle dfs and similar implementation *2200	0 / 0	8
	8606	P243D Cubes data structures dp geometry two pointers *2700	0 / 0	10
	8605	P243E Matrix data structures *3000	0 / 1	10
	8604	P244A Dividing Orange implementation *900	0 / 0	3
	8603	P244B Undoubtedly Lucky Numbers bitmasks brute force dfs and similar *1600	0 / 0	5
	8602	P245A System Administrator implementation *800	0 / 0	3
	8601	P245B Internet Address implementation strings *1100	0 / 0	3
	8600	P245C Game with Coins greedy *1700	0 / 0	5
	8599	P245D Restoring Table constructive algorithms greedy *1500	0 / 0	5
	8598	P245E Mishap in Club greedy implementation *1400	0 / 0	4
	8597	P245F Log Stream Analysis binary search brute force implementation strings *2000	0 / 0	7
	8596	P245G Suggested Friends brute force graphs *2200	0 / 0	8
	8595	P245H Queries for Number of Palindromes dp hashing strings *1800	0 / 0	6
	8594	P246A Buggy Sorting constructive algorithms greedy sortings *900	0 / 0	3
	8593	P246B Increase and Decrease greedy math *1300	0 / 0	4
	8592	P246C Beauty Pageant brute force constructive algorithms greedy *1600	0 / 0	5
	8591	P246D Colorful Graph brute force dfs and similar graphs *1600	0 / 0	5
	8590	P246E Blood Cousins Return binary search data structures dfs and similar dp sortings *2400	0 / 0	9
	8589	P248A Cupboards implementation *800	0 / 0	3
	8588	P248B Chilly Willy math number theory *1400	0 / 0	4
	8587	P248C Robo-Footballer binary search geometry *2000	0 / 0	7
	8586	P248D Sweets for Everyone! binary search greedy implementation *2300	0 / 0	8
	8585	P248E Piglet's Birthday dp math probabilities *2600	0 / 0	10
	8584	P249D Donkey and Stars data structures dp geometry math sortings *2700	0 / 0	10
	8583	P249E Endless Matrix math *2600	0 / 0	10
	8582	P250A Paper Work greedy *1000	0 / 0	3
	8581	P250B Restoring IPv6 implementation strings *1500	0 / 0	5
	8580	P250C Movie Critics greedy *1600	0 / 0	5
	8579	P250D Building Bridge geometry ternary search two pointers *1900	0 / 0	6
	8578	P250E Mad Joe brute force *2000	0 / 0	7
	8577	P251A Points on Line binary search combinatorics two pointers *1300	0 / 0	4
	8576	P251B Playing with Permutations implementation math *1800	0 / 0	6
	8575	P251C Number Transformation dp greedy number theory *2000	0 / 0	7
	8574	P251D Two Sets bitmasks math *2700	0 / 0	10
	8573	P251E Tree and Table dfs and similar dp implementation trees *3000	0 / 0	10
	8572	P252A Little Xor brute force implementation *1100	0 / 0	3
	8571	P252B Unsorting Array brute force sortings *1800	0 / 0	6
	8570	P253A Boys and Girls greedy *1100	0 / 0	3
	8569	P253B Physics Practical binary search dp sortings two pointers *1400	0 / 0	4
	8568	P253C Text Editor data structures dfs and similar graphs greedy shortest paths *1600	0 / 0	5
	8567	P253D Table with Letters - 2 brute force two pointers *2000	0 / 0	7
	8566	P253E Printer binary search data structures implementation sortings *2200	0 / 0	8
	8565	P254A Cards with Numbers constructive algorithms sortings *1200	0 / 0	4
	8564	P254B Jury Size brute force implementation *1500	0 / 0	5
	8563	P254C Anagram greedy strings *1800	0 / 0	6
	8562	P254D Rats brute force dfs and similar graphs implementation shortest paths *2300	0 / 0	8
	8561	P254E Dormitory dp implementation *2100	0 / 0	7
	8560	P255A Greg's Workout implementation *800	0 / 0	3
	8559	P255B Code Parsing implementation *1200	0 / 0	4
	8558	P255C Almost Arithmetical Progression brute force dp *1500	0 / 0	5
	8557	P255D Mr binary search implementation math *1800	0 / 0	6
	8556	P255E Furlo and Rublo and Game games implementation math *2200	0 / 0	8
	8555	P256D Liars and Serge dp *2700	0 / 0	10
	8554	P256E Lucky Arrays data structures *2400	0 / 0	9
	8553	P257A Sockets greedy implementation sortings *1100	0 / 0	3
	8552	P257B Playing Cubes games greedy implementation *1300	0 / 0	4
	8551	P257C View Angle brute force geometry math *1800	0 / 0	6
	8550	P257D Sum greedy math *1900	0 / 0	6
	8549	P257E Greedy Elevator data structures implementation *2200	0 / 0	8
	8548	P258A Little Elephant and Bits greedy math *1100	0 / 0	3
	8547	P258B Little Elephant and Elections brute force combinatorics dp *1900	0 / 0	6
	8546	P258C Little Elephant and LCM binary search combinatorics dp math *2000	0 / 0	7
	8545	P258D Little Elephant and Broken Sorting dp math probabilities *2600	0 / 0	10
	8544	P258E Little Elephant and Tree data structures dfs and similar trees *2400	0 / 0	9
	8543	P259A Little Elephant and Chess brute force strings *1000	0 / 0	3
	8542	P259B Little Elephant and Magic Square brute force implementation *1100	0 / 0	3
	8541	P260A Adding Digits implementation math *1400	0 / 0	4
	8540	P260B Ancient Prophesy brute force implementation strings *1600	0 / 0	5
	8539	P260C Balls and Boxes constructive algorithms greedy implementation *1700	0 / 0	5
	8538	P260D Black and White Tree constructive algorithms dsu graphs greedy trees *2100	0 / 0	7
	8537	P260E Dividing Kingdom binary search brute force data structures *2500	0 / 0	9
	8536	P261A Maxim and Discounts greedy sortings *1400	0 / 0	4
	8535	P261B Maxim and Restaurant dp math probabilities *1900	0 / 0	6
	8534	P261C Maxim and Matrix constructive algorithms dp math *2000	0 / 0	7
	8533	P261D Maxim and Increasing Subsequence dp *2600	0 / 0	10
	8532	P261E Maxim and Calculator brute force dp two pointers *2800	0 / 0	10

Pick a problem randomly based on the current filter.