题库 - 达芬奇编程

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	2404	P1540E Tasty Dishes math matrices *3500	0 / 0	10
	2403	P1541A Pretty Permutations constructive algorithms greedy implementation *800	0 / 0	3
	2402	P1541B Pleasant Pairs brute force implementation math number theory *1200	0 / 0	4
	2401	P1542A Odd Set math *800	0 / 0	3
	2400	P1542B Plus and Multiply constructive algorithms math number theory *1500	0 / 0	5
	2399	P1542C Strange Function math number theory *1600	0 / 0	5
	2398	P1542D Priority Queue combinatorics dp implementation math ternary search *2200	0 / 0	8
	2397	P1542E1 Abnormal Permutation Pairs (easy version) combinatorics dp fft math *2400	0 / 0	9
	2396	P1542E2 Abnormal Permutation Pairs (hard version) combinatorics dp fft math *2700	0 / 0	10
	2395	P1543A Exciting Bets greedy math number theory *900	0 / 0	3
	2394	P1543B Customising the Track combinatorics greedy math *900	0 / 0	3
	2393	P1543C Need for Pink Slips bitmasks brute force dfs and similar implementation math probabilities *1900	0 / 0	6
	2392	P1543D1 RPD and Rap Sheet (Easy Version) bitmasks constructive algorithms interactive math *1700	0 / 0	5
	2391	P1543D2 RPD and Rap Sheet (Hard Version) brute force constructive algorithms interactive math *2200	0 / 0	8
	2390	P1543E The Final Pursuit bitmasks constructive algorithms divide and conquer graphs greedy math *2700	0 / 0	10
	2389	P1545A AquaMoon and Strange Sort sortings *1500	0 / 0	5
	2388	P1545B AquaMoon and Chess combinatorics math *1900	0 / 0	6
	2387	P1545C AquaMoon and Permutations 2-sat brute force combinatorics constructive algorithms graph matchings graphs *2800	0 / 0	10
	2386	P1545D AquaMoon and Wrong Coordinate constructive algorithms interactive math *3000	0 / 0	10
	2385	P1545E1 AquaMoon and Time Stop (easy version) data structures dp *3500	0 / 0	10
	2384	P1545E2 AquaMoon and Time Stop (hard version) data structures dp *3500	0 / 0	10
	2383	P1545F AquaMoon and Potatoes brute force data structures dp *3500	0 / 0	10
	2382	P1546A AquaMoon and Two Arrays brute force greedy *800	0 / 0	3
	2381	P1546B AquaMoon and Stolen String interactive math *1200	0 / 0	4
	2380	P1547A Shortest Path with Obstacle implementation math *800	0 / 0	3
	2379	P1547B Alphabetical Strings greedy implementation strings *800	0 / 0	3
	2378	P1547C Pair Programming greedy two pointers *1100	0 / 0	3
	2377	P1547D Co-growing Sequence bitmasks constructive algorithms greedy *1300	0 / 0	4
	2376	P1547E Air Conditioners data structures dp implementation shortest paths sortings two pointers *1500	0 / 0	5
	2375	P1547F Array Stabilization (GCD version) binary search brute force data structures divide and conquer number theory two pointers *1900	0 / 0	6
	2374	P1547G How Many Paths? dfs and similar dp graphs trees *2100	0 / 0	7
	2373	P1548A Web of Lies brute force graphs greedy *1400	0 / 0	4
	2372	P1548B Integers Have Friends binary search data structures divide and conquer math number theory two pointers *1800	0 / 0	6
	2371	P1548C The Three Little Pigs combinatorics dp fft math *2500	0 / 0	9
	2370	P1548D1 Gregor and the Odd Cows (Easy) bitmasks geometry math number theory *2300	0 / 0	8
	2369	P1548D2 Gregor and the Odd Cows (Hard) brute force geometry math number theory *3300	0 / 0	10
	2368	P1548E Gregor and the Two Painters data structures divide and conquer graphs greedy math *3400	0 / 0	10
	2367	P1549A Gregor and Cryptography math number theory *800	0 / 0	3
	2366	P1549B Gregor and the Pawn Game dfs and similar dp flows graph matchings graphs greedy implementation *800	0 / 0	3
	2365	P1550A Find The Array greedy math *800	0 / 0	3
	2364	P1550B Maximum Cost Deletion greedy math *1000	0 / 0	3
	2363	P1550C Manhattan Subarrays brute force geometry greedy implementation *1700	0 / 0	5
	2362	P1550D Excellent Arrays binary search combinatorics constructive algorithms implementation math sortings two pointers *2300	0 / 0	8
	2361	P1550E Stringforces binary search bitmasks brute force dp strings two pointers *2500	0 / 0	9
	2360	P1550F Jumping Around binary search data structures divide and conquer dp dsu graphs shortest paths *2700	0 / 0	10
	2359	P1551A Polycarp and Coins greedy math *800	0 / 0	3
	2358	P1551B1 Wonderful Coloring - 1 greedy strings *800	0 / 0	3
	2357	P1551B2 Wonderful Coloring - 2 binary search constructive algorithms data structures greedy *1400	0 / 0	4
	2356	P1551C Interesting Story greedy sortings strings *1500	0 / 0	5
	2355	P1551D1 Domino (easy version) constructive algorithms math *1700	0 / 0	5
	2354	P1551D2 Domino (hard version) constructive algorithms implementation math *2100	0 / 0	7
	2353	P1551E Fixed Points binary search brute force dp *2000	0 / 0	7
	2352	P1551F Equidistant Vertices brute force combinatorics dfs and similar dp trees *2200	0 / 0	8
	2351	P1552A Subsequence Permutation sortings strings *800	0 / 0	3
	2350	P1552B Running for Gold combinatorics graphs greedy sortings *1500	0 / 0	5
	2349	P1552C Maximize the Intersections combinatorics constructive algorithms geometry greedy sortings *1800	0 / 0	6
	2348	P1552D Array Differentiation bitmasks brute force constructive algorithms dfs and similar dp graphs math *1800	0 / 0	6
	2347	P1552E Colors and Intervals constructive algorithms data structures greedy sortings *2300	0 / 0	8
	2346	P1552F Telepanting binary search data structures dp sortings *2200	0 / 0	8
	2345	P1552G A Serious Referee bitmasks brute force dfs and similar sortings *3000	0 / 0	10
	2344	P1552H Guess the Perimeter binary search interactive number theory *3300	0 / 0	10
	2343	P1552I Organizing a Music Festival dfs and similar math *3400	0 / 0	10
	2342	P1553A Digits Sum math number theory *800	0 / 0	3
	2341	P1553B Reverse String brute force dp hashing implementation strings *1300	0 / 0	4
	2340	P1553C Penalty bitmasks brute force dp greedy *1200	0 / 0	4
	2339	P1553D Backspace dp greedy strings two pointers *1500	0 / 0	5
	2338	P1553E Permutation Shift brute force combinatorics constructive algorithms dfs and similar dsu graphs math *2100	0 / 0	7
	2337	P1553F Pairwise Modulo data structures math *2300	0 / 0	8
	2336	P1553G Common Divisor Graph brute force constructive algorithms dsu graphs hashing math number theory *2700	0 / 0	10
	2335	P1553H XOR and Distance bitmasks divide and conquer trees *2900	0 / 0	10
	2334	P1553I Stairs combinatorics divide and conquer dp fft math *3400	0 / 0	10
	2333	P1554A Cherry greedy *800	0 / 0	3
	2332	P1554B Cobb bitmasks brute force greedy math *1700	0 / 0	5
	2331	P1554C Mikasa binary search bitmasks greedy implementation *1800	0 / 0	6
	2330	P1554D Diane constructive algorithms greedy strings *1800	0 / 0	6
	2329	P1554E You dfs and similar dp math number theory *2600	0 / 0	10
	2328	P1555A PizzaForces brute force math *900	0 / 0	3
	2327	P1555B Two Tables brute force *1300	0 / 0	4
	2326	P1555C Coin Rows brute force constructive algorithms dp implementation *1300	0 / 0	4
	2325	P1555D Say No to Palindromes brute force constructive algorithms dp strings *1600	0 / 0	5
	2324	P1555E Boring Segments data structures sortings trees two pointers *2100	0 / 0	7
	2323	P1555F Good Graph data structures dsu graphs trees *2700	0 / 0	10
	2322	P1556A A Variety of Operations math *800	0 / 0	3
	2321	P1556B Take Your Places! implementation *1300	0 / 0	4
	2320	P1556C Compressed Bracket Sequence brute force implementation *1800	0 / 0	6
	2319	P1556D Take a Guess bitmasks constructive algorithms interactive math *1800	0 / 0	6
	2318	P1556E Equilibrium data structures dp greedy *2200	0 / 0	8
	2317	P1556F Sports Betting bitmasks combinatorics dp graphs math probabilities *2500	0 / 0	9
	2316	P1556G Gates to Another World bitmasks data structures dsu two pointers *3300	0 / 0	10
	2315	P1556H DIY Tree graphs greedy math probabilities *3300	0 / 0	10
	2314	P1557A Ezzat and Two Subsequences brute force math sortings *800	0 / 0	3
	2313	P1557B Moamen and k-subarrays greedy sortings *1100	0 / 0	3
	2312	P1557C Moamen and XOR bitmasks combinatorics dp math matrices *1700	0 / 0	5
	2311	P1557D Ezzat and Grid data structures dp greedy *2200	0 / 0	8
	2310	P1557E Assiut Chess brute force constructive algorithms interactive *2800	0 / 0	10
	2309	P1558A Charmed by the Game brute force math *1300	0 / 0	4
	2308	P1558B Up the Strip brute force dp math number theory two pointers *1900	0 / 0	6
	2307	P1558C Bottom-Tier Reversals constructive algorithms greedy *2000	0 / 0	7
	2306	P1558D Top-Notch Insertions combinatorics data structures *2600	0 / 0	10
	2305	P1558E Down Below binary search dfs and similar graphs greedy meet-in-the-middle shortest paths *3000	0 / 0	10

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