	ID	题目显示标签隐藏标签	AC / 尝试	难度
	994	P1374A Required Remainder math *800	0 / 0	(无)
	993	P1374B Multiply by 2, divide by 6 math *900	0 / 0	(无)
	992	P1374C Move Brackets greedy strings *1000	0 / 0	(无)
	991	P1374D Zero Remainder Array math sortings two pointers *1400	0 / 0	(无)
	990	P1374E1 Reading Books (easy version) data structures greedy sortings *1600	0 / 0	(无)
	989	P1374E2 Reading Books (hard version) data structures greedy implementation sortings ternary search two pointers *2500	0 / 0	(无)
	988	P1374F Cyclic Shifts Sorting brute force constructive algorithms implementation sortings *2400	0 / 0	(无)
	987	P1375A Sign Flipping constructive algorithms math *1100	0 / 0	(无)
	986	P1375B Neighbor Grid constructive algorithms greedy *1200	0 / 0	(无)
	985	P1375C Element Extermination constructive algorithms data structures greedy *1400	0 / 0	(无)
	984	P1375D Replace by MEX brute force constructive algorithms sortings *1900	0 / 0	(无)
	983	P1375E Inversion SwapSort constructive algorithms greedy sortings *2500	0 / 0	(无)
	982	P1375F Integer Game constructive algorithms games interactive math *2600	0 / 0	(无)
	981	P1375G Tree Modification brute force constructive algorithms dfs and similar graph matchings graphs trees *2800	0 / 0	(无)
	980	P1375H Set Merging constructive algorithms divide and conquer *3300	0 / 0	(无)
	979	P1375I Cubic Lattice geometry math matrices number theory *3500	0 / 0	(无)
	978	P1379A Acacius and String brute force implementation strings *1500	0 / 0	(无)
	977	P1379B Dubious Cyrpto binary search brute force math number theory *1500	0 / 0	(无)
	976	P1379C Choosing flowers binary search brute force data structures dfs and similar dp greedy sortings two pointers *2000	0 / 0	(无)
	975	P1379D New Passenger Trams binary search brute force data structures sortings two pointers *2300	0 / 0	(无)
	974	P1379E Inverse Genealogy constructive algorithms divide and conquer dp math trees *2800	0 / 0	(无)
	973	P1379F1 Chess Strikes Back (easy version) binary search data structures *2700	0 / 0	(无)
	972	P1379F2 Chess Strikes Back (hard version) data structures divide and conquer *2800	0 / 0	(无)
	971	P1380A Three Indices brute force data structures *900	0 / 0	(无)
	970	P1380B Universal Solution greedy *1400	0 / 0	(无)
	969	P1380C Create The Teams brute force dp greedy implementation sortings *1400	0 / 0	(无)
	968	P1380D Berserk And Fireball constructive algorithms greedy implementation math two pointers *2000	0 / 0	(无)
	967	P1380E Merging Towers data structures dsu implementation trees *2300	0 / 0	(无)
	966	P1380F Strange Addition data structures dp matrices *2600	0 / 0	(无)
	965	P1380G Circular Dungeon greedy math probabilities *2600	0 / 0	(无)
	964	P1381A1 Prefix Flip (Easy Version) constructive algorithms data structures strings *1300	0 / 0	(无)
	963	P1381A2 Prefix Flip (Hard Version) constructive algorithms data structures implementation strings two pointers *1700	0 / 0	(无)
	962	P1381B Unmerge dp *1800	0 / 0	(无)
	961	P1381C Mastermind constructive algorithms graph matchings greedy implementation sortings two pointers *2500	0 / 0	(无)
	960	P1381D The Majestic Brown Tree Snake dfs and similar dp greedy trees two pointers *3000	0 / 0	(无)
	959	P1381E Origami geometry math sortings *3300	0 / 0	(无)
	958	P1382A Common Subsequence brute force *800	0 / 0	(无)
	957	P1382B Sequential Nim dp games *1100	0 / 0	(无)
	956	P1383A String Transformation 1 dsu graphs greedy sortings strings trees two pointers *1700	0 / 0	(无)
	955	P1383B GameGame bitmasks constructive algorithms dp games greedy math *1900	0 / 0	(无)
	954	P1383C String Transformation 2 bitmasks dp graphs trees *3100	0 / 0	(无)
	953	P1383D Rearrange brute force constructive algorithms graphs greedy sortings *2800	0 / 0	(无)
	952	P1383E Strange Operation combinatorics data structures dp *2800	0 / 0	(无)
	951	P1383F Special Edges flows graphs *3200	0 / 0	(无)
	950	P1384A Common Prefixes constructive algorithms greedy strings *1200	0 / 0	(无)
	949	P1384B1 Koa and the Beach (Easy Version) brute force dp greedy *1900	0 / 0	(无)
	948	P1384B2 Koa and the Beach (Hard Version) constructive algorithms dp greedy implementation *2200	0 / 0	(无)
	947	P1385A Three Pairwise Maximums math *800	0 / 0	(无)
	946	P1385B Restore the Permutation by Merger greedy *800	0 / 0	(无)
	945	P1385C Make It Good greedy *1200	0 / 0	(无)
	944	P1385D a-Good String bitmasks brute force divide and conquer dp implementation *1500	0 / 0	(无)
	943	P1385E Directing Edges constructive algorithms dfs and similar graphs *2000	0 / 0	(无)
	942	P1385F Removing Leaves data structures greedy implementation trees *2300	0 / 0	(无)
	941	P1385G Columns Swaps 2-sat dfs and similar dsu graphs implementation *2300	0 / 0	(无)
	940	P1386A Colors special problem binary search constructive algorithms interactive 2700	0 / 0	(无)
	939	P1386B Mixture special problem data structures geometry math sortings 2900	0 / 0	(无)
	938	P1386C Joker special problem bitmasks data structures divide and conquer dsu 2800	0 / 0	(无)
	937	P1387A Graph special problem binary search dfs and similar dp math ternary search 2100	0 / 0	(无)
	936	P1387B1 Village (Minimum) special problem dp greedy trees 2100	0 / 0	(无)
	935	P1387B2 Village (Maximum) special problem dfs and similar trees 2500	0 / 0	(无)
	934	P1387C Viruses special problem dp shortest paths string suffix structures 2900	0 / 0	(无)
	933	P1388A Captain Flint and Crew Recruitment brute force greedy math number theory *800	0 / 0	(无)
	932	P1388B Captain Flint and a Long Voyage greedy math *1000	0 / 0	(无)
	931	P1388C Uncle Bogdan and Country Happiness dfs and similar greedy math trees *1800	0 / 0	(无)
	930	P1388D Captain Flint and Treasure data structures dfs and similar graphs greedy implementation trees *2000	0 / 0	(无)
	929	P1388E Uncle Bogdan and Projections data structures geometry sortings *2700	0 / 0	(无)
	928	P1389A LCM Problem constructive algorithms greedy math number theory *800	0 / 0	(无)
	927	P1389B Array Walk brute force dp greedy *1600	0 / 0	(无)
	926	P1389C Good String brute force dp greedy two pointers *1500	0 / 0	(无)
	925	P1389D Segment Intersections brute force greedy implementation math *2100	0 / 0	(无)
	924	P1389E Calendar Ambiguity math number theory *2200	0 / 0	(无)
	923	P1389F Bicolored Segments data structures dp graph matchings sortings *2600	0 / 0	(无)
	922	P1389G Directing Edges dfs and similar dp graphs trees *2800	0 / 0	(无)
	921	P1391A Suborrays constructive algorithms math *800	0 / 0	(无)
	920	P1391B Fix You brute force greedy implementation *800	0 / 0	(无)
	919	P1391C Cyclic Permutations combinatorics dp graphs math *1500	0 / 0	(无)
	918	P1391D 505 bitmasks brute force constructive algorithms dp greedy implementation *2000	0 / 0	(无)
	917	P1391E Pairs of Pairs constructive algorithms dfs and similar graphs greedy trees *2600	0 / 0	(无)
	916	P1392A Omkar and Password greedy math *800	0 / 0	(无)
	915	P1392B Omkar and Infinity Clock implementation math *800	0 / 0	(无)
	914	P1392C Omkar and Waterslide greedy implementation *1200	0 / 0	(无)
	913	P1392D Omkar and Bed Wars dp greedy *1700	0 / 0	(无)
	912	P1392E Omkar and Duck bitmasks constructive algorithms interactive math *2100	0 / 0	(无)
	911	P1392F Omkar and Landslide binary search constructive algorithms data structures greedy math *2400	0 / 0	(无)
	910	P1392G Omkar and Pies bitmasks dfs and similar dp math shortest paths *2900	0 / 0	(无)
	909	P1392H ZS Shuffles Cards combinatorics dp math probabilities *3000	0 / 0	(无)
	908	P1392I Kevin and Grid fft graphs math *3300	0 / 0	(无)
	907	P1393A Rainbow Dash, Fluttershy and Chess Coloring greedy math *800	0 / 0	(无)
	906	P1393B Applejack and Storages constructive algorithms data structures greedy implementation *1400	0 / 0	(无)
	905	P1393C Pinkie Pie Eats Patty-cakes constructive algorithms greedy math sortings *1700	0 / 0	(无)
	904	P1393D Rarity and New Dress dfs and similar dp implementation shortest paths *2100	0 / 0	(无)
	903	P1393E1 Twilight and Ancient Scroll (easier version) dp hashing implementation string suffix structures strings *2800	0 / 0	(无)
	902	P1393E2 Twilight and Ancient Scroll (harder version) dp hashing implementation string suffix structures strings two pointers *3200	0 / 0	(无)
	901	P1394A Boboniu Chats with Du dp greedy sortings two pointers *1800	0 / 0	(无)
	900	P1394B Boboniu Walks on Graph brute force dfs and similar graphs hashing *2300	0 / 0	(无)
	899	P1394C Boboniu and String binary search geometry ternary search *2600	0 / 0	(无)
	898	P1394D Boboniu and Jianghu dp greedy sortings trees *2800	0 / 0	(无)
	897	P1394E Boboniu and Banknote Collection strings *3500	0 / 0	(无)
	896	P1395A Boboniu Likes to Color Balls brute force math *1000	0 / 0	(无)
	895	P1395B Boboniu Plays Chess constructive algorithms *1100	0 / 0	(无)

HGNU

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

状态

支持

开发与维护

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

特别鸣谢

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

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