	ID	题目显示标签隐藏标签	AC / 尝试	难度
	1094	P1358D The Best Vacation binary search brute force greedy implementation two pointers *1900	0 / 0	(无)
	1093	P1358E Are You Fired? constructive algorithms data structures greedy implementation *2400	0 / 0	(无)
	1092	P1358F Tasty Cookie binary search constructive algorithms greedy implementation *2700	0 / 0	(无)
	1091	P1359A Berland Poker brute force greedy math *1000	0 / 0	(无)
	1090	P1359B New Theatre Square brute force dp greedy implementation two pointers *1000	0 / 0	(无)
	1089	P1359C Mixing Water binary search math *1700	0 / 0	(无)
	1088	P1359D Yet Another Yet Another Task data structures dp implementation two pointers *2000	0 / 0	(无)
	1087	P1359E Modular Stability combinatorics math number theory *2000	0 / 0	(无)
	1086	P1359F RC Kaboom Show binary search brute force data structures geometry math *2900	0 / 0	(无)
	1085	P1360A Minimal Square greedy math *800	0 / 0	(无)
	1084	P1360B Honest Coach greedy sortings *800	0 / 0	(无)
	1083	P1360C Similar Pairs constructive algorithms graph matchings greedy sortings *1100	0 / 0	(无)
	1082	P1360D Buying Shovels math number theory *1300	0 / 0	(无)
	1081	P1360E Polygon dp graphs implementation shortest paths *1300	0 / 0	(无)
	1080	P1360F Spy-string bitmasks brute force constructive algorithms dp hashing strings *1700	0 / 0	(无)
	1079	P1360G A/B Matrix constructive algorithms greedy math *1900	0 / 0	(无)
	1078	P1360H Binary Median binary search bitmasks brute force constructive algorithms *2100	0 / 0	(无)
	1077	P1361A Johnny and Contribution constructive algorithms graphs greedy sortings *1700	0 / 0	(无)
	1076	P1361B Johnny and Grandmaster greedy implementation math sortings *1900	0 / 0	(无)
	1075	P1361C Johnny and Megan's Necklace binary search bitmasks constructive algorithms dfs and similar dsu graphs *2500	0 / 0	(无)
	1074	P1361D Johnny and James greedy implementation math trees *2900	0 / 0	(无)
	1073	P1361E James and the Chase dfs and similar graphs probabilities trees *3000	0 / 0	(无)
	1072	P1361F Johnny and New Toy data structures implementation math *3300	0 / 0	(无)
	1071	P1362A Johnny and Ancient Computer implementation *1000	0 / 0	(无)
	1070	P1362B Johnny and His Hobbies bitmasks brute force *1200	0 / 0	(无)
	1069	P1362C Johnny and Another Rating Drop bitmasks greedy math *1400	0 / 0	(无)
	1068	P1363A Odd Selection brute force implementation math *1200	0 / 0	(无)
	1067	P1363B Subsequence Hate implementation strings *1400	0 / 0	(无)
	1066	P1363C Game On Leaves games trees *1600	0 / 0	(无)
	1065	P1363D Guess The Maximums binary search implementation interactive math *2100	0 / 0	(无)
	1064	P1363E Tree Shuffling dfs and similar dp greedy trees *2000	0 / 0	(无)
	1063	P1363F Rotating Substrings dp strings *2600	0 / 0	(无)
	1062	P1364A XXXXX brute force data structures number theory two pointers *1200	0 / 0	(无)
	1061	P1364B Most socially-distanced subsequence greedy two pointers *1300	0 / 0	(无)
	1060	P1364C Ehab and Prefix MEXs brute force constructive algorithms greedy *1600	0 / 0	(无)
	1059	P1364D Ehab's Last Corollary constructive algorithms dfs and similar graphs greedy implementation trees *2100	0 / 0	(无)
	1058	P1364E X-OR bitmasks constructive algorithms divide and conquer interactive probabilities *2700	0 / 0	(无)
	1057	P1365A Matrix Game games greedy implementation *1100	0 / 0	(无)
	1056	P1365B Trouble Sort constructive algorithms implementation *1300	0 / 0	(无)
	1055	P1365C Rotation Matching constructive algorithms data structures greedy implementation *1400	0 / 0	(无)
	1054	P1365D Solve The Maze constructive algorithms dfs and similar dsu graphs greedy implementation shortest paths *1700	0 / 0	(无)
	1053	P1365E Maximum Subsequence Value brute force constructive algorithms *1900	0 / 0	(无)
	1052	P1365F Swaps Again constructive algorithms implementation sortings *2100	0 / 0	(无)
	1051	P1365G Secure Password bitmasks combinatorics constructive algorithms interactive math *2800	0 / 0	(无)
	1050	P1366A Shovels and Swords binary search greedy math *1100	0 / 0	(无)
	1049	P1366B Shuffle math two pointers *1300	0 / 0	(无)
	1048	P1366C Palindromic Paths greedy math *1500	0 / 0	(无)
	1047	P1366D Two Divisors constructive algorithms math number theory *2000	0 / 0	(无)
	1046	P1366E Two Arrays binary search brute force combinatorics constructive algorithms dp two pointers *2100	0 / 0	(无)
	1045	P1366F Jog Around The Graph binary search dp geometry graphs *2700	0 / 0	(无)
	1044	P1366G Construct the String data structures dp strings *2700	0 / 0	(无)
	1043	P1367A Short Substrings implementation strings *800	0 / 0	(无)
	1042	P1367B Even Array greedy math *800	0 / 0	(无)
	1041	P1367C Social Distance constructive algorithms greedy math *1300	0 / 0	(无)
	1040	P1367D Task On The Board constructive algorithms greedy implementation sortings *1800	0 / 0	(无)
	1039	P1367E Necklace Assembly brute force dfs and similar dp graphs greedy number theory *1900	0 / 0	(无)
	1038	P1367F1 Flying Sort (Easy Version) dp greedy two pointers *2100	0 / 0	(无)
	1037	P1367F2 Flying Sort (Hard Version) binary search data structures dp greedy sortings two pointers *2400	0 / 0	(无)
	1036	P1368A C+= brute force greedy implementation math *800	0 / 0	(无)
	1035	P1368B Codeforces Subsequences brute force constructive algorithms greedy math strings *1500	0 / 0	(无)
	1034	P1368C Even Picture constructive algorithms *1500	0 / 0	(无)
	1033	P1368D AND, OR and square sum bitmasks greedy math *1700	0 / 0	(无)
	1032	P1368E Ski Accidents constructive algorithms graphs greedy *2500	0 / 0	(无)
	1031	P1368F Lamps on a Circle games implementation interactive math *2600	0 / 0	(无)
	1030	P1368G Shifting Dominoes data structures geometry graphs trees *3200	0 / 0	(无)
	1029	P1368H1 Breadboard Capacity (easy version) dp flows greedy *3300	0 / 0	(无)
	1028	P1368H2 Breadboard Capacity (hard version) *3500	0 / 0	(无)
	1027	P1369A FashionabLee geometry math *800	0 / 0	(无)
	1026	P1369B AccurateLee greedy implementation strings *1200	0 / 0	(无)
	1025	P1369C RationalLee greedy math sortings two pointers *1400	0 / 0	(无)
	1024	P1369D TediousLee dp graphs greedy math trees *1900	0 / 0	(无)
	1023	P1369E DeadLee data structures dfs and similar greedy implementation sortings *2400	0 / 0	(无)
	1022	P1369F BareLee dfs and similar dp games *2700	0 / 0	(无)
	1021	P1370A Maximum GCD greedy implementation math number theory *800	0 / 0	(无)
	1020	P1370B GCD Compression constructive algorithms math number theory *1100	0 / 0	(无)
	1019	P1370C Number Game games math number theory *1400	0 / 0	(无)
	1018	P1370D Odd-Even Subsequence binary search dp dsu greedy implementation *2000	0 / 0	(无)
	1017	P1370E Binary Subsequence Rotation binary search constructive algorithms data structures greedy *2100	0 / 0	(无)
	1016	P1370F1 The Hidden Pair (Easy Version) binary search dfs and similar graphs interactive shortest paths trees *2400	0 / 0	(无)
	1015	P1370F2 The Hidden Pair (Hard Version) binary search dfs and similar graphs interactive shortest paths trees *2700	0 / 0	(无)
	1014	P1371A Magical Sticks math *800	0 / 0	(无)
	1013	P1371B Magical Calendar math *1200	0 / 0	(无)
	1012	P1371C A Cookie for You greedy implementation math *1300	0 / 0	(无)
	1011	P1371D Grid-00100 constructive algorithms greedy implementation *1600	0 / 0	(无)
	1010	P1371E1 Asterism (Easy Version) binary search brute force combinatorics math number theory sortings *1900	0 / 0	(无)
	1009	P1371E2 Asterism (Hard Version) binary search combinatorics dp math number theory sortings *2300	0 / 0	(无)
	1008	P1371F Raging Thunder data structures divide and conquer implementation *2800	0 / 0	(无)
	1007	P1372A Omkar and Completion constructive algorithms implementation *800	0 / 0	(无)
	1006	P1372B Omkar and Last Class of Math greedy math number theory *1300	0 / 0	(无)
	1005	P1372C Omkar and Baseball constructive algorithms math *1500	0 / 0	(无)
	1004	P1372D Omkar and Circle brute force dp games greedy *2100	0 / 0	(无)
	1003	P1372E Omkar and Last Floor dp greedy two pointers *2900	0 / 0	(无)
	1002	P1372F Omkar and Modes binary search divide and conquer interactive *2700	0 / 0	(无)
	1001	P1373A Donut Shops greedy implementation math *1000	0 / 0	(无)
	1000	P1373B 01 Game games *900	0 / 0	(无)
	999	P1373C Pluses and Minuses math *1300	0 / 0	(无)
	998	P1373D Maximum Sum on Even Positions divide and conquer dp greedy implementation *1600	0 / 0	(无)
	997	P1373E Sum of Digits brute force constructive algorithms dp greedy *2200	0 / 0	(无)
	996	P1373F Network Coverage binary search constructive algorithms data structures greedy *2400	0 / 0	(无)
	995	P1373G Pawns data structures divide and conquer greedy *2600	0 / 0	(无)

HGNU

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

状态

支持

开发与维护

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

特别鸣谢

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

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