brute force - 题库 - 达芬奇编程

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	285	P1914G1 Light Bulbs (Easy Version) brute force combinatorics dfs and similar dp dsu graphs math trees *2100	0 / 0	7
	282	P1915B Not Quite Latin Square bitmasks brute force implementation *800	0 / 0	3
	273	P1916D Mathematical Problem brute force constructive algorithms geometry math *1700	0 / 0	5
	269	P1916H1 Matrix Rank (Easy Version) brute force combinatorics dp math matrices *2700	0 / 0	10
	266	P1917B Erase First or Second Letter brute force combinatorics data structures dp strings *1100	0 / 0	3
	265	P1917C Watering an Array brute force greedy implementation math *1600	0 / 0	5
	245	P1920A Satisfying Constraints brute force greedy math *800	0 / 0	3
	243	P1920C Partitioning the Array brute force math number theory *1600	0 / 0	5
	242	P1920D Array Repetition binary search brute force dsu implementation math *1900	0 / 0	6
	240	P1920F1 Smooth Sailing (Easy Version) binary search brute force data structures dfs and similar dsu graphs shortest paths *2500	0 / 0	9
	234	P1921E Eat the Chip brute force games greedy math *1600	0 / 0	5
	233	P1921F Sum of Progression brute force data structures dp implementation math *1900	0 / 0	6
	232	P1921G Mischievous Shooter brute force data structures divide and conquer dp implementation *2200	0 / 0	8
	228	P1922D Berserk Monsters brute force data structures dsu implementation math *1900	0 / 0	6
	220	P1923F Shrink-Reverse binary search brute force greedy hashing implementation string suffix structures strings *2800	0 / 0	10
	212	P1925B A Balanced Problemset? brute force greedy math number theory *1200	0 / 0	4
	205	P1926F Vlad and Avoiding X bitmasks brute force dfs and similar dp implementation *2200	0 / 0	8
	201	P1927C Choose the Different Ones! brute force greedy math *1000	0 / 0	3
	200	P1927D Find the Different Ones! binary search brute force data structures dp dsu greedy two pointers *1300	0 / 0	4
	194	P1928C Physical Education Lesson brute force math number theory *1600	0 / 0	5
	193	P1928D Lonely Mountain Dungeons brute force data structures greedy math ternary search *1900	0 / 0	6
	192	P1928E Modular Sequence brute force constructive algorithms dp graphs greedy math number theory *2300	0 / 0	8
	188	P1929C Sasha and the Casino binary search brute force constructive algorithms games greedy math *1400	0 / 0	4
	186	P1929E Sasha and the Happy Tree Cutting bitmasks brute force dfs and similar dp graphs greedy math trees *2300	0 / 0	8
	185	P1929F Sasha and the Wedding Binary Search Tree brute force combinatorics data structures dfs and similar math trees *2300	0 / 0	8
	183	P1930B Permutation Printing brute force constructive algorithms math *1000	0 / 0	3
	181	P1930D1 Sum over all Substrings (Easy Version) brute force dp greedy strings *1800	0 / 0	6
	178	P1930F Maximize the Difference bitmasks brute force dfs and similar *2700	0 / 0	10
	174	P1931A Recovering a Small String brute force strings *800	0 / 0	3
	172	P1931C Make Equal Again brute force greedy math *1000	0 / 0	3
	165	P1932C LR-remainders brute force data structures implementation math two pointers *1400	0 / 0	4
	158	P1933C Turtle Fingers: Count the Values of k brute force implementation math number theory *1100	0 / 0	3
	154	P1933G Turtle Magic: Royal Turtle Shell Pattern bitmasks brute force combinatorics constructive algorithms dfs and similar math *2300	0 / 0	8
	152	P1934B Yet Another Coin Problem brute force dp greedy math *1200	0 / 0	4
	148	P1934E Weird LCM Operations brute force constructive algorithms number theory *3000	0 / 0	10
	145	P1935C Messenger in MAC binary search brute force constructive algorithms data structures dp greedy sortings *1800	0 / 0	6
	143	P1935E Distance Learning Courses in MAC bitmasks brute force data structures greedy math *2400	0 / 0	9
	112	P1941A Rudolf and the Ticket brute force math *800	0 / 0	3
	111	P1941B Rudolf and 121 brute force dp greedy math *1000	0 / 0	3
	99	P1942F Farmer John's Favorite Function brute force data structures implementation math *2700	0 / 0	10
	93	P1943D1 Counting Is Fun (Easy Version) brute force combinatorics dp math *2400	0 / 0	9
	91	P1943E1 MEX Game 2 (Easy Version) binary search brute force greedy *2900	0 / 0	10
	84	P1945C Left and Right Houses brute force *1200	0 / 0	4
	79	P1945H GCD is Greater brute force data structures math number theory *2600	0 / 0	10
	75	P1946D Birthday Gift bitmasks brute force constructive algorithms greedy implementation *1900	0 / 1	6
	72	P1948A Special Characters brute force constructive algorithms *800	0 / 0	3
	71	P1948B Array Fix brute force dp greedy implementation *1100	0 / 0	3
	70	P1948C Arrow Path brute force constructive algorithms dfs and similar dp graphs shortest paths *1300	0 / 2	4
	69	P1948D Tandem Repeats? brute force strings two pointers *1700	1 / 21	5
	68	P1948E Clique Partition brute force constructive algorithms graphs greedy implementation *2100	0 / 0	7
	66	P1948G MST with Matching bitmasks brute force dsu graph matchings trees *3100	0 / 0	10
	65	P1949A Grove brute force dfs and similar dp geometry probabilities	0 / 0	(无)
	64	P1949B Charming Meals binary search brute force greedy sortings	0 / 0	(无)
	61	P1949E Damage per Second brute force math	0 / 0	(无)
	51	P1950D Product of Binary Decimals brute force dp implementation number theory *1100	0 / 0	3
	50	P1950E Nearly Shortest Repeating Substring brute force implementation number theory strings *1500	0 / 0	5
	49	P1950F 0, 1, 2, Tree! bitmasks brute force greedy implementation trees *1700	0 / 0	5
	43	P1951E No Palindromes brute force constructive algorithms divide and conquer greedy hashing implementation math strings *2000	0 / 0	7
	36	P1952C They Have Fooled brute force schedules	0 / 0	(无)
	33	P1952F Grid brute force	0 / 0	(无)
	29	P1952J Help, what does it mean to be "Based" brute force constructive algorithms expression parsing implementation sortings	0 / 0	(无)
	18	P1955E Long Inversions brute force greedy implementation sortings *1700	0 / 0	5
	16	P1955G GCD on a grid brute force dfs and similar dp implementation math number theory *1900	0 / 0	6
	15	P1955H The Most Reckless Defense bitmasks brute force constructive algorithms dp flows graph matchings shortest paths *2300	0 / 0	8
	14	P1956A Nene's Game binary search brute force data structures games greedy *800	0 / 0	3
	11	P1956D Nene and the Mex Operator bitmasks brute force constructive algorithms divide and conquer dp greedy implementation math *2000	0 / 0	7
	10	P1956E1 Nene vs brute force implementation math *2500	0 / 0	9
	9	P1956E2 Nene vs brute force greedy implementation math *2700	0 / 0	10
	4	P1957D A BIT of an Inequality bitmasks brute force dp	0 / 0	(无)
	9514	P1971F Circle Perimeter binary search brute force dfs and similar geometry implementation math *1600	0 / 0	5
	9511	P1972A Contest Proposal brute force greedy two pointers *800	0 / 0	3
	9509	P1973A Chess For Three brute force dp implementation math *900	0 / 0	3
	9506	P1973D Cat, Fox and Maximum Array Split brute force interactive math *2400	0 / 0	9
	9504	P1973F Maximum GCD Sum Queries bitmasks brute force dp implementation number theory *3100	0 / 0	10
	9498	P1974F Cutting Game binary search brute force data structures implementation sortings two pointers *1900	0 / 0	6
	9496	P1975A Bazoka and Mocha's Array brute force greedy implementation sortings *800	0 / 0	3
	9495	P1975B 378QAQ and Mocha's Array brute force greedy math sortings *1000	0 / 0	3
	9494	P1975C Chamo and Mocha's Array binary search brute force greedy *1200	0 / 0	4
	9493	P1975D Paint the Tree brute force dfs and similar dp greedy shortest paths trees *1700	0 / 0	5
	9491	P1975F Set bitmasks brute force combinatorics dfs and similar divide and conquer dp math *2600	0 / 0	10
	9479	P1977C Nikita and LCM brute force data structures dp greedy math number theory sortings *1900	0 / 0	6
	9478	P1977D XORificator bitmasks brute force greedy hashing *2300	0 / 0	8
	9472	P1978E Computing Machine brute force data structures dp greedy implementation *2000	0 / 0	7
	9470	P1979A Guess the Maximum brute force greedy implementation *800	0 / 0	3
	9467	P1979D Fixing a Binary String bitmasks brute force constructive algorithms dp greedy hashing strings *1800	0 / 0	6
	9465	P1979F Kostyanych's Theorem brute force constructive algorithms graphs interactive *2900	0 / 0	10
	9456	P1981A Turtle and Piggy Are Playing a Game brute force greedy math *800	0 / 0	3
	9454	P1981C Turtle and an Incomplete Sequence bitmasks brute force constructive algorithms greedy implementation math *1800	0 / 0	6
	9449	P1982B Collatz Conjecture brute force implementation math number theory	0 / 0	(无)
	9447	P1982D Beauty of the mountains brute force data structures implementation math number theory	0 / 0	(无)
	9440	P1984D "a" String Problem brute force hashing implementation math string suffix structures strings *2000	0 / 0	7
	9438	P1984F Reconstruction brute force dp math *2500	0 / 0	9
	9434	P1985B Maximum Multiple Sum brute force math number theory *800	0 / 0	3
	9431	P1985E Secret Box brute force combinatorics math *1200	0 / 0	4
	9428	P1985H1 Maximize the Largest Component (Easy Version) brute force data structures dfs and similar dsu graphs implementation *1700	0 / 0	5
	9426	P1986A X Axis brute force geometry math sortings	0 / 0	(无)
	9425	P1986B Matrix Stabilization brute force data structures greedy sortings	0 / 0	(无)
	9423	P1986D Mathematical Problem brute force dp greedy implementation math two pointers	0 / 0	(无)
	9420	P1986G1 Permutation Problem (Simple Version) binary search brute force combinatorics data structures math number theory	0 / 0	(无)
	9419	P1986G2 Permutation Problem (Hard Version) brute force data structures hashing math number theory	0 / 0	(无)

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