binary search - 题库 - 达芬奇编程

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	2940	P1437E Make It Increasing binary search constructive algorithms data structures dp implementation *2200	0 / 0	8
	2933	P1438E Yurii Can Do Everything binary search bitmasks brute force constructive algorithms divide and conquer two pointers *2500	0 / 0	9
	2928	P1439C Greedy Shopping binary search data structures divide and conquer greedy implementation *2600	0 / 0	10
	2919	P1442E Black, White and Grey Tree binary search constructive algorithms dfs and similar dp greedy trees *3000	0 / 0	10
	2915	P1443C The Delivery Dilemma binary search greedy sortings *1400	0 / 0	4
	2904	P1446C Xor Tree binary search bitmasks data structures divide and conquer dp trees *2100	0 / 0	7
	2900	P1446F Line Distance binary search data structures geometry *3200	0 / 0	10
	2893	P1450D Rating Compression binary search data structures greedy implementation two pointers *1800	0 / 0	6
	2879	P1452B Toy Blocks binary search greedy math sortings *1400	0 / 0	4
	2869	P1453E Dog Snacks binary search dfs and similar dp greedy trees *2300	0 / 0	8
	2862	P1454F Array Partition binary search data structures greedy two pointers *2100	0 / 0	7
	2842	P1461D Divide and Summarize binary search brute force data structures divide and conquer implementation sortings *1600	0 / 0	5
	2835	P1462E1 Close Tuples (easy version) binary search combinatorics math sortings two pointers *1500	0 / 0	5
	2834	P1462E2 Close Tuples (hard version) binary search combinatorics implementation math sortings two pointers *1700	0 / 0	5
	2833	P1462F The Treasure of The Segments binary search data structures greedy *1800	0 / 0	6
	2832	P1463A Dungeon binary search math *1100	0 / 0	3
	2829	P1463D Pairs binary search constructive algorithms greedy two pointers *1900	0 / 0	6
	2817	P1466I The Riddle of the Sphinx binary search data structures data structures interactive *3400	0 / 0	10
	2808	P1468D Firecrackers binary search sortings *1700	0 / 0	5
	2805	P1468G Hobbits binary search geometry *2500	0 / 0	9
	2800	P1468L Prime Divisors Selection binary search greedy math number theory *2700	0 / 0	10
	2792	P1469F Power Sockets binary search data structures greedy *2600	0 / 0	10
	2791	P1470A Strange Birthday Party binary search dp greedy sortings two pointers *1300	0 / 0	4
	2789	P1470C Strange Shuffle binary search brute force constructive algorithms interactive *2500	0 / 0	9
	2787	P1470E Strange Permutation binary search combinatorics data structures dp graphs implementation two pointers *3200	0 / 0	10
	2779	P1472E Correct Placement binary search data structures dp sortings two pointers *1700	0 / 0	5
	2768	P1474B Different Divisors binary search constructive algorithms greedy math number theory *1000	0 / 0	3
	2760	P1475D Cleaning the Phone binary search dp sortings two pointers *1800	0 / 0	6
	2756	P1476A K-divisible Sum binary search constructive algorithms greedy math *1000	0 / 0	3
	2755	P1476B Inflation binary search brute force greedy math *1300	0 / 0	4
	2751	P1476F Lanterns binary search data structures dp *3000	0 / 0	10
	2740	P1479A Searching Local Minimum binary search interactive ternary search *1700	0 / 0	5
	2736	P1479D Odd Mineral Resource binary search bitmasks brute force data structures probabilities trees *2900	0 / 0	10
	2720	P1482G Vabank binary search interactive *3200	0 / 0	10
	2716	P1485C Floor and Mod binary search brute force math number theory *1700	0 / 0	5
	2711	P1486B Eastern Exhibition binary search geometry shortest paths sortings *1500	0 / 0	5
	2710	P1486C1 Guessing the Greatest (easy version) binary search interactive *1600	0 / 0	5
	2709	P1486C2 Guessing the Greatest (hard version) binary search interactive *1900	0 / 0	6
	2708	P1486D Max Median binary search data structures dp *2100	0 / 0	7
	2707	P1486E Paired Payment binary search brute force constructive algorithms dp flows graphs shortest paths *2200	0 / 0	8
	2702	P1487D Pythagorean Triples binary search brute force math number theory *1500	0 / 0	5
	2696	P1488C Two Policemen special problem binary search brute force math 1900	0 / 0	6
	2695	P1488D Problemsolving Marathon special problem binary search greedy 1900	0 / 0	6
	2693	P1488F Dogecoin special problem special problem binary search data structures *2300	0 / 0	8
	2686	P1490C Sum of Cubes binary search brute force brute force math *1100	0 / 0	3
	2684	P1490E Accidental Victory binary search data structures greedy *1400	0 / 0	4
	2683	P1490F Equalize the Array binary search data structures greedy math sortings *1500	0 / 0	5
	2682	P1490G Old Floppy Drive binary search data structures math *1900	0 / 0	6
	2676	P1491F Magnets binary search constructive algorithms interactive *2700	0 / 0	10
	2670	P1492C Maximum width binary search data structures dp greedy two pointers *1500	0 / 0	5
	2665	P1493C K-beautiful Strings binary search brute force constructive algorithms greedy strings *2000	0 / 0	7
	2659	P1494C 1D Sokoban binary search dp greedy implementation two pointers *1900	0 / 0	6
	2639	P1498B Box Fitting binary search bitmasks data structures greedy *1300	0 / 0	4
	2626	P1500B Two chandeliers binary search brute force chinese remainder theorem math number theory *2200	0 / 0	8
	2623	P1500E Subset Trick binary search data structures *3300	0 / 0	10
	2617	P1503C Travelling Salesman Problem binary search data structures dp greedy shortest paths sortings two pointers *2200	0 / 0	8
	2594	P1508B Almost Sorted binary search combinatorics constructive algorithms implementation *1800	0 / 0	6
	2552	P1514D Cut and Stick binary search data structures greedy implementation sortings *2000	0 / 0	7
	2551	P1514E Baby Ehab's Hyper Apartment binary search graphs interactive sortings two pointers *2700	0 / 0	10
	2542	P1515I Phoenix and Diamonds binary search data structures sortings *3400	0 / 0	10
	2538	P1516D Cut binary search data structures dp graphs number theory two pointers *2100	0 / 0	7
	2532	P1517E Group Photo binary search data structures implementation two pointers *2500	0 / 0	9
	2517	P1520F1 Guess the K-th Zero (Easy version) binary search interactive *1600	0 / 0	5
	2516	P1520F2 Guess the K-th Zero (Hard version) binary search constructive algorithms data structures interactive *2200	0 / 0	8
	2510	P1521E Nastia and a Beautiful Matrix binary search constructive algorithms dp greedy *2700	0 / 0	10
	2483	P1527E Partition Game binary search data structures divide and conquer dp *2500	0 / 0	9
	2472	P1530C Pursuit binary search brute force greedy sortings *1200	0 / 0	4
	2456	P1533E Chess Team Forming *special problem binary search data structures greedy	0 / 0	(无)
	2455	P1533F Binary String Partition *special problem binary search greedy	0 / 0	(无)
	2439	P1535C Unstable String binary search dp greedy implementation strings two pointers *1400	0 / 0	4
	2437	P1535E Gold Transfer binary search data structures dp greedy interactive trees *2200	0 / 0	8
	2436	P1535F String Distance binary search brute force data structures hashing implementation strings *3000	0 / 0	10
	2425	P1537E1 Erase and Extend (Easy Version) binary search brute force dp greedy hashing implementation string suffix structures strings two pointers *1600	0 / 0	5
	2424	P1537E2 Erase and Extend (Hard Version) binary search data structures greedy hashing string suffix structures strings two pointers *2200	0 / 0	8
	2420	P1538C Number of Pairs binary search data structures math two pointers *1300	0 / 0	4
	2417	P1538F Interesting Function binary search dp math number theory *1500	0 / 0	5
	2416	P1538G Gift Set binary search greedy math ternary search *2100	0 / 0	7
	2412	P1539D PriceFixed binary search greedy implementation sortings two pointers *1600	0 / 0	5
	2411	P1539E Game with Cards binary search constructive algorithms data structures dp greedy implementation *2500	0 / 0	9
	2405	P1540D Inverse Inversions binary search brute force data structures *3200	0 / 0	10
	2375	P1547F Array Stabilization (GCD version) binary search brute force data structures divide and conquer number theory two pointers *1900	0 / 0	6
	2372	P1548B Integers Have Friends binary search data structures divide and conquer math number theory two pointers *1800	0 / 0	6
	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
	2357	P1551B2 Wonderful Coloring - 2 binary search constructive algorithms data structures greedy *1400	0 / 0	4
	2353	P1551E Fixed Points binary search brute force dp *2000	0 / 0	7
	2346	P1552F Telepanting binary search data structures dp sortings *2200	0 / 0	8
	2344	P1552H Guess the Perimeter binary search interactive number theory *3300	0 / 0	10
	2331	P1554C Mikasa binary search bitmasks greedy implementation *1800	0 / 0	6
	2305	P1558E Down Below binary search dfs and similar graphs greedy meet-in-the-middle shortest paths *3000	0 / 0	10
	2293	P1560E Polycarp and String Transformation binary search implementation sortings strings *1800	0 / 0	6
	2292	P1560F1 Nearest Beautiful Number (easy version) binary search bitmasks brute force constructive algorithms dfs and similar greedy *1900	0 / 0	6
	2289	P1561C Deep Down Below binary search greedy sortings *1300	0 / 0	4
	2280	P1566A Median Maximization binary search greedy math *800	0 / 0	3
	2262	P1569D Inconvenient Pairs binary search data structures implementation sortings two pointers *1900	0 / 0	6
	2251	P1571I Physical Examination special problem binary search data structures 3200	0 / 0	10
	2249	P1572A Book binary search brute force data structures dp graphs implementation sortings *1800	0 / 0	6
	2245	P1572E Polygon binary search dp geometry *3000	0 / 0	10
	2239	P1574C Slay the Dragon binary search greedy sortings ternary search *1300	0 / 0	4

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