Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1187	P1672G Cross Xor constructive algorithms graphs math matrices *3200	0 / 0	10
	1186	P1672H Zigu Zagu constructive algorithms data structures greedy *2700	0 / 0	10
	1185	P1672I PermutationForces data structures greedy *3000	0 / 0	10
	1184	P1673A Subtle Substring Subtraction games greedy strings *800	1 / 4	3
	1183	P1673B A Perfectly Balanced String? brute force greedy strings *1100	0 / 0	3
	1182	P1673C Palindrome Basis brute force dp math number theory *1500	0 / 0	5
	1181	P1673D Lost Arithmetic Progression combinatorics math number theory *1900	0 / 0	6
	1180	P1673E Power or XOR? bitmasks combinatorics math number theory *2500	0 / 0	9
	1179	P1673F Anti-Theft Road Planning bitmasks constructive algorithms divide and conquer greedy interactive math *2400	0 / 0	9
	1178	P1674A Number Transformation constructive algorithms math *800	0 / 0	3
	1177	P1674B Dictionary combinatorics math *800	0 / 0	3
	1176	P1674C Infinite Replacement combinatorics implementation strings *1000	0 / 0	3
	1175	P1674D A-B-C Sort constructive algorithms implementation sortings *1200	0 / 0	4
	1174	P1674E Breaking the Wall binary search brute force constructive algorithms greedy math *2000	0 / 0	7
	1173	P1674F Desktop Rearrangement data structures greedy implementation *1800	0 / 0	6
	1172	P1674G Remove Directed Edges dfs and similar dp graphs *2000	0 / 0	7
	1171	P1675A Food for Animals greedy math *800	0 / 0	3
	1170	P1675B Make It Increasing greedy implementation *900	0 / 0	3
	1169	P1675C Detective Task implementation *1100	0 / 0	3
	1168	P1675D Vertical Paths graphs implementation trees *1300	0 / 0	4
	1167	P1675E Replace With the Previous, Minimize dsu greedy strings *1500	0 / 0	5
	1166	P1675F Vlad and Unfinished Business dfs and similar dp greedy trees *1800	0 / 0	6
	1165	P1675G Sorting Pancakes dp *2300	0 / 0	8
	1164	P1676A Lucky? implementation *800	0 / 0	3
	1163	P1676B Equal Candies greedy math sortings *800	0 / 0	3
	1162	P1676C Most Similar Words brute force greedy implementation implementation math strings *800	0 / 0	3
	1161	P1676D X-Sum brute force greedy implementation *1000	0 / 0	3
	1160	P1676E Eating Queries binary search greedy sortings *1100	2 / 2	3
	1159	P1676F Longest Strike data structures greedy implementation sortings two pointers *1300	0 / 0	4
	1158	P1676G White-Black Balanced Subtrees dfs and similar dp graphs trees *1300	0 / 0	4
	1157	P1676H1 Maximum Crossings (Easy Version) brute force *1400	0 / 0	4
	1156	P1676H2 Maximum Crossings (Hard Version) data structures divide and conquer sortings *1500	0 / 0	5
	1155	P1677A Tokitsukaze and Strange Inequality brute force data structures dp *1600	0 / 0	5
	1154	P1677B Tokitsukaze and Meeting data structures implementation math *1700	0 / 0	5
	1153	P1677C Tokitsukaze and Two Colorful Tapes constructive algorithms dfs and similar graphs greedy *1900	0 / 0	6
	1152	P1677D Tokitsukaze and Permutations dp math *2500	0 / 0	9
	1151	P1677E Tokitsukaze and Beautiful Subsegments data structures *2900	0 / 0	10
	1150	P1677F Tokitsukaze and Gems dp math *3500	0 / 0	10
	1149	P1678A Tokitsukaze and All Zero Sequence implementation *800	0 / 0	3
	1148	P1678B1 Tokitsukaze and Good 01-String (easy version) implementation *800	0 / 0	3
	1147	P1678B2 Tokitsukaze and Good 01-String (hard version) dp greedy implementation *1800	0 / 0	6
	1146	P1679A AvtoBus brute force greedy math number theory *900	0 / 0	3
	1145	P1679B Stone Age Problem data structures implementation *1200	0 / 0	4
	1144	P1679C Rooks Defenders data structures implementation *1400	0 / 0	4
	1143	P1679D Toss a Coin to Your Graph... binary search dfs and similar dp graphs *1900	0 / 0	6
	1142	P1679E Typical Party in Dorm bitmasks combinatorics dp strings *2400	0 / 0	9
	1141	P1679F Formalism for Formalism bitmasks dp math *2600	0 / 0	10
	1140	P1680A Minimums and Maximums brute force math *800	0 / 0	3
	1139	P1680B Robots implementation *800	0 / 0	3
	1138	P1680C Binary String binary search greedy strings two pointers *1600	1 / 1	5
	1137	P1680D Dog Walking brute force greedy math *2400	0 / 0	9
	1136	P1680E Moving Chips bitmasks dp greedy *2000	0 / 0	7
	1135	P1680F Lenient Vertex Cover dfs and similar divide and conquer dsu graphs trees *2600	0 / 0	10
	1134	P1681A Game with Cards games greedy *800	0 / 0	3
	1133	P1681B Card Trick implementation math *800	0 / 0	3
	1132	P1681C Double Sort implementation sortings *1200	0 / 0	4
	1131	P1681D Required Length brute force dfs and similar dp hashing shortest paths *1700	0 / 0	5
	1130	P1681E Labyrinth Adventures data structures dp matrices shortest paths *2600	0 / 0	10
	1129	P1681F Unique Occurrences data structures dfs and similar divide and conquer dp dsu trees *2300	0 / 0	8
	1128	P1682A Palindromic Indices greedy strings *800	0 / 0	3
	1127	P1682B AND Sorting bitmasks constructive algorithms sortings *1100	0 / 0	3
	1126	P1682C LIS or Reverse LIS? constructive algorithms greedy implementation math *1400	0 / 0	4
	1125	P1682D Circular Spanning Tree constructive algorithms implementation trees *2000	0 / 0	7
	1124	P1682E Unordered Swaps constructive algorithms dfs and similar graphs greedy math sortings trees *2700	0 / 0	10
	1123	P1682F MCMF? data structures flows graphs greedy sortings two pointers *2700	0 / 0	10
	1122	P1684A Digit Minimization constructive algorithms games math strings *800	0 / 0	3
	1121	P1684B Z mod X = C constructive algorithms math *800	0 / 0	3
	1120	P1684C Column Swapping brute force constructive algorithms greedy implementation sortings *1400	0 / 0	4
	1119	P1684D Traps constructive algorithms greedy sortings *1700	1 / 1	5
	1118	P1684E MEX vs DIFF binary search brute force constructive algorithms data structures greedy two pointers *2100	0 / 0	7
	1117	P1684F Diverse Segments data structures two pointers *2600	0 / 0	10
	1116	P1684G Euclid Guess constructive algorithms flows graph matchings math number theory *2800	0 / 0	10
	1114	P1684H Hard Cut constructive algorithms dfs and similar divide and conquer math *3400	0 / 0	10
	1112	P1685A Circular Local MiniMax constructive algorithms greedy sortings *1100	0 / 0	3
	1110	P1685B Linguistics greedy implementation sortings strings *2000	0 / 0	7
	1109	P1685C Bring Balance brute force constructive algorithms greedy *2600	0 / 0	10
	1107	P1685D1 Permutation Weight (Easy Version) constructive algorithms dfs and similar dsu *2800	0 / 0	10
	1105	P1685D2 Permutation Weight (Hard Version) constructive algorithms greedy *3500	0 / 0	10
	1102	P1685E The Ultimate LIS Problem data structures greedy *3500	0 / 0	10
	1101	P1686A Everything Everywhere All But One greedy *800	0 / 0	3
	1099	P1686B Odd Subarrays dp greedy *800	0 / 0	3
	1096	P1687A The Enchanted Forest brute force greedy *1600	0 / 0	5
	1095	P1687B Railway System constructive algorithms graphs greedy interactive sortings *1700	0 / 0	5
	1092	P1687C Sanae and Giant Robot binary search brute force data structures dsu greedy sortings *2500	0 / 0	9
	1090	P1687D Cute number binary search brute force data structures dsu implementation math *2900	0 / 0	10
	1088	P1687E Become Big For Me combinatorics constructive algorithms greedy math number theory *3500	0 / 0	10
	1087	P1687F Koishi's Unconscious Permutation fft math *3500	0 / 0	10
	1084	P1688A Cirno's Perfect Bitmasks Classroom bitmasks brute force *800	0 / 0	3
	1082	P1688B Patchouli's Magical Talisman bitmasks constructive algorithms greedy sortings *800	0 / 0	3
	1081	P1688C Manipulating History constructive algorithms greedy strings *1700	0 / 0	5
	1078	P1689A Lex String brute force greedy implementation sortings two pointers *800	0 / 0	3
	1077	P1689B Mystic Permutation data structures greedy *900	0 / 0	3
	1074	P1689C Infected Tree dfs and similar dp trees *1600	0 / 0	5
	1073	P1689D Lena and Matrix data structures dp geometry shortest paths *1900	0 / 0	6
	1071	P1689E ANDfinity bitmasks brute force constructive algorithms dfs and similar dsu graphs *2500	0 / 0	9
	1068	P1690A Print a Pedestal (Codeforces logo?) constructive algorithms greedy *800	0 / 0	3
	1067	P1690B Array Decrements greedy implementation *800	0 / 0	3
	1066	P1690C Restoring the Duration of Tasks data structures greedy implementation *800	0 / 0	3
	1065	P1690D Black and White Stripe implementation two pointers *1000	0 / 0	3
	1064	P1690E Price Maximization binary search greedy math two pointers *1500	0 / 0	5

Pick a problem randomly based on the current filter.