	ID	题目显示标签隐藏标签	AC / 尝试	难度
	2192	P1153B Serval and Toy Bricks constructive algorithms greedy *1200	0 / 0	(无)
	2191	P1153C Serval and Parenthesis Sequence greedy strings *1700	0 / 0	(无)
	2190	P1153D Serval and Rooted Tree binary search dfs and similar dp greedy trees *1900	0 / 0	(无)
	2184	P1154D Walking Robot greedy *1500	0 / 0	(无)
	2182	P1154F Shovels Shop dp greedy sortings *2100	0 / 0	(无)
	2181	P1154G Minimum Possible LCM brute force greedy math number theory *2200	0 / 0	(无)
	2179	P1155B Game with Telephone Numbers games greedy implementation *1200	0 / 0	(无)
	2177	P1155D Beautiful Array brute force data structures divide and conquer dp greedy *1900	0 / 0	(无)
	2173	P1156B Ugly Pairs dfs and similar greedy implementation sortings strings *1800	0 / 0	(无)
	2172	P1156C Match Points binary search greedy sortings ternary search two pointers *2000	0 / 0	(无)
	2168	P1156G Optimizer graphs greedy hashing implementation *2700	0 / 0	(无)
	2166	P1157B Long Number greedy *1300	0 / 0	(无)
	2165	P1157C1 Increasing Subsequence (easy version) greedy *1300	0 / 0	(无)
	2164	P1157C2 Increasing Subsequence (hard version) greedy *1700	0 / 0	(无)
	2163	P1157D N Problems During K Days constructive algorithms greedy math *1900	0 / 0	(无)
	2162	P1157E Minimum Array binary search data structures greedy *1700	0 / 0	(无)
	2161	P1157F Maximum Balanced Circle constructive algorithms dp greedy two pointers *2000	0 / 0	(无)
	2159	P1158A The Party and Sweets binary search constructive algorithms greedy implementation math sortings two pointers *1500	0 / 0	(无)
	2157	P1158C Permutation recovery constructive algorithms data structures dfs and similar graphs greedy math sortings *2100	0 / 0	(无)
	2156	P1158D Winding polygonal line constructive algorithms geometry greedy math *2600	0 / 0	(无)
	2149	P1162B Double Matrix brute force greedy *1400	0 / 0	(无)
	2148	P1163A Eating Soup greedy math *900	0 / 0	(无)
	2139	P1165B Polycarp Training data structures greedy sortings *1000	0 / 0	(无)
	2138	P1165C Good String greedy *1300	0 / 0	(无)
	2136	P1165E Two Arrays and Sum of Functions greedy math sortings *1600	0 / 0	(无)
	2135	P1165F1 Microtransactions (easy version) binary search greedy *2000	0 / 0	(无)
	2134	P1165F2 Microtransactions (hard version) binary search greedy implementation *2000	0 / 0	(无)
	2133	P1166A Silent Classroom combinatorics greedy *900	0 / 0	(无)
	2130	P1166D Cute Sequences binary search brute force greedy math *2200	0 / 0	(无)
	2127	P1167A Telephone Number brute force greedy strings *800	0 / 0	(无)
	2124	P1167D Bicolored RBS constructive algorithms greedy *1500	0 / 0	(无)
	2120	P1168A Increasing by Modulo binary search greedy *1700	0 / 0	(无)
	2108	P1170F Wheels *special problem binary search greedy	0 / 0	(无)
	2104	P1172A Nauuo and Cards greedy implementation *1800	0 / 0	(无)
	2097	P1173A Nauuo and Votes greedy *800	0 / 0	(无)
	2096	P1173B Nauuo and Chess constructive algorithms greedy *1100	0 / 0	(无)
	2095	P1174A Ehab Fails to Be Thanos constructive algorithms greedy sortings *1000	0 / 0	(无)
	2087	P1175C Electrification binary search brute force greedy *1600	0 / 0	(无)
	2086	P1175D Array Splitting greedy sortings *1900	0 / 0	(无)
	2085	P1175E Minimal Segment Cover data structures dfs and similar divide and conquer dp greedy implementation trees *2200	0 / 0	(无)
	2082	P1176A Divide it! brute force greedy implementation *800	0 / 0	(无)
	2080	P1176C Lose it! dp greedy implementation *1300	0 / 0	(无)
	2079	P1176D Recover it! dfs and similar graphs greedy number theory sortings *1800	0 / 0	(无)
	2074	P1178A Prime Minister greedy *800	0 / 0	(无)
	2072	P1178C Tiles combinatorics greedy math *1300	0 / 0	(无)
	2071	P1178D Prime Graph constructive algorithms greedy math number theory *1500	0 / 0	(无)
	2070	P1178E Archaeology brute force constructive algorithms greedy strings *1900	0 / 0	(无)
	2063	P1179C Serge and Dining Room binary search data structures graph matchings greedy implementation math trees *2200	0 / 0	(无)
	2059	P1180B Nick and Array greedy implementation *1500	0 / 0	(无)
	2058	P1181A Chunga-Changa greedy math *1000	0 / 0	(无)
	2057	P1181B Split a Number greedy implementation strings *1500	0 / 0	(无)
	2053	P1181E2 A Story of One Country (Hard) brute force greedy sortings *3000	0 / 0	(无)
	2050	P1182C Beautiful Lyrics data structures greedy strings *1700	0 / 0	(无)
	2043	P1183D Candy Box (easy version) greedy sortings *1400	0 / 0	(无)
	2040	P1183G Candy Box (hard version) greedy implementation sortings *2000	0 / 0	(无)
	2022	P1185C1 Exam in BerSU (easy version) greedy sortings *1200	0 / 0	(无)
	2021	P1185C2 Exam in BerSU (hard version) brute force data structures greedy math *1700	0 / 0	(无)
	2013	P1186D Vus the Cossack and Numbers constructive algorithms greedy math *1500	0 / 0	(无)
	2011	P1186F Vus the Cossack and a Graph dfs and similar graphs greedy implementation *2400	0 / 0	(无)
	2008	P1187C Vasya And Array constructive algorithms greedy implementation *1800	0 / 0	(无)
	1996	P1189B Number Circle greedy math sortings *1100	0 / 0	(无)
	1992	P1190C Tokitsukaze and Duel brute force games greedy *2300	0 / 0	(无)
	1990	P1190E Tokitsukaze and Explosion binary search greedy *3100	0 / 0	(无)
	1973	P1195A Drinks Choosing greedy math *1000	0 / 0	(无)
	1952	P1197A DIY Wooden Ladder greedy math sortings *900	0 / 0	(无)
	1953	P1197A DIY Wooden Ladder greedy math sortings *900	0 / 0	(无)
	1950	P1197B Pillars greedy implementation *1000	0 / 0	(无)
	1951	P1197B Pillars greedy implementation *1000	0 / 0	(无)
	1948	P1197C Array Splitting greedy sortings *1400	0 / 0	(无)
	1949	P1197C Array Splitting greedy sortings *1400	0 / 0	(无)
	1946	P1197D Yet Another Subarray Problem dp greedy math *1900	0 / 0	(无)
	1947	P1197D Yet Another Subarray Problem dp greedy math *1900	0 / 0	(无)
	1936	P1198C Matching vs Independent Set constructive algorithms graphs greedy sortings *2000	0 / 0	(无)
	1937	P1198C Matching vs Independent Set constructive algorithms graphs greedy sortings *2000	0 / 0	(无)
	1930	P1198F GCD Groups 2 greedy number theory probabilities *2900	0 / 0	(无)
	1931	P1198F GCD Groups 2 greedy number theory probabilities *2900	0 / 0	(无)
	1922	P1200B Block Adventure dp greedy *1200	0 / 0	(无)
	1923	P1200B Block Adventure dp greedy *1200	0 / 0	(无)
	1910	P1201B Zero Array greedy math *1500	0 / 0	(无)
	1911	P1201B Zero Array greedy math *1500	0 / 0	(无)
	1908	P1201C Maximum Median binary search greedy math sortings *1400	0 / 0	(无)
	1909	P1201C Maximum Median binary search greedy math sortings *1400	0 / 0	(无)
	1906	P1201D Treasure Hunting binary search dp greedy implementation *2100	0 / 0	(无)
	1907	P1201D Treasure Hunting binary search dp greedy implementation *2100	0 / 0	(无)
	1900	P1202A You Are Given Two Binary Strings... bitmasks greedy *1100	0 / 0	(无)
	1901	P1202A You Are Given Two Binary Strings... bitmasks greedy *1100	0 / 0	(无)
	1896	P1202C You Are Given a WASD-string... brute force data structures dp greedy implementation math strings *2100	0 / 0	(无)
	1897	P1202C You Are Given a WASD-string... brute force data structures dp greedy implementation math strings *2100	0 / 0	(无)
	1886	P1203B Equal Rectangles greedy math *1200	0 / 0	(无)
	1887	P1203B Equal Rectangles greedy math *1200	0 / 0	(无)
	1883	P1203D1 Remove the Substring (easy version) greedy implementation *1600	0 / 0	(无)
	1882	P1203D2 Remove the Substring (hard version) binary search greedy implementation two pointers *1700	0 / 0	(无)
	1881	P1203E Boxers greedy sortings *1500	0 / 0	(无)
	1880	P1203F1 Complete the Projects (easy version) greedy *2100	0 / 0	(无)
	1879	P1203F2 Complete the Projects (hard version) dp greedy *2300	0 / 0	(无)
	1876	P1204B Mislove Has Lost an Array greedy math *900	0 / 0	(无)
	1874	P1204C Anna, Svyatoslav and Maps dp graphs greedy shortest paths *1700	0 / 0	(无)
	1872	P1204D1 Kirk and a Binary String (easy version) brute force greedy strings *2000	0 / 0	(无)
	1871	P1204D2 Kirk and a Binary String (hard version) data structures greedy math strings *2100	0 / 0	(无)
	1869	P1205A Almost Equal constructive algorithms greedy math *1200	0 / 0	(无)

HGNU

根据当前过滤条件随机选择一道题

状态

支持

开发与维护

杨旭龙、王树淳、王国斌、宋文宇、朱天伦

特别鸣谢

肖飞、关玉蓉、魏银珍、周芬

Worker 0, 152ms
Powered by Hydro v4.13.4
Modified by HGNU ACM TEAM (Repo Link)