题库 - 达芬奇编程

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	1204	P1761C Set Construction constructive algorithms dfs and similar graphs greedy *1400	0 / 0	4
	1203	P1761D Carry Bit combinatorics math *2100	0 / 0	7
	1202	P1761E Make It Connected binary search brute force constructive algorithms dsu graphs greedy matrices trees two pointers *2400	0 / 0	9
	1201	P1761F1 Anti-median (Easy Version) dp math *3100	0 / 0	10
	1200	P1761F2 Anti-median (Hard Version) combinatorics dp math *3500	0 / 0	10
	1199	P1761G Centroid Guess interactive probabilities trees *3500	0 / 0	10
	1198	P1762A Divide and Conquer greedy math number theory *800	0 / 0	3
	1197	P1762B Make Array Good constructive algorithms implementation number theory sortings *1100	0 / 0	3
	1196	P1762C Binary Strings are Fun combinatorics math *1400	0 / 0	4
	1195	P1762D GCD Queries constructive algorithms interactive number theory *2100	0 / 0	7
	1194	P1762E Tree Sum combinatorics math trees *2600	0 / 0	10
	1193	P1762F Good Pairs binary search data structures dp *2600	0 / 0	10
	1192	P1762G Unequal Adjacent Elements constructive algorithms sortings *3100	0 / 0	10
	1191	P1763A Absolute Maximization bitmasks constructive algorithms greedy math *800	0 / 0	3
	1190	P1763B Incinerate binary search brute force data structures implementation math sortings *1200	0 / 0	4
	1189	P1763C Another Array Problem brute force constructive algorithms greedy *2000	0 / 0	7
	1188	P1763D Valid Bitonic Permutations combinatorics dp implementation math number theory *2200	0 / 0	8
	1187	P1763E Node Pairs dp graphs math number theory *2200	0 / 0	8
	1186	P1763F Edge Queries data structures dfs and similar dp dsu graphs trees *3000	0 / 0	10
	1185	P1764A Doremy's Paint greedy *800	0 / 0	3
	1184	P1764B Doremy's Perfect Math Class math number theory *900	0 / 0	3
	1183	P1764C Doremy's City Construction graphs greedy *1400	0 / 0	4
	1182	P1764D Doremy's Pegging Game combinatorics dp math *2000	0 / 0	7
	1181	P1764E Doremy's Number Line dp greedy sortings *2400	0 / 0	9
	1180	P1764F Doremy's Experimental Tree brute force constructive algorithms dfs and similar dsu sortings trees *2500	0 / 0	9
	1179	P1764G1 Doremy's Perfect DS Class (Easy Version) binary search interactive *2900	0 / 0	10
	1178	P1764G2 Doremy's Perfect DS Class (Medium Version) binary search interactive *3000	0 / 0	10
	1177	P1764G3 Doremy's Perfect DS Class (Hard Version) binary search interactive *3300	0 / 0	10
	1176	P1764H Doremy's Paint 2 data structures *3400	0 / 0	10
	1175	P1765A Access Levels bitmasks dsu flows graph matchings *2400	0 / 0	9
	1174	P1765B Broken Keyboard greedy *800	0 / 0	3
	1173	P1765C Card Guessing combinatorics dp probabilities *2600	0 / 0	10
	1172	P1765D Watch the Videos binary search constructive algorithms two pointers *1700	0 / 0	5
	1171	P1765E Exchange brute force math *1000	0 / 0	3
	1170	P1765F Chemistry Lab dp geometry probabilities *2200	0 / 0	8
	1169	P1765G Guess the String constructive algorithms interactive probabilities *2600	0 / 0	10
	1168	P1765H Hospital Queue binary search graphs greedy implementation *2200	0 / 0	8
	1167	P1765I Infinite Chess implementation shortest paths *2800	0 / 0	10
	1166	P1765J Hero to Zero graph matchings math *2900	0 / 0	10
	1165	P1765K Torus Path greedy math *1500	0 / 0	5
	1164	P1765L Project Manager brute force data structures implementation *2400	0 / 0	9
	1163	P1765M Minimum LCM math number theory *1000	0 / 0	3
	1162	P1765N Number Reduction greedy *1500	0 / 0	5
	1161	P1766A Extremely Round brute force implementation *800	0 / 0	3
	1160	P1766B Notepad# implementation *1000	0 / 0	3
	1159	P1766C Hamiltonian Wall dp implementation *1300	0 / 0	4
	1158	P1766D Lucky Chains math number theory *1600	0 / 0	5
	1157	P1766E Decomposition binary search brute force data structures divide and conquer dp two pointers *2300	0 / 0	8
	1156	P1766F MCF flows *2800	0 / 0	10
	1155	P1767A Cut the Triangle implementation *800	0 / 0	3
	1154	P1767B Block Towers data structures greedy sortings *800	0 / 0	3
	1153	P1767C Count Binary Strings data structures dp *2100	0 / 0	7
	1152	P1767D Playoff combinatorics constructive algorithms dp greedy math *1500	0 / 0	5
	1151	P1767E Algebra Flash bitmasks brute force dp graphs math meet-in-the-middle trees *2500	0 / 0	9
	1150	P1767F Two Subtrees data structures trees *3100	0 / 0	10
	1149	P1768A Greatest Convex greedy math number theory *800	0 / 0	3
	1148	P1768B Quick Sort greedy math *900	0 / 0	3
	1147	P1768C Elemental Decompress constructive algorithms greedy implementation sortings *1300	0 / 0	4
	1146	P1768D Lucky Permutation constructive algorithms dfs and similar graphs greedy *1800	0 / 0	6
	1145	P1768E Partial Sorting combinatorics math number theory *2300	0 / 0	8
	1144	P1768F Wonderful Jump dp greedy *2900	0 / 0	10
	1143	P1770A Koxia and Whiteboards brute force greedy *1000	0 / 0	3
	1142	P1770B Koxia and Permutation constructive algorithms *1000	0 / 0	3
	1141	P1770C Koxia and Number Theory brute force chinese remainder theorem math number theory *1700	0 / 0	5
	1140	P1770D Koxia and Game constructive algorithms data structures dfs and similar dsu flows games graph matchings graphs implementation *2000	0 / 0	7
	1139	P1770E Koxia and Tree combinatorics dfs and similar dp dsu math probabilities trees *2400	0 / 0	9
	1138	P1770F Koxia and Sequence bitmasks combinatorics dp math number theory *3100	0 / 0	10
	1137	P1770G Koxia and Bracket divide and conquer fft math *3400	0 / 0	10
	1136	P1770H Koxia, Mahiru and Winter Festival constructive algorithms *3500	0 / 0	10
	1135	P1771A Hossam and Combinatorics combinatorics math sortings *900	0 / 0	3
	1134	P1771B Hossam and Friends binary search constructive algorithms dp two pointers *1400	0 / 0	4
	1133	P1771C Hossam and Trainees greedy math number theory *1600	0 / 0	5
	1132	P1771D Hossam and (sub-)palindromic tree brute force data structures dfs and similar dp strings trees *2100	0 / 0	7
	1131	P1771E Hossam and a Letter brute force dp implementation two pointers *2500	0 / 0	9
	1130	P1771F Hossam and Range Minimum Query binary search bitmasks data structures hashing probabilities strings trees *2500	0 / 0	9
	1129	P1773A Amazing Trick constructive algorithms graph matchings math probabilities *1900	0 / 0	6
	1128	P1773B BinCoin binary search divide and conquer hashing implementation probabilities trees *2200	0 / 0	8
	1127	P1773C __NO_TITLE__	0 / 0	(无)
	1126	P1773D Dominoes combinatorics flows graph matchings greedy *2600	0 / 0	10
	1125	P1773E Easy Assembly greedy sortings *1400	0 / 0	4
	1124	P1773F Football constructive algorithms *800	0 / 0	3
	1123	P1773G Game of Questions bitmasks combinatorics dp fft math probabilities *2800	0 / 0	10
	1122	P1773H Hot and Cold binary search interactive *2600	0 / 0	10
	1121	P1773I Interactive Factorial Guessing brute force games implementation interactive *2500	0 / 0	9
	1120	P1773J Jumbled Trees constructive algorithms math *2900	0 / 0	10
	1119	P1773K __NO_TITLE__	0 / 0	(无)
	1118	P1773L Lisa's Sequences dp *3500	0 / 0	10
	1117	P1774A Add Plus Minus Sign constructive algorithms math *800	0 / 0	3
	1116	P1774B Coloring constructive algorithms greedy math *1500	0 / 0	5
	1115	P1774C Ice and Fire constructive algorithms dp greedy *1300	0 / 0	4
	1114	P1774D Same Count One brute force constructive algorithms greedy implementation two pointers *1600	0 / 0	5
	1113	P1774E Two Chess Pieces dfs and similar dp greedy trees *1900	0 / 0	6
	1112	P1774F1 Magician and Pigs (Easy Version) brute force data structures implementation *2400	0 / 0	9
	1111	P1774F2 Magician and Pigs (Hard Version) binary search brute force data structures implementation *2700	0 / 0	10
	1110	P1774G Segment Covering brute force combinatorics constructive algorithms data structures dp trees *3200	0 / 0	10
	1109	P1774H Maximum Permutation constructive algorithms *3500	0 / 0	10
	1108	P1775A1 Gardener and the Capybaras (easy version) brute force constructive algorithms implementation *800	0 / 0	3
	1107	P1775A2 Gardener and the Capybaras (hard version) constructive algorithms greedy *900	0 / 0	3
	1106	P1775B Gardener and the Array bitmasks constructive algorithms *1300	0 / 0	4
	1105	P1775C Interesting Sequence bitmasks math *1600	0 / 0	5

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