Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3184	P1366E Two Arrays binary search brute force combinatorics constructive algorithms dp two pointers *2100	0 / 0	7
	3183	P1366F Jog Around The Graph binary search dp geometry graphs *2700	0 / 0	10
	3182	P1366G Construct the String data structures dp strings *2700	0 / 0	10
	3181	P1367A Short Substrings implementation strings *800	0 / 0	3
	3180	P1367B Even Array greedy math *800	0 / 0	3
	3179	P1367C Social Distance constructive algorithms greedy math *1300	0 / 0	4
	3178	P1367D Task On The Board constructive algorithms greedy implementation sortings *1800	0 / 0	6
	3177	P1367E Necklace Assembly brute force dfs and similar dp graphs greedy number theory *1900	0 / 0	6
	3176	P1367F1 Flying Sort (Easy Version) dp greedy two pointers *2100	0 / 0	7
	3175	P1367F2 Flying Sort (Hard Version) binary search data structures dp greedy sortings two pointers *2400	0 / 0	9
	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
	3172	P1368C Even Picture constructive algorithms *1500	0 / 0	5
	3171	P1368D AND, OR and square sum bitmasks greedy math *1700	0 / 0	5
	3170	P1368E Ski Accidents constructive algorithms graphs greedy *2500	0 / 0	9
	3169	P1368F Lamps on a Circle games implementation interactive math *2600	0 / 0	10
	3168	P1368G Shifting Dominoes data structures geometry graphs trees *3200	0 / 0	10
	3167	P1368H1 Breadboard Capacity (easy version) dp flows greedy *3300	0 / 0	10
	3166	P1368H2 Breadboard Capacity (hard version) *3500	0 / 0	10
	3165	P1369A FashionabLee geometry math *800	0 / 0	3
	3164	P1369B AccurateLee greedy implementation strings *1200	0 / 0	4
	3163	P1369C RationalLee greedy math sortings two pointers *1400	0 / 0	4
	3162	P1369D TediousLee dp graphs greedy math trees *1900	0 / 0	6
	3161	P1369E DeadLee data structures dfs and similar greedy implementation sortings *2400	0 / 0	9
	3160	P1369F BareLee dfs and similar dp games *2700	0 / 0	10
	3159	P1370A Maximum GCD greedy implementation math number theory *800	0 / 0	3
	3158	P1370B GCD Compression constructive algorithms math number theory *1100	0 / 0	3
	3157	P1370C Number Game games math number theory *1400	0 / 0	4
	3156	P1370D Odd-Even Subsequence binary search dp dsu greedy implementation *2000	0 / 0	7
	3155	P1370E Binary Subsequence Rotation binary search constructive algorithms data structures greedy *2100	0 / 0	7
	3154	P1370F1 The Hidden Pair (Easy Version) binary search dfs and similar graphs interactive shortest paths trees *2400	0 / 0	9
	3153	P1370F2 The Hidden Pair (Hard Version) binary search dfs and similar graphs interactive shortest paths trees *2700	0 / 0	10
	3152	P1371A Magical Sticks math *800	0 / 0	3
	3151	P1371B Magical Calendar math *1200	0 / 0	4
	3150	P1371C A Cookie for You greedy implementation math *1300	0 / 0	4
	3149	P1371D Grid-00100 constructive algorithms greedy implementation *1600	0 / 0	5
	3148	P1371E1 Asterism (Easy Version) binary search brute force combinatorics math number theory sortings *1900	0 / 0	6
	3147	P1371E2 Asterism (Hard Version) binary search combinatorics dp math number theory sortings *2300	0 / 0	8
	3146	P1371F Raging Thunder data structures divide and conquer implementation *2800	0 / 0	10
	3145	P1372A Omkar and Completion constructive algorithms implementation *800	0 / 0	3
	3144	P1372B Omkar and Last Class of Math greedy math number theory *1300	0 / 0	4
	3143	P1372C Omkar and Baseball constructive algorithms math *1500	0 / 0	5
	3142	P1372D Omkar and Circle brute force dp games greedy *2100	0 / 0	7
	3141	P1372E Omkar and Last Floor dp greedy two pointers *2900	1 / 1	10
	3140	P1372F Omkar and Modes binary search divide and conquer interactive *2700	0 / 0	10
	3139	P1373A Donut Shops greedy implementation math *1000	0 / 0	3
	3138	P1373B 01 Game games *900	0 / 0	3
	3137	P1373C Pluses and Minuses math *1300	0 / 0	4
	3136	P1373D Maximum Sum on Even Positions divide and conquer dp greedy implementation *1600	0 / 0	5
	3135	P1373E Sum of Digits brute force constructive algorithms dp greedy *2200	0 / 0	8
	3134	P1373F Network Coverage binary search constructive algorithms data structures greedy *2400	0 / 0	9
	3133	P1373G Pawns data structures divide and conquer greedy *2600	0 / 0	10
	3132	P1374A Required Remainder math *800	0 / 0	3
	3131	P1374B Multiply by 2, divide by 6 math *900	0 / 0	3
	3130	P1374C Move Brackets greedy strings *1000	0 / 0	3
	3129	P1374D Zero Remainder Array math sortings two pointers *1400	0 / 0	4
	3128	P1374E1 Reading Books (easy version) data structures greedy sortings *1600	0 / 0	5
	3127	P1374E2 Reading Books (hard version) data structures greedy implementation sortings ternary search two pointers *2500	0 / 0	9
	3126	P1374F Cyclic Shifts Sorting brute force constructive algorithms implementation sortings *2400	0 / 0	9
	3125	P1375A Sign Flipping constructive algorithms math *1100	0 / 0	3
	3124	P1375B Neighbor Grid constructive algorithms greedy *1200	0 / 0	4
	3123	P1375C Element Extermination constructive algorithms data structures greedy *1400	0 / 0	4
	3122	P1375D Replace by MEX brute force constructive algorithms sortings *1900	0 / 0	6
	3121	P1375E Inversion SwapSort constructive algorithms greedy sortings *2500	0 / 0	9
	3120	P1375F Integer Game constructive algorithms games interactive math *2600	0 / 0	10
	3119	P1375G Tree Modification brute force constructive algorithms dfs and similar graph matchings graphs trees *2800	0 / 0	10
	3118	P1375H Set Merging constructive algorithms divide and conquer *3300	0 / 0	10
	3117	P1375I Cubic Lattice geometry math matrices number theory *3500	0 / 0	10
	3116	P1379A Acacius and String brute force implementation strings *1500	0 / 0	5
	3115	P1379B Dubious Cyrpto binary search brute force math number theory *1500	0 / 0	5
	3114	P1379C Choosing flowers binary search brute force data structures dfs and similar dp greedy sortings two pointers *2000	0 / 0	7
	3113	P1379D New Passenger Trams binary search brute force data structures sortings two pointers *2300	0 / 0	8
	3112	P1379E Inverse Genealogy constructive algorithms divide and conquer dp math trees *2800	0 / 0	10
	3111	P1379F1 Chess Strikes Back (easy version) binary search data structures *2700	0 / 0	10
	3110	P1379F2 Chess Strikes Back (hard version) data structures divide and conquer *2800	0 / 0	10
	3109	P1380A Three Indices brute force data structures *900	0 / 0	3
	3108	P1380B Universal Solution greedy *1400	0 / 0	4
	3107	P1380C Create The Teams brute force dp greedy implementation sortings *1400	0 / 0	4
	3106	P1380D Berserk And Fireball constructive algorithms greedy implementation math two pointers *2000	0 / 0	7
	3105	P1380E Merging Towers data structures dsu implementation trees *2300	0 / 0	8
	3104	P1380F Strange Addition data structures dp matrices *2600	0 / 0	10
	3103	P1380G Circular Dungeon greedy math probabilities *2600	0 / 0	10
	3102	P1381A1 Prefix Flip (Easy Version) constructive algorithms data structures strings *1300	0 / 0	4
	3101	P1381A2 Prefix Flip (Hard Version) constructive algorithms data structures implementation strings two pointers *1700	0 / 0	5
	3100	P1381B Unmerge dp *1800	0 / 0	6
	3099	P1381C Mastermind constructive algorithms graph matchings greedy implementation sortings two pointers *2500	0 / 0	9
	3098	P1381D The Majestic Brown Tree Snake dfs and similar dp greedy trees two pointers *3000	0 / 0	10
	3097	P1381E Origami geometry math sortings *3300	0 / 0	10
	3096	P1382A Common Subsequence brute force *800	0 / 0	3
	3095	P1382B Sequential Nim dp games *1100	0 / 0	3
	3094	P1383A String Transformation 1 dsu graphs greedy sortings strings trees two pointers *1700	0 / 0	5
	3093	P1383B GameGame bitmasks constructive algorithms dp games greedy math *1900	0 / 0	6
	3092	P1383C String Transformation 2 bitmasks dp graphs trees *3100	0 / 0	10
	3091	P1383D Rearrange brute force constructive algorithms graphs greedy sortings *2800	0 / 0	10
	3090	P1383E Strange Operation combinatorics data structures dp *2800	0 / 0	10
	3089	P1383F Special Edges flows graphs *3200	0 / 0	10
	3088	P1384A Common Prefixes constructive algorithms greedy strings *1200	0 / 0	4
	3087	P1384B1 Koa and the Beach (Easy Version) brute force dp greedy *1900	0 / 0	6
	3086	P1384B2 Koa and the Beach (Hard Version) constructive algorithms dp greedy implementation *2200	0 / 0	8
	3085	P1385A Three Pairwise Maximums math *800	0 / 0	3

Pick a problem randomly based on the current filter.