题库 - Boyacoding

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	863	P1604A Era greedy *800	0 / 0	3
	862	P1604B XOR Specia-LIS-t *1100	0 / 0	3
	861	P1605A A.M math number theory *800	0 / 0	3
	860	P1605B Reverse Sort greedy sortings *1000	0 / 0	3
	859	P1605C Dominant Character brute force greedy implementation strings *1400	0 / 0	4
	858	P1605D Treelabeling bitmasks constructive algorithms dfs and similar games greedy implementation trees *2100	0 / 0	7
	857	P1605E Array Equalizer binary search greedy implementation math number theory sortings two pointers *2400	0 / 0	9
	856	P1605F PalindORme combinatorics dp *2900	0 / 0	10
	855	P1606A AB Balance strings *900	0 / 0	3
	854	P1606B Update Files greedy implementation math *1100	0 / 0	3
	853	P1606C Banknotes greedy number theory *1400	0 / 0	4
	852	P1606D Red-Blue Matrix brute force constructive algorithms implementation sortings *2400	0 / 0	9
	851	P1606E Arena combinatorics dp math *2100	0 / 0	7
	850	P1606F Tree Queries brute force dp trees *2800	0 / 0	10
	849	P1607A Linear Keyboard implementation strings *800	0 / 0	3
	848	P1607B Odd Grasshopper math *900	0 / 0	3
	847	P1607C Minimum Extraction brute force sortings *1000	0 / 0	3
	846	P1607D Blue-Red Permutation greedy math sortings *1300	0 / 0	4
	845	P1607E Robot on the Board 1 implementation *1600	0 / 0	5
	844	P1607F Robot on the Board 2 brute force dfs and similar graphs implementation *2300	0 / 0	8
	843	P1607G Banquet Preparations 1 greedy *2200	0 / 0	8
	842	P1607H Banquet Preparations 2 greedy sortings two pointers *2200	0 / 0	8
	841	P1608A Find Array constructive algorithms math *800	0 / 0	3
	840	P1608B Build the Permutation constructive algorithms greedy *1200	0 / 0	4
	839	P1608C Game Master data structures dfs and similar dp graphs greedy two pointers *1700	0 / 0	5
	838	P1608D Dominoes combinatorics fft graphs math number theory *2400	0 / 0	9
	837	P1608E The Cells on the Paper binary search implementation sortings *2800	0 / 0	10
	836	P1608F MEX counting combinatorics dp implementation *3200	0 / 0	10
	835	P1608G Alphabetic Tree binary search data structures dfs and similar hashing string suffix structures strings trees *3500	0 / 0	10
	834	P1609A Divide and Multiply greedy implementation math number theory *900	0 / 0	3
	833	P1609B William the Vigilant implementation strings *1100	0 / 0	3
	832	P1609C Complex Market Analysis binary search dp implementation number theory schedules two pointers *1400	0 / 0	4
	831	P1609D Social Network dsu graphs greedy implementation trees *1600	0 / 0	5
	830	P1609E William The Oblivious bitmasks data structures dp matrices *2400	0 / 0	9
	829	P1609F Interesting Sections data structures divide and conquer meet-in-the-middle two pointers *2800	0 / 0	10
	828	P1609G A Stroll Around the Matrix data structures greedy math *3000	0 / 0	10
	827	P1609H Pushing Robots *3500	0 / 0	10
	826	P1610A Anti Light's Cell Guessing math *900	0 / 0	3
	825	P1610B Kalindrome Array greedy two pointers *1100	0 / 0	3
	824	P1610C Keshi Is Throwing a Party binary search greedy *1600	0 / 0	5
	823	P1610D Not Quite Lee combinatorics dp math number theory *2000	0 / 0	7
	822	P1610E AmShZ and G.O.A.T. binary search brute force greedy implementation math *2300	0 / 0	8
	821	P1610F Mashtali: a Space Oddysey constructive algorithms dfs and similar graphs *3000	0 / 0	10
	820	P1610G AmShZ Wins a Bet data structures greedy hashing *3300	0 / 0	10
	819	P1610H Squid Game data structures dfs and similar greedy trees *3100	0 / 0	10
	818	P1610I Mashtali vs AtCoder games trees *3100	0 / 0	10
	817	P1611A Make Even constructive algorithms math *800	0 / 0	3
	816	P1611B Team Composition: Programmers and Mathematicians binary search constructive algorithms math *800	0 / 0	3
	815	P1611C Polycarp Recovers the Permutation constructive algorithms *1000	0 / 0	3
	814	P1611D Weights Assignment For Tree Edges constructive algorithms trees *1500	0 / 0	5
	813	P1611E1 Escape The Maze (easy version) dfs and similar greedy shortest paths trees two pointers *1700	0 / 0	5
	812	P1611E2 Escape The Maze (hard version) dfs and similar dp greedy shortest paths trees *1900	0 / 0	6
	811	P1611F ATM and Students binary search data structures two pointers *1800	0 / 0	6
	810	P1611G Robot and Candies data structures graph matchings greedy *2500	0 / 0	9
	809	P1612A Distance brute force constructive algorithms *800	0 / 0	3
	808	P1612B Special Permutation constructive algorithms greedy *900	0 / 0	3
	807	P1612C Chat Ban binary search math *1300	0 / 0	4
	806	P1612D X-Magic Pair math number theory *1600	0 / 0	5
	805	P1612E Messages brute force dp greedy probabilities sortings *2000	0 / 0	7
	804	P1612F Armor and Weapons brute force dp greedy shortest paths *2800	0 / 0	10
	803	P1612G Max Sum Array combinatorics constructive algorithms greedy sortings *2500	0 / 0	9
	802	P1613A Long Comparison implementation math *900	0 / 0	3
	801	P1613B Absent Remainder greedy implementation sortings *1000	0 / 0	3
	800	P1613C Poisoned Dagger binary search *1200	0 / 0	4
	799	P1613D MEX Sequences dp math *1900	0 / 0	6
	798	P1613E Crazy Robot dfs and similar graphs *2000	0 / 0	7
	797	P1613F Tree Coloring combinatorics divide and conquer fft *2600	0 / 0	10
	796	P1614A Divan and a Store brute force constructive algorithms greedy *800	0 / 0	3
	795	P1614B Divan and a New Project constructive algorithms sortings *1000	0 / 0	3
	794	P1614C Divan and bitwise operations bitmasks combinatorics constructive algorithms dp math *1500	0 / 0	5
	793	P1614D1 Divan and Kostomuksha (easy version) dp number theory *2100	0 / 0	7
	792	P1614D2 Divan and Kostomuksha (hard version) dp number theory *2300	0 / 0	8
	791	P1614E Divan and a Cottage binary search data structures *2600	0 / 0	10
	790	P1615A Closing The Gap greedy math *800	0 / 0	3
	789	P1615B And It's Non-Zero bitmasks greedy math *1300	0 / 0	4
	788	P1615C Menorah brute force graphs greedy math *1600	0 / 0	5
	787	P1615D X(or)-mas Tree bitmasks dfs and similar dsu graphs trees *2200	0 / 0	8
	786	P1615E Purple Crayon data structures dfs and similar games graphs greedy math sortings trees *2400	0 / 0	9
	785	P1615F LEGOndary Grandmaster combinatorics dp math *2800	0 / 0	10
	784	P1615G Maximum Adjacent Pairs constructive algorithms graph matchings *3300	0 / 0	10
	783	P1615H Reindeer Games binary search constructive algorithms data structures divide and conquer flows graphs shortest paths *3000	0 / 0	10
	782	P1616A Integer Diversity implementation *800	0 / 0	3
	781	P1616B Mirror in the String greedy strings *1100	0 / 0	3
	780	P1616C Representative Edges brute force geometry implementation math *1500	0 / 0	5
	779	P1616D Keep the Average High dp greedy math *2000	0 / 0	7
	778	P1616E Lexicographically Small Enough brute force data structures greedy strings *2200	0 / 0	8
	777	P1616F Tricolor Triangles brute force graphs math matrices *2900	0 / 0	10
	776	P1616G Just Add an Edge dfs and similar dp graphs *3500	0 / 0	10
	775	P1616H Keep XOR Low bitmasks combinatorics data structures divide and conquer dp math *3000	0 / 0	10
	774	P1617A Forbidden Subsequence constructive algorithms greedy sortings strings *800	0 / 0	3
	773	P1617B GCD Problem brute force constructive algorithms math number theory *900	0 / 0	3
	772	P1617C Paprika and Permutation binary search greedy math sortings *1300	0 / 0	4
	771	P1617D1 Too Many Impostors (easy version) constructive algorithms implementation interactive *1800	0 / 0	6
	770	P1617D2 Too Many Impostors (hard version) constructive algorithms implementation interactive math *2400	0 / 0	9
	769	P1617E Christmas Chocolates dfs and similar dp games graphs implementation math number theory shortest paths trees *2700	0 / 0	10
	768	P1618A Polycarp and Sums of Subsequences math sortings *800	0 / 0	3
	767	P1618B Missing Bigram implementation *800	0 / 0	3
	766	P1618C Paint the Array math *1100	0 / 0	3
	765	P1618D Array and Operations dp greedy math *1300	0 / 0	4
	764	P1618E Singers' Tour constructive algorithms math *1700	0 / 0	5

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