brute force - 题库 - 达芬奇编程

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	778	P1830B The BOSS Can Count Pairs brute force math *2000	0 / 0	7
	776	P1830D Mex Tree brute force dp trees *2800	0 / 0	10
	770	P1832B Maximum Sum brute force sortings two pointers *1100	0 / 0	3
	766	P1832E Combinatorics Problem brute force combinatorics dp *2200	0 / 0	8
	761	P1833D Flipper brute force constructive algorithms greedy *1400	0 / 0	4
	754	P1834D Survey in Class brute force data structures greedy implementation sortings *1900	0 / 0	6
	752	P1834F Typewriter brute force math *2500	0 / 0	9
	751	P1835A k-th equality brute force implementation math *1700	0 / 0	5
	750	P1835B Lottery binary search brute force greedy math two pointers *2500	0 / 0	9
	749	P1835C Twin Clusters bitmasks brute force constructive algorithms math probabilities *2600	0 / 0	10
	721	P1840F Railguns brute force dfs and similar dp graphs *2200	0 / 0	8
	716	P1841C Ranom Numbers brute force dp greedy math strings *1800	0 / 0	6
	699	P1843E Tracking Segments binary search brute force data structures two pointers *1600	0 / 0	5
	691	P1844F1 Min Cost Permutation (Easy Version) brute force constructive algorithms greedy math *2600	0 / 0	10
	684	P1845D Rating System binary search brute force data structures dp dsu greedy math two pointers *1800	0 / 0	6
	680	P1846B Rudolph and Tic-Tac-Toe brute force implementation strings *800	0 / 0	3
	677	P1846E1 Rudolf and Snowflakes (simple version) brute force implementation math *1300	0 / 0	4
	676	P1846E2 Rudolf and Snowflakes (hard version) binary search brute force implementation math *1800	0 / 0	6
	671	P1847C Vampiric Powers, anyone? bitmasks brute force dp greedy *1400	0 / 0	4
	669	P1847E Triangle Platinum? brute force combinatorics implementation interactive math probabilities *2900	0 / 0	10
	664	P1848D Vika and Bonuses binary search brute force math ternary search *2200	0 / 0	8
	663	P1848E Vika and Stone Skipping brute force implementation math number theory *2600	0 / 0	10
	659	P1849C Binary String Copying binary search brute force data structures hashing strings *1600	0 / 0	5
	652	P1850D Balanced Round brute force greedy implementation sortings *900	0 / 0	3
	650	P1850F We Were Both Children brute force implementation math number theory *1300	0 / 0	4
	647	P1851A Escalator Conversations brute force constructive algorithms math *800	0 / 0	3
	634	P1853A Desorting brute force greedy math *800	0 / 0	3
	633	P1853B Fibonaccharsis binary search brute force math *1200	0 / 0	4
	630	P1854B Earn or Unlock bitmasks brute force dp *2200	0 / 0	8
	627	P1854E Game Bundles brute force constructive algorithms dp greedy math *3000	0 / 0	10
	626	P1854F Mark and Spaceship brute force dp *3500	0 / 0	10
	624	P1855B Longest Divisors Interval brute force combinatorics greedy math number theory *900	0 / 0	3
	621	P1856C To Become Max binary search brute force data structures dp *1600	0 / 0	5
	609	P1858B The Walkway brute force dp greedy math number theory *1500	0 / 0	5
	607	P1858D Trees and Segments brute force data structures dp greedy two pointers *2200	0 / 0	8
	606	P1858E1 Rollbacks (Easy Version) brute force data structures dfs and similar trees *2500	0 / 0	9
	602	P1859C Another Permutation Problem brute force dp greedy math *1200	0 / 0	4
	600	P1859E Maximum Monogonosity brute force dp math *2500	0 / 0	9
	597	P1860B Fancy Coins binary search brute force greedy math *1200	0 / 0	4
	581	P1862F Magic Will Save the World binary search bitmasks brute force dp *1800	0 / 0	6
	575	P1863E Speedrun brute force dfs and similar dp graphs greedy math sortings two pointers *2100	0 / 0	7
	567	P1864D Matrix Cascade brute force constructive algorithms data structures dp greedy math *1700	0 / 0	5
	550	P1866L Lihmuf Balling binary search brute force math *2400	0 / 0	9
	549	P1866M Mighty Rock Tower brute force combinatorics dp math probabilities *2400	0 / 0	9
	545	P1867D Cyclic Operations brute force constructive algorithms dfs and similar graphs greedy implementation *1800	0 / 0	6
	542	P1867F Most Different Tree brute force constructive algorithms dfs and similar greedy hashing *2700	0 / 0	10
	528	P1870E Another MEX Problem bitmasks brute force dp shortest paths *2300	0 / 0	8
	524	P1872A Two Vessels brute force greedy math *800	0 / 0	3
	518	P1872G Replace With Product brute force greedy math *2000	0 / 0	7
	517	P1873A Short Sort brute force implementation *800	0 / 0	3
	516	P1873B Good Kid brute force greedy math *800	0 / 0	3
	509	P1874A Jellyfish and Game brute force games greedy implementation *1200	0 / 0	4
	508	P1874B Jellyfish and Math bitmasks brute force dfs and similar dp graphs shortest paths *2400	0 / 0	9
	502	P1875A Jellyfish and Undertale brute force greedy *900	0 / 0	3
	493	P1876G Clubstep binary search brute force data structures greedy trees *3500	0 / 0	10
	485	P1878F Vasilije Loves Number Theory brute force math number theory *1900	0 / 0	6
	484	P1878G wxhtzdy ORO Tree binary search bitmasks brute force data structures dfs and similar implementation trees *2300	0 / 0	8
	479	P1879E Interactive Game with Coloring brute force constructive algorithms dfs and similar graphs implementation interactive trees *2400	0 / 0	9
	478	P1879F Last Man Standing brute force data structures number theory *2800	0 / 0	10
	477	P1881A Don't Try to Count brute force strings *800	0 / 0	3
	475	P1881C Perfect Square brute force implementation *1200	0 / 0	4
	469	P1882B Sets and Union bitmasks brute force constructive algorithms greedy *1300	0 / 0	4
	468	P1882C Card Game brute force greedy *1500	0 / 0	5
	466	P1882E1 Two Permutations (Easy Version) brute force constructive algorithms greedy number theory *2400	0 / 0	9
	456	P1884A Simple Design brute force greedy math *800	0 / 0	3
	454	P1884C Medium Design brute force data structures dp greedy sortings *1700	0 / 0	5
	450	P1886A Sum of Three brute force constructive algorithms math *800	0 / 0	3
	443	P1887C Minimum Array binary search brute force constructive algorithms data structures greedy hashing two pointers *2400	0 / 0	9
	437	P1889C1 Doremy's Drying Plan (Easy Version) brute force data structures dp greedy sortings *2000	0 / 0	7
	435	P1889D Game of Stacks brute force dfs and similar graphs implementation trees *3000	0 / 0	10
	429	P1891B Deja Vu brute force math sortings *1100	0 / 0	3
	427	P1891D Suspicious logarithms binary search brute force math *1900	0 / 0	6
	426	P1891E Brukhovich and Exams brute force greedy implementation math sortings *2500	0 / 0	9
	424	P1893A Anonymous Informant brute force dfs and similar graphs implementation *1400	0 / 0	4
	422	P1893C Freedom of Choice brute force greedy implementation *2000	0 / 0	7
	415	P1895C Torn Lucky Ticket brute force dp hashing implementation math *1400	0 / 0	4
	413	P1895E Infinite Card Game binary search brute force data structures dfs and similar dp dsu games graphs greedy sortings two pointers *2300	0 / 0	8
	403	P1896H1 Cyclic Hamming (Easy Version) brute force divide and conquer dp fft math number theory *3400	0 / 0	10
	402	P1896H2 Cyclic Hamming (Hard Version) brute force dp fft math number theory *3500	0 / 0	10
	401	P1898A Milica and String brute force implementation strings *800	0 / 0	3
	396	P1898F Vova Escapes the Matrix brute force dfs and similar divide and conquer shortest paths *2600	0 / 0	10
	394	P1899B 250 Thousand Tons of TNT brute force implementation number theory *1100	0 / 0	3
	385	P1900D Small GCD bitmasks brute force dp math number theory *2000	0 / 0	7
	375	P1902B Getting Points binary search brute force greedy *1100	0 / 0	3
	374	P1902C Insert and Equalize brute force constructive algorithms greedy math number theory *1300	0 / 0	4
	370	P1903A Halloumi Boxes brute force greedy sortings *800	0 / 0	3
	369	P1903B StORage room bitmasks brute force constructive algorithms greedy *1200	0 / 0	4
	367	P1903D1 Maximum And Queries (easy version) binary search bitmasks brute force greedy *1700	0 / 0	5
	363	P1904A Forked! brute force implementation *900	0 / 0	3
	361	P1904C Array Game binary search brute force data structures sortings two pointers *1400	0 / 0	4
	360	P1904D1 Set To Max (Easy Version) brute force constructive algorithms greedy *1600	0 / 0	5
	351	P1905F Field Should Not Be Empty brute force data structures divide and conquer *2600	0 / 0	10
	350	P1906A Easy As ABC brute force *1000	0 / 0	3
	333	P1907E Good Triples brute force combinatorics number theory *1600	0 / 0	5
	331	P1907G Lights brute force constructive algorithms dfs and similar graphs greedy implementation *2200	0 / 0	8
	326	P1909E Multiple Lamps bitmasks brute force constructive algorithms math number theory *2400	0 / 0	9
	325	P1909F1 Small Permutation Problem (Easy Version) brute force combinatorics dp math *2200	0 / 0	8
	296	P1913C Game with Multiset binary search bitmasks brute force greedy *1300	0 / 0	4
	289	P1914D Three Activities brute force dp greedy implementation sortings *1200	0 / 0	4
	288	P1914E1 Game with Marbles (Easy Version) brute force games greedy sortings *1400	0 / 0	4

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