brute force - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	4766	P1109D Sasha and Interesting Fact from Graph Theory brute force combinatorics dp math trees *2400	0 / 0	9
	4754	P1111B Average Superhero Gang Power brute force implementation math *1700	0 / 0	5
	4753	P1111C Creative Snap binary search brute force divide and conquer math *1700	0 / 0	5
	4748	P1114A Got Any Grapes? brute force greedy implementation *800	0 / 0	3
	4746	P1114C Trailing Loves (or L'oeufs?) brute force implementation math number theory *1700	0 / 0	5
	4713	P1118D1 Coffee and Coursework (Easy version) brute force greedy *1700	0 / 0	5
	4704	P1119E Pavel and Triangles brute force dp fft greedy ternary search *1900	0 / 0	6
	4696	P1120E The very same Munchhausen brute force *2600	0 / 0	10
	4693	P1121B Mike and Children brute force implementation *1200	0 / 0	4
	4691	P1129A1 Toy Train (Simplified) brute force greedy *1700	0 / 0	5
	4690	P1129A2 Toy Train brute force greedy *1800	0 / 0	6
	4683	P1130C Connect brute force dfs and similar dsu *1400	0 / 0	4
	4673	P1132C Painting the Fence brute force *1700	0 / 0	5
	4649	P1138B Circus brute force greedy math strings *1800	0 / 0	6
	4640	P1140C Playlist brute force data structures sortings *1600	0 / 0	5
	4627	P1142A The Beatles brute force math *1700	0 / 0	5
	4621	P1143B Nirvana brute force math number theory *1200	0 / 0	4
	4611	P1145B Kanban Numbers brute force	0 / 0	(None)
	4610	P1145C Mystery Circuit bitmasks brute force	0 / 0	(None)
	4596	P1147B Chladni Figure brute force strings *1900	0 / 0	6
	4590	P1148B Born This Way binary search brute force two pointers *1600	0 / 0	5
	4580	P1149D Abandoning Roads brute force dp graphs greedy *3000	0 / 0	10
	4576	P1151A Maxim and Biology brute force strings *1000	0 / 0	3
	4575	P1151B Dima and a Bad XOR bitmasks brute force constructive algorithms dp *1600	0 / 0	5
	4568	P1152C Neko does Maths brute force math number theory *1800	0 / 0	6
	4563	P1153A Serval and Bus brute force math *1000	0 / 0	3
	4559	P1153E Serval and Snake binary search brute force interactive *2200	0 / 0	8
	4551	P1154G Minimum Possible LCM brute force greedy math number theory *2200	0 / 0	8
	4547	P1155D Beautiful Array brute force data structures divide and conquer dp greedy *1900	0 / 0	6
	4546	P1155E Guess the Root brute force interactive math *2200	0 / 0	8
	4545	P1155F Delivery Oligopoly brute force dp graphs *2800	0 / 0	10
	4530	P1157G Inverse of Rows and Columns brute force constructive algorithms *2200	0 / 0	8
	4519	P1162B Double Matrix brute force greedy *1400	0 / 0	4
	4515	P1163C1 Power Transmission (Easy Edition) brute force geometry *1900	0 / 0	6
	4512	P1163E Magical Permutation bitmasks brute force constructive algorithms data structures graphs math *2400	0 / 0	9
	4500	P1166D Cute Sequences binary search brute force greedy math *2200	0 / 0	8
	4499	P1166E The LCMs Must be Large bitmasks brute force constructive algorithms math number theory *2100	0 / 0	7
	4497	P1167A Telephone Number brute force greedy strings *800	0 / 0	3
	4496	P1167B Lost Numbers brute force divide and conquer interactive math *1400	0 / 0	4
	4491	P1167G Low Budget Inception brute force geometry *3100	0 / 0	10
	4489	P1168B Good Triple brute force two pointers *1900	0 / 0	6
	4457	P1175C Electrification binary search brute force greedy *1600	8 / 26	5
	4454	P1175F The Number of Subpermutations brute force data structures divide and conquer hashing math *2500	1 / 3	9
	4452	P1176A Divide it! brute force greedy implementation *800	0 / 0	3
	4440	P1178E Archaeology brute force constructive algorithms greedy strings *1900	0 / 0	6
	4426	P1181C Flag brute force combinatorics dp implementation *1900	0 / 0	6
	4424	P1181E1 A Story of One Country (Easy) brute force divide and conquer sortings *2500	0 / 0	9
	4423	P1181E2 A Story of One Country (Hard) brute force greedy sortings *3000	0 / 0	10
	4411	P1183F Topforces Strikes Back brute force math sortings *2100	0 / 0	7
	4408	P1184A1 Heidi Learns Hashing (Easy) brute force math number theory *1200	0 / 0	4
	4407	P1184A2 Heidi Learns Hashing (Medium) brute force number theory *2100	0 / 0	7
	4391	P1185C2 Exam in BerSU (hard version) brute force data structures greedy math *1700	0 / 0	5
	4389	P1185E Polycarp and Snakes brute force implementation *2000	0 / 0	7
	4388	P1185F Two Pizzas bitmasks brute force *2100	0 / 0	7
	4362	P1190C Tokitsukaze and Duel brute force games greedy *2300	0 / 0	8
	4358	P1191A Tokitsukaze and Enhancement brute force *800	0 / 0	3
	4357	P1191B Tokitsukaze and Mahjong brute force implementation *1200	0 / 0	4
	4354	P1192C Cubeword *special problem brute force dp meet-in-the-middle	0 / 0	(None)
	4346	P1194E Count The Rectangles bitmasks brute force data structures geometry sortings *2200	3 / 5	8
	4342	P1195B Sport Mafia binary search brute force math *1000	0 / 0	3
	4336	P1196A Three Piles of Candies brute force constructive algorithms math *800	0 / 0	3
	4330	P1196F K-th Path brute force constructive algorithms shortest paths sortings *2200	0 / 0	8
	4322	P1198B Welfare State binary search brute force data structures sortings *1600	0 / 0	5
	4315	P1200A Hotelier brute force data structures implementation *800	0 / 0	3
	4312	P1200D White Lines brute force data structures dp implementation two pointers *1900	0 / 0	6
	4311	P1200E Compress Words brute force hashing implementation string suffix structures strings *2000	0 / 0	7
	4310	P1200F Graph Traveler brute force data structures dfs and similar dp graphs implementation math number theory *2300	0 / 0	8
	4302	P1202B You Are Given a Decimal String... brute force dp shortest paths *1700	0 / 0	5
	4301	P1202C You Are Given a WASD-string... brute force data structures dp greedy implementation math strings *2100	0 / 0	7
	4299	P1202E You Are Given Some Strings... brute force string suffix structures strings *2400	0 / 0	9
	4286	P1204D1 Kirk and a Binary String (easy version) brute force greedy strings *2000	0 / 0	7
	4282	P1205B Shortest Cycle bitmasks brute force graphs shortest paths *1900	0 / 0	6
	4275	P1207A There Are Two Types Of Burgers brute force greedy implementation math *800	12 / 46	3
	4270	P1207F Remainder Problem brute force data structures implementation *2100	3 / 3	7
	4267	P1208B Uniqueness binary search brute force implementation two pointers *1500	0 / 0	5
	4256	P1209E1 Rotate Columns (easy version) bitmasks brute force dp greedy sortings *2000	0 / 0	7
	4250	P1210A Anadi and Domino brute force graphs *1700	0 / 0	5
	4249	P1210B Marcin and Training Camp brute force greedy *1700	0 / 0	5
	4245	P1210F1 Marek and Matching (easy version) brute force probabilities *3100	0 / 0	10
	4244	P1210F2 Marek and Matching (hard version) brute force probabilities *3200	0 / 0	10
	4230	P1213D1 Equalizing by Division (easy version) brute force implementation *1500	0 / 0	5
	4229	P1213D2 Equalizing by Division (hard version) brute force math sortings *1600	0 / 0	5
	4228	P1213E Two Small Strings brute force constructive algorithms *1900	0 / 0	6
	4225	P1214A Optimal Currency Exchange brute force math *1400	0 / 0	4
	4224	P1214B Badges brute force math *1100	0 / 0	3
	4207	P1216E1 Numerical Sequence (easy version) binary search brute force math *1900	0 / 0	6
	4202	P1217C The Number Of Good Substrings binary search bitmasks brute force *1700	0 / 0	5
	4180	P1221A 2048 Game brute force greedy math *1000	0 / 0	3
	4174	P1221G Graph And Numbers bitmasks brute force combinatorics dp meet-in-the-middle *2900	0 / 0	10
	4163	P1225C p-binary bitmasks brute force math *1600	0 / 0	5
	4149	P1228A Distinct Digits brute force implementation *800	0 / 0	3
	4146	P1228D Complete Tripartite brute force constructive algorithms graphs hashing implementation *1900	0 / 0	6
	4143	P1230A Dawid and Bags of Candies brute force implementation *800	0 / 0	3
	4132	P1236A Stones brute force greedy math *800	0 / 0	3
	4129	P1236D Alice and the Doll brute force data structures greedy implementation *2300	0 / 0	8
	4094	P1244B Rooms and Staircases brute force implementation *1000	0 / 0	3
	4093	P1244C The Football Season brute force math number theory *2000	0 / 0	7
	4092	P1244D Paint the Tree brute force constructive algorithms dp graphs implementation trees *1800	0 / 0	6
	4083	P1245F Daniel and Spring Cleaning bitmasks brute force combinatorics dp *2300	0 / 0	8
	4079	P1248D1 The World Is Just a Programming Task (Easy Version) brute force dp greedy implementation *2000	0 / 0	7

Pick a problem randomly based on the current filter.