题库 - 思+学堂

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	271	P1690G Count the Trains binary search data structures greedy sortings *2000	0 / 0	7
	270	P1691A Beat The Odds brute force greedy math *800	0 / 0	3
	269	P1691B Shoe Shuffling constructive algorithms greedy implementation two pointers *1000	0 / 0	3
	268	P1691C Sum of Substrings brute force constructive algorithms greedy math strings *1400	0 / 0	4
	267	P1691D Max GEQ Sum binary search constructive algorithms data structures divide and conquer implementation two pointers *1800	0 / 0	6
	266	P1691E Number of Groups data structures dfs and similar dsu graphs greedy sortings *2300	0 / 0	8
	265	P1691F K-Set Tree combinatorics dfs and similar dp math trees *2500	0 / 0	9
	264	P1692A Marathon implementation *800	0 / 0	3
	263	P1692B All Distinct greedy sortings *800	0 / 0	3
	262	P1692C Where's the Bishop? implementation *800	0 / 0	3
	261	P1692D The Clock brute force implementation *1100	0 / 0	3
	260	P1692E Binary Deque binary search implementation two pointers *1200	0 / 0	4
	259	P1692F 3SUM brute force math *1300	0 / 0	4
	258	P1692G 2^Sort data structures dp sortings two pointers *1400	0 / 0	4
	257	P1692H Gambling data structures dp greedy math *1700	0 / 0	5
	256	P1693A Directional Increase greedy *1300	0 / 0	4
	255	P1693B Fake Plastic Trees dfs and similar dp greedy trees *1700	0 / 0	5
	254	P1693C Keshi in Search of AmShZ graphs greedy shortest paths *2300	0 / 0	8
	253	P1693D Decinc Dividing brute force data structures divide and conquer dp greedy *2800	0 / 0	10
	252	P1693E Outermost Maximums data structures greedy *3400	0 / 0	10
	251	P1693F I Might Be Wrong binary search greedy two pointers *3400	1 / 1	10
	250	P1694A Creep greedy implementation *800	0 / 0	3
	249	P1694B Paranoid String constructive algorithms greedy *1200	0 / 0	4
	248	P1695A Subrectangle Guess games *800	0 / 0	3
	247	P1695B Circle Game games greedy *1000	0 / 0	3
	246	P1695C Zero Path brute force data structures dp graphs greedy shortest paths *1700	0 / 0	5
	245	P1695D1 Tree Queries (Easy Version) brute force constructive algorithms dfs and similar dp greedy trees *2200	0 / 0	8
	244	P1695D2 Tree Queries (Hard Version) constructive algorithms dfs and similar dp greedy trees *2300	0 / 0	8
	243	P1695E Ambiguous Dominoes constructive algorithms dfs and similar graphs *2700	1 / 1	10
	242	P1696A NIT orz! bitmasks greedy *800	0 / 0	3
	241	P1696B NIT Destroys the Universe greedy *900	0 / 0	3
	240	P1696C Fishingprince Plays With Array constructive algorithms greedy implementation math *1400	0 / 0	4
	239	P1696D Permutation Graph binary search constructive algorithms data structures divide and conquer greedy shortest paths *1900	0 / 0	6
	238	P1696E Placing Jinas combinatorics math *2000	0 / 0	7
	237	P1696F Tree Recovery brute force constructive algorithms dfs and similar dsu graphs trees *2600	0 / 0	10
	236	P1696G Fishingprince Plays With Array Again brute force data structures geometry math *3300	0 / 0	10
	235	P1696H Maximum Product? brute force combinatorics dp greedy implementation math two pointers *3500	0 / 0	10
	234	P1697A Parkway Walk greedy implementation *800	0 / 0	3
	233	P1697B Promo greedy sortings *900	0 / 0	3
	232	P1697C awoo's Favorite Problem binary search constructive algorithms data structures greedy implementation strings two pointers *1400	0 / 0	4
	231	P1697D Guess The String binary search constructive algorithms interactive *1900	0 / 0	6
	230	P1697E Coloring brute force combinatorics constructive algorithms dp geometry graphs greedy implementation math *2400	0 / 0	9
	229	P1697F Too Many Constraints 2-sat constructive algorithms graphs implementation *2800	0 / 0	10
	228	P1698A XOR Mixup bitmasks brute force *800	0 / 0	3
	227	P1698B Rising Sand constructive algorithms greedy implementation *800	0 / 0	3
	226	P1698C 3SUM Closure brute force data structures *1300	0 / 0	4
	225	P1698D Fixed Point Guessing binary search constructive algorithms interactive *1600	0 / 0	5
	224	P1698E PermutationForces II brute force combinatorics greedy sortings trees two pointers *2300	0 / 0	8
	223	P1698F Equal Reversal constructive algorithms graphs implementation math *2800	0 / 0	10
	222	P1698G Long Binary String bitmasks math matrices meet-in-the-middle number theory *2900	0 / 0	10

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