Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	4068	P1250B The Feast and the Bus brute force constructive algorithms greedy math *1800	0 / 0	6
	4067	P1250C Trip to Saint Petersburg data structures *2100	0 / 0	7
	4066	P1250D Conference Problem dp *3000	0 / 0	10
	4065	P1250E The Coronation graphs implementation *2300	0 / 0	8
	4064	P1250F Data Center brute force implementation *800	0 / 0	3
	4063	P1250G Discarding Game dp greedy two pointers *2300	0 / 0	8
	4062	P1250H Happy Birthday math *1500	0 / 0	5
	4061	P1250I Show Must Go On binary search brute force greedy shortest paths *3100	0 / 0	10
	4060	P1250J The Parade binary search greedy *1800	0 / 0	6
	4059	P1250K Projectors flows graphs *3100	0 / 0	10
	4058	P1250L Divide The Students binary search greedy math *1500	0 / 0	5
	4057	P1250M SmartGarden constructive algorithms divide and conquer *2500	0 / 0	9
	4056	P1250N Wires dfs and similar graphs greedy *2000	0 / 0	7
	4055	P1251A Broken Keyboard brute force strings two pointers *1000	0 / 0	3
	4054	P1251B Binary Palindromes greedy strings *1400	0 / 0	4
	4053	P1251C Minimize The Integer greedy two pointers *1600	0 / 0	5
	4052	P1251D Salary Changing binary search greedy sortings *1900	0 / 0	6
	4050	P1251E1 Voting (Easy Version) data structures dp greedy *2300	0 / 0	8
	4047	P1251E2 Voting (Hard Version) binary search data structures greedy *2400	0 / 0	9
	4045	P1251F Red-White Fence combinatorics fft *2500	0 / 0	9
	4043	P1252A Copying Homework *1000	0 / 0	3
	4041	P1252B Cleaning Robots dp trees *2300	0 / 0	8
	4039	P1252C Even Path data structures implementation *1600	0 / 0	5
	4037	P1252D Find String in a Grid data structures dp strings trees *3000	0 / 0	10
	4036	P1252E Songwriter greedy two pointers *2200	0 / 0	8
	4033	P1252F Regular Forestation hashing trees *2400	0 / 0	9
	4032	P1252G Performance Review data structures *2100	0 / 0	7
	4029	P1252H Twin Buildings greedy implementation *1800	0 / 0	6
	4027	P1252I Mission Possible *3000	0 / 0	10
	4025	P1252J Tiling Terrace brute force dp *2300	0 / 0	8
	4023	P1252K Addition Robot data structures math matrices *2100	0 / 0	7
	4021	P1252L Road Construction flows graphs *2300	0 / 0	8
	4020	P1253A Single Push implementation *1000	0 / 0	3
	4017	P1253B Silly Mistake greedy implementation *1400	0 / 0	4
	4015	P1253C Sweets Eating dp greedy math sortings *1500	0 / 0	5
	4013	P1253D Harmonious Graph constructive algorithms dfs and similar dsu graphs greedy sortings *1700	0 / 0	5
	4011	P1253E Antenna Coverage data structures dp greedy sortings *2200	0 / 0	8
	4010	P1253F Cheap Robot binary search dsu graphs shortest paths trees *2500	0 / 0	9
	4007	P1254A Feeding Chicken constructive algorithms greedy implementation *1700	0 / 0	5
	4005	P1254B1 Send Boxes to Alice (Easy Version) constructive algorithms greedy math number theory ternary search two pointers *1800	0 / 0	6
	4003	P1254B2 Send Boxes to Alice (Hard Version) constructive algorithms greedy math number theory ternary search two pointers *2100	0 / 0	7
	4002	P1254C Point Ordering constructive algorithms geometry interactive math *2300	0 / 0	8
	4000	P1254D Tree Queries data structures probabilities trees *2700	0 / 0	10
	3997	P1254E Send Tree to Charlie combinatorics dfs and similar dsu trees *3300	0 / 0	10
	3995	P1255A Changing Volume math *800	0 / 0	3
	3993	P1255B Fridge Lockers graphs implementation *1100	0 / 0	3
	3992	P1255C League of Leesins constructive algorithms implementation *1600	0 / 0	5
	3990	P1256A Payment Without Change math *1000	0 / 0	3
	3987	P1256B Minimize the Permutation greedy *1400	0 / 0	4
	3986	P1256C Platforms Jumping greedy *1700	0 / 0	5
	3983	P1256D Binary String Minimizing greedy *1500	0 / 0	5
	3982	P1256E Yet Another Division Into Teams dp greedy sortings *2000	0 / 0	7
	3980	P1256F Equalizing Two Strings constructive algorithms sortings strings *2000	0 / 0	7
	3977	P1257A Two Rival Students greedy math *800	0 / 0	3
	3976	P1257B Magic Stick math *1000	0 / 0	3
	3973	P1257C Dominated Subarray greedy implementation sortings strings two pointers *1200	0 / 0	4
	3972	P1257D Yet Another Monster Killing Problem binary search data structures dp greedy sortings two pointers *1700	0 / 0	5
	3969	P1257E The Contest data structures dp greedy *2000	0 / 0	7
	3967	P1257F Make Them Similar bitmasks brute force hashing meet-in-the-middle *2400	0 / 0	9
	3966	P1257G Divisor Set divide and conquer fft greedy math number theory *2600	0 / 0	10
	3964	P1260A Heating math *1000	0 / 0	3
	3962	P1260B Obtain Two Zeroes binary search math *1300	0 / 0	4
	3960	P1260C Infinite Fence greedy math number theory *1700	0 / 0	5
	3957	P1260D A Game with Traps binary search dp greedy sortings *1900	0 / 0	6
	3955	P1260E Tournament brute force dp greedy *2400	0 / 0	9
	3953	P1260F Colored Tree data structures trees *2700	0 / 0	10
	3951	P1261F Xor-Set bitmasks divide and conquer math *3100	0 / 0	10
	3949	P1263A Sweet Problem math *1100	0 / 0	3
	3947	P1263B PIN Codes greedy implementation *1400	0 / 0	4
	3945	P1263C Everyone is a Winner! binary search math meet-in-the-middle number theory *1400	0 / 0	4
	3944	P1263D Secret Passwords dfs and similar dsu graphs *1500	0 / 0	5
	3941	P1263E Editor data structures implementation *2100	0 / 0	7
	3940	P1263F Economic Difficulties data structures dfs and similar dp flows graphs trees *2400	0 / 0	9
	3938	P1264A Beautiful Regional Contest greedy implementation *1500	0 / 0	5
	3936	P1264B Beautiful Sequence brute force constructive algorithms greedy *1900	0 / 0	6
	3933	P1264C Beautiful Mirrors with queries data structures probabilities *2400	0 / 0	9
	3931	P1264D1 Beautiful Bracket Sequence (easy version) combinatorics dp probabilities *2600	0 / 0	10
	3929	P1264D2 Beautiful Bracket Sequence (hard version) combinatorics probabilities *2900	0 / 0	10
	3928	P1264E Beautiful League constructive algorithms flows graph matchings *2700	0 / 0	10
	3925	P1264F Beautiful Fibonacci Problem constructive algorithms number theory *3500	1 / 2	10
	3924	P1265A Beautiful String constructive algorithms greedy *1000	0 / 0	3
	3921	P1265B Beautiful Numbers data structures implementation math two pointers *1300	0 / 0	4
	3919	P1265E Beautiful Mirrors data structures dp math probabilities *2100	0 / 0	7
	3917	P1266A Competitive Programmer chinese remainder theorem math *1000	0 / 0	3
	3915	P1266B Dice Tower constructive algorithms math *1000	0 / 0	3
	3914	P1266C Diverse Matrix constructive algorithms greedy math number theory *1400	0 / 0	4
	3911	P1266D Decreasing Debts constructive algorithms data structures graphs greedy implementation math two pointers *2000	0 / 0	7
	3909	P1266E Spaceship Solitaire data structures greedy implementation *2100	0 / 0	7
	3907	P1266F Almost Same Distance dfs and similar graphs *2900	0 / 0	10
	3905	P1266G Permutation Concatenation string suffix structures *3300	0 / 0	10
	3903	P1266H __NO_TITLE__	0 / 0	(None)
	3902	P1267A __NO_TITLE__	0 / 0	(None)
	3899	P1267B Balls of Buma *900	0 / 0	3
	3898	P1267C __NO_TITLE__	0 / 0	(None)
	3896	P1267D DevOps Best Practices constructive algorithms *2800	0 / 0	10
	3893	P1267E Elections greedy *1700	0 / 0	5
	3892	P1267F __NO_TITLE__	0 / 0	(None)
	3889	P1267G Game Relics math probabilities *3000	0 / 0	10
	3888	P1267H Help BerLine constructive algorithms *3200	0 / 0	10
	3886	P1267I Intriguing Selection brute force constructive algorithms implementation interactive sortings *2600	0 / 0	10

Pick a problem randomly based on the current filter.