	ID	题目显示标签隐藏标签	AC / 尝试	难度
	2384	P1111B Average Superhero Gang Power brute force implementation math *1700	0 / 0	(无)
	2383	P1111C Creative Snap binary search brute force divide and conquer math *1700	0 / 0	(无)
	2378	P1114A Got Any Grapes? brute force greedy implementation *800	0 / 0	(无)
	2376	P1114C Trailing Loves (or L'oeufs?) brute force implementation math number theory *1700	0 / 0	(无)
	2343	P1118D1 Coffee and Coursework (Easy version) brute force greedy *1700	0 / 0	(无)
	2334	P1119E Pavel and Triangles brute force dp fft greedy ternary search *1900	0 / 0	(无)
	2326	P1120E The very same Munchhausen brute force *2600	0 / 0	(无)
	2323	P1121B Mike and Children brute force implementation *1200	0 / 0	(无)
	2321	P1129A1 Toy Train (Simplified) brute force greedy *1700	0 / 0	(无)
	2320	P1129A2 Toy Train brute force greedy *1800	0 / 0	(无)
	2313	P1130C Connect brute force dfs and similar dsu *1400	0 / 0	(无)
	2303	P1132C Painting the Fence brute force *1700	0 / 0	(无)
	2279	P1138B Circus brute force greedy math strings *1800	0 / 0	(无)
	2270	P1140C Playlist brute force data structures sortings *1600	0 / 0	(无)
	2257	P1142A The Beatles brute force math *1700	0 / 0	(无)
	2251	P1143B Nirvana brute force math number theory *1200	0 / 0	(无)
	2241	P1145B Kanban Numbers brute force	0 / 0	(无)
	2240	P1145C Mystery Circuit bitmasks brute force	0 / 0	(无)
	2226	P1147B Chladni Figure brute force strings *1900	0 / 0	(无)
	2220	P1148B Born This Way binary search brute force two pointers *1600	0 / 0	(无)
	2210	P1149D Abandoning Roads brute force dp graphs greedy *3000	0 / 0	(无)
	2206	P1151A Maxim and Biology brute force strings *1000	0 / 0	(无)
	2205	P1151B Dima and a Bad XOR bitmasks brute force constructive algorithms dp *1600	0 / 0	(无)
	2198	P1152C Neko does Maths brute force math number theory *1800	0 / 0	(无)
	2193	P1153A Serval and Bus brute force math *1000	0 / 0	(无)
	2189	P1153E Serval and Snake binary search brute force interactive *2200	0 / 0	(无)
	2181	P1154G Minimum Possible LCM brute force greedy math number theory *2200	0 / 0	(无)
	2177	P1155D Beautiful Array brute force data structures divide and conquer dp greedy *1900	0 / 0	(无)
	2176	P1155E Guess the Root brute force interactive math *2200	0 / 0	(无)
	2175	P1155F Delivery Oligopoly brute force dp graphs *2800	0 / 0	(无)
	2160	P1157G Inverse of Rows and Columns brute force constructive algorithms *2200	0 / 0	(无)
	2149	P1162B Double Matrix brute force greedy *1400	0 / 0	(无)
	2145	P1163C1 Power Transmission (Easy Edition) brute force geometry *1900	0 / 0	(无)
	2142	P1163E Magical Permutation bitmasks brute force constructive algorithms data structures graphs math *2400	0 / 0	(无)
	2130	P1166D Cute Sequences binary search brute force greedy math *2200	0 / 0	(无)
	2129	P1166E The LCMs Must be Large bitmasks brute force constructive algorithms math number theory *2100	0 / 0	(无)
	2127	P1167A Telephone Number brute force greedy strings *800	0 / 0	(无)
	2126	P1167B Lost Numbers brute force divide and conquer interactive math *1400	0 / 0	(无)
	2121	P1167G Low Budget Inception brute force geometry *3100	0 / 0	(无)
	2119	P1168B Good Triple brute force two pointers *1900	0 / 0	(无)
	2087	P1175C Electrification binary search brute force greedy *1600	0 / 0	(无)
	2084	P1175F The Number of Subpermutations brute force data structures divide and conquer hashing math *2500	0 / 0	(无)
	2082	P1176A Divide it! brute force greedy implementation *800	0 / 0	(无)
	2070	P1178E Archaeology brute force constructive algorithms greedy strings *1900	0 / 0	(无)
	2056	P1181C Flag brute force combinatorics dp implementation *1900	0 / 0	(无)
	2054	P1181E1 A Story of One Country (Easy) brute force divide and conquer sortings *2500	0 / 0	(无)
	2053	P1181E2 A Story of One Country (Hard) brute force greedy sortings *3000	0 / 0	(无)
	2041	P1183F Topforces Strikes Back brute force math sortings *2100	0 / 0	(无)
	2038	P1184A1 Heidi Learns Hashing (Easy) brute force math number theory *1200	0 / 0	(无)
	2037	P1184A2 Heidi Learns Hashing (Medium) brute force number theory *2100	0 / 0	(无)
	2021	P1185C2 Exam in BerSU (hard version) brute force data structures greedy math *1700	0 / 0	(无)
	2019	P1185E Polycarp and Snakes brute force implementation *2000	0 / 0	(无)
	2018	P1185F Two Pizzas bitmasks brute force *2100	0 / 0	(无)
	1992	P1190C Tokitsukaze and Duel brute force games greedy *2300	0 / 0	(无)
	1988	P1191A Tokitsukaze and Enhancement brute force *800	0 / 0	(无)
	1987	P1191B Tokitsukaze and Mahjong brute force implementation *1200	0 / 0	(无)
	1984	P1192C Cubeword *special problem brute force dp meet-in-the-middle	0 / 0	(无)
	1976	P1194E Count The Rectangles bitmasks brute force data structures geometry sortings *2200	0 / 0	(无)
	1972	P1195B Sport Mafia binary search brute force math *1000	0 / 0	(无)
	1966	P1196A Three Piles of Candies brute force constructive algorithms math *800	0 / 0	(无)
	1954	P1196F K-th Path brute force constructive algorithms shortest paths sortings *2200	0 / 0	(无)
	1955	P1196F K-th Path brute force constructive algorithms shortest paths sortings *2200	0 / 0	(无)
	1938	P1198B Welfare State binary search brute force data structures sortings *1600	0 / 0	(无)
	1939	P1198B Welfare State binary search brute force data structures sortings *1600	0 / 0	(无)
	1924	P1200A Hotelier brute force data structures implementation *800	0 / 0	(无)
	1925	P1200A Hotelier brute force data structures implementation *800	0 / 0	(无)
	1918	P1200D White Lines brute force data structures dp implementation two pointers *1900	0 / 0	(无)
	1919	P1200D White Lines brute force data structures dp implementation two pointers *1900	0 / 0	(无)
	1916	P1200E Compress Words brute force hashing implementation string suffix structures strings *2000	0 / 0	(无)
	1917	P1200E Compress Words brute force hashing implementation string suffix structures strings *2000	0 / 0	(无)
	1914	P1200F Graph Traveler brute force data structures dfs and similar dp graphs implementation math number theory *2300	0 / 0	(无)
	1915	P1200F Graph Traveler brute force data structures dfs and similar dp graphs implementation math number theory *2300	0 / 0	(无)
	1898	P1202B You Are Given a Decimal String... brute force dp shortest paths *1700	0 / 0	(无)
	1899	P1202B You Are Given a Decimal String... brute force dp shortest paths *1700	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	(无)
	1892	P1202E You Are Given Some Strings... brute force string suffix structures strings *2400	0 / 0	(无)
	1893	P1202E You Are Given Some Strings... brute force string suffix structures strings *2400	0 / 0	(无)
	1872	P1204D1 Kirk and a Binary String (easy version) brute force greedy strings *2000	0 / 0	(无)
	1868	P1205B Shortest Cycle bitmasks brute force graphs shortest paths *1900	0 / 0	(无)
	1861	P1207A There Are Two Types Of Burgers brute force greedy implementation math *800	0 / 0	(无)
	1856	P1207F Remainder Problem brute force data structures implementation *2100	0 / 0	(无)
	1853	P1208B Uniqueness binary search brute force implementation two pointers *1500	0 / 0	(无)
	1842	P1209E1 Rotate Columns (easy version) bitmasks brute force dp greedy sortings *2000	0 / 0	(无)
	1836	P1210A Anadi and Domino brute force graphs *1700	0 / 0	(无)
	1835	P1210B Marcin and Training Camp brute force greedy *1700	0 / 0	(无)
	1831	P1210F1 Marek and Matching (easy version) brute force probabilities *3100	0 / 0	(无)
	1830	P1210F2 Marek and Matching (hard version) brute force probabilities *3200	0 / 0	(无)
	1816	P1213D1 Equalizing by Division (easy version) brute force implementation *1500	0 / 0	(无)
	1815	P1213D2 Equalizing by Division (hard version) brute force math sortings *1600	0 / 0	(无)
	1814	P1213E Two Small Strings brute force constructive algorithms *1900	0 / 0	(无)
	1811	P1214A Optimal Currency Exchange brute force math *1400	0 / 0	(无)
	1810	P1214B Badges brute force math *1100	0 / 0	(无)
	1793	P1216E1 Numerical Sequence (easy version) binary search brute force math *1900	0 / 0	(无)
	1788	P1217C The Number Of Good Substrings binary search bitmasks brute force *1700	0 / 0	(无)
	1766	P1221A 2048 Game brute force greedy math *1000	0 / 0	(无)
	1760	P1221G Graph And Numbers bitmasks brute force combinatorics dp meet-in-the-middle *2900	0 / 0	(无)
	1749	P1225C p-binary bitmasks brute force math *1600	0 / 0	(无)
	1735	P1228A Distinct Digits brute force implementation *800	0 / 0	(无)
	1732	P1228D Complete Tripartite brute force constructive algorithms graphs hashing implementation *1900	0 / 0	(无)

HGNU

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

状态

支持

开发与维护

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

特别鸣谢

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

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