brute force - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	4075	P1249C1 Good Numbers (easy version) brute force greedy implementation *1300	0 / 0	4
	4068	P1250B The Feast and the Bus brute force constructive algorithms greedy math *1800	0 / 0	6
	4064	P1250F Data Center brute force implementation *800	0 / 0	3
	4061	P1250I Show Must Go On binary search brute force greedy shortest paths *3100	0 / 0	10
	4055	P1251A Broken Keyboard brute force strings two pointers *1000	0 / 0	3
	4025	P1252J Tiling Terrace brute force dp *2300	0 / 0	8
	3967	P1257F Make Them Similar bitmasks brute force hashing meet-in-the-middle *2400	0 / 0	9
	3955	P1260E Tournament brute force dp greedy *2400	0 / 0	9
	3936	P1264B Beautiful Sequence brute force constructive algorithms greedy *1900	0 / 0	6
	3886	P1267I Intriguing Selection brute force constructive algorithms implementation interactive sortings *2600	0 / 0	10
	3871	P1268D Invertation in Tournament brute force divide and conquer graphs math *3200	0 / 0	10
	3867	P1269A Equation brute force math *800	0 / 0	3
	3865	P1269B Modulo Equality brute force sortings *1500	0 / 0	5
	3848	P1271A Suits brute force greedy math *800	0 / 0	3
	3843	P1271C Shawarma Tent brute force geometry greedy implementation *1300	1 / 1	4
	3837	P1271F Divide The Students brute force *2700	0 / 0	10
	3836	P1272A Three Friends brute force greedy math sortings *900	0 / 0	3
	3829	P1272D Remove One Element brute force dp *1500	0 / 0	5
	3819	P1276C Beautiful Rectangle brute force combinatorics constructive algorithms data structures greedy math *2300	0 / 0	8
	3806	P1278A Shuffle Hashing brute force implementation strings *1000	0 / 0	3
	3791	P1279B Verse For Santa binary search brute force implementation *1300	0 / 0	4
	3733	P1285C Fadi and LCM brute force math number theory *1400	0 / 0	4
	3732	P1285D Dr bitmasks brute force dfs and similar divide and conquer dp greedy strings trees *1900	0 / 0	6
	3729	P1285E Delete a Segment brute force constructive algorithms data structures dp graphs sortings trees two pointers *2300	0 / 0	8
	3722	P1286C1 Madhouse (Easy version) brute force constructive algorithms interactive math *2400	0 / 0	9
	3719	P1286C2 Madhouse (Hard version) brute force constructive algorithms hashing interactive math *2800	0 / 0	10
	3714	P1286F Harry The Potter brute force constructive algorithms dp fft implementation math *3100	0 / 0	10
	3711	P1287B Hyperset brute force data structures implementation *1500	0 / 0	5
	3710	P1288A Deadline binary search brute force math ternary search *1100	0 / 0	3
	3699	P1290A Mind Control brute force data structures implementation *1600	0 / 0	5
	3681	P1292B Aroma's Search brute force constructive algorithms geometry greedy implementation *1700	0 / 0	5
	3676	P1293A ConneR and the A.R.C binary search brute force implementation *1100	0 / 0	3
	3620	P1299A Anu Has a Function brute force greedy math *1500	0 / 0	5
	3602	P1302F Keep talking and nobody explodes – easy bitmasks brute force expression parsing	0 / 0	(None)
	3589	P1304B Longest Palindrome brute force constructive algorithms greedy implementation strings *1100	0 / 0	3
	3583	P1305A Kuroni and the Gifts brute force constructive algorithms greedy sortings *800	0 / 0	3
	3581	P1305C Kuroni and Impossible Calculation brute force combinatorics math number theory *1600	0 / 0	5
	3577	P1305G Kuroni and Antihype bitmasks brute force dp dsu graphs *3500	0 / 0	10
	3573	P1307C Cow and Message brute force dp math strings *1500	0 / 0	5
	3552	P1311C Perform the Combo brute force *1300	0 / 0	4
	3550	P1311D Three Integers brute force math *2000	0 / 0	7
	3547	P1311E Construct the Binary Tree brute force constructive algorithms trees *2200	0 / 0	8
	3535	P1313A Fast Food Restaurant brute force greedy implementation *900	0 / 0	3
	3533	P1313C1 Skyscrapers (easy version) brute force data structures dp greedy *1500	0 / 0	5
	3521	P1316B String Modification brute force constructive algorithms implementation sortings strings *1400	0 / 1	4
	3508	P1320C World of Darkraft: Battle for Azathoth brute force data structures sortings *2000	0 / 0	7
	3502	P1320F Blocks and Sensors brute force *3500	0 / 0	10
	3498	P1321C Remove Adjacent brute force constructive algorithms greedy strings *1600	0 / 0	5
	3485	P1323A Even Subset Sum Problem brute force dp greedy implementation *800	0 / 0	3
	3480	P1324B Yet Another Palindrome Problem brute force strings *1100	0 / 0	3
	3469	P1325E Ehab's REAL Number Theory Problem brute force dfs and similar graphs number theory shortest paths *2600	0 / 0	10
	3455	P1326F1 Wise Men (Easy Version) bitmasks brute force dp meet-in-the-middle *2600	0 / 0	10
	3449	P1327B Princesses and Princes brute force graphs greedy *1200	0 / 0	4
	3447	P1327D Infinite Path brute force dfs and similar graphs math number theory *2200	0 / 0	8
	3439	P1328B K-th Beautiful String binary search brute force combinatorics implementation math *1300	0 / 0	4
	3406	P1331F Elementary! *special problem brute force dp strings	0 / 0	(None)
	3398	P1332B Composite Coloring brute force constructive algorithms greedy math number theory *1400	0 / 0	4
	3384	P1333D Challenges in school №41 brute force constructive algorithms games graphs greedy implementation sortings *2100	0 / 0	7
	3383	P1333E Road to 1600 brute force constructive algorithms *2400	0 / 0	9
	3379	P1334C Circle of Monsters brute force constructive algorithms greedy math *1600	0 / 0	5
	3374	P1334G Substring Search bitmasks brute force fft *2900	0 / 0	10
	3366	P1335E1 Three Blocks Palindrome (easy version) binary search brute force data structures dp two pointers *1700	0 / 0	5
	3364	P1335E2 Three Blocks Palindrome (hard version) brute force data structures dp two pointers *1800	0 / 0	6
	3357	P1336E1 Chiori and Doll Picking (easy version) bitmasks brute force combinatorics math *2700	0 / 0	10
	3356	P1336E2 Chiori and Doll Picking (hard version) bitmasks brute force combinatorics math *3500	0 / 0	10
	3350	P1338C Perfect Triples bitmasks brute force constructive algorithms divide and conquer math *2200	0 / 0	8
	3347	P1339A Filling Diamonds brute force dp implementation math *900	0 / 0	3
	3345	P1340A Nastya and Strange Generator brute force data structures greedy implementation *1500	0 / 0	5
	3340	P1340F Nastya and CBS brute force data structures hashing *3300	0 / 0	10
	3332	P1342F Make It Ascending bitmasks brute force dp *3000	0 / 0	10
	3331	P1343A Candies brute force math *900	0 / 0	3
	3328	P1343D Constant Palindrome Sum brute force data structures greedy two pointers *1700	0 / 0	5
	3327	P1343E Weights Distributing brute force graphs greedy shortest paths sortings *2100	0 / 0	7
	3326	P1343F Restore the Permutation by Sorted Segments brute force constructive algorithms data structures greedy implementation *2400	0 / 0	9
	3318	P1345B Card Constructions binary search brute force dp math *1100	0 / 0	3
	3304	P1348E Phoenix and Berries brute force dp greedy math *2400	0 / 0	9
	3292	P1351B Square? brute force implementation math *900	0 / 0	3
	3286	P1352E Special Elements brute force implementation two pointers *1500	0 / 0	5
	3279	P1353E K-periodic Garland brute force dp greedy *1900	0 / 0	6
	3278	P1353F Decreasing Heights brute force dp *2200	0 / 0	8
	3274	P1354C2 Not So Simple Polygon Embedding binary search brute force geometry math *2000	0 / 0	7
	3269	P1355A Sequence with Digits brute force implementation math *1200	0 / 0	4
	3232	P1358D The Best Vacation binary search brute force greedy implementation two pointers *1900	0 / 0	6
	3229	P1359A Berland Poker brute force greedy math *1000	0 / 0	3
	3228	P1359B New Theatre Square brute force dp greedy implementation two pointers *1000	0 / 0	3
	3224	P1359F RC Kaboom Show binary search brute force data structures geometry math *2900	0 / 0	10
	3218	P1360F Spy-string bitmasks brute force constructive algorithms dp hashing strings *1700	0 / 0	5
	3216	P1360H Binary Median binary search bitmasks brute force constructive algorithms *2100	0 / 0	7
	3208	P1362B Johnny and His Hobbies bitmasks brute force *1200	0 / 0	4
	3206	P1363A Odd Selection brute force implementation math *1200	0 / 0	4
	3200	P1364A XXXXX brute force data structures number theory two pointers *1200	0 / 0	4
	3198	P1364C Ehab and Prefix MEXs brute force constructive algorithms greedy *1600	0 / 0	5
	3191	P1365E Maximum Subsequence Value brute force constructive algorithms *1900	0 / 0	6
	3184	P1366E Two Arrays binary search brute force combinatorics constructive algorithms dp two pointers *2100	0 / 0	7
	3177	P1367E Necklace Assembly brute force dfs and similar dp graphs greedy number theory *1900	0 / 0	6
	3174	P1368A C+= brute force greedy implementation math *800	0 / 0	3
	3173	P1368B Codeforces Subsequences brute force constructive algorithms greedy math strings *1500	0 / 0	5
	3148	P1371E1 Asterism (Easy Version) binary search brute force combinatorics math number theory sortings *1900	0 / 0	6
	3142	P1372D Omkar and Circle brute force dp games greedy *2100	0 / 0	7
	3135	P1373E Sum of Digits brute force constructive algorithms dp greedy *2200	0 / 0	8

Pick a problem randomly based on the current filter.