题库 - 思+学堂

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	1021	P1551D2 Domino (hard version) constructive algorithms implementation math *2100	0 / 0	7
	1020	P1551E Fixed Points binary search brute force dp *2000	0 / 0	7
	1019	P1551F Equidistant Vertices brute force combinatorics dfs and similar dp trees *2200	0 / 0	8
	1018	P1552A Subsequence Permutation sortings strings *800	0 / 0	3
	1017	P1552B Running for Gold combinatorics graphs greedy sortings *1500	0 / 0	5
	1016	P1552C Maximize the Intersections combinatorics constructive algorithms geometry greedy sortings *1800	0 / 0	6
	1015	P1552D Array Differentiation bitmasks brute force constructive algorithms dfs and similar dp graphs math *1800	0 / 0	6
	1014	P1552E Colors and Intervals constructive algorithms data structures greedy sortings *2300	0 / 0	8
	1013	P1552F Telepanting binary search data structures dp sortings *2200	0 / 0	8
	1012	P1552G A Serious Referee bitmasks brute force dfs and similar sortings *3000	0 / 0	10
	1011	P1552H Guess the Perimeter binary search interactive number theory *3300	0 / 0	10
	1010	P1552I Organizing a Music Festival dfs and similar math *3400	0 / 0	10
	1009	P1553A Digits Sum math number theory *800	0 / 0	3
	1008	P1553B Reverse String brute force dp hashing implementation strings *1300	0 / 0	4
	1007	P1553C Penalty bitmasks brute force dp greedy *1200	0 / 0	4
	1006	P1553D Backspace dp greedy strings two pointers *1500	0 / 0	5
	1005	P1553E Permutation Shift brute force combinatorics constructive algorithms dfs and similar dsu graphs math *2100	0 / 0	7
	1004	P1553F Pairwise Modulo data structures math *2300	0 / 0	8
	1003	P1553G Common Divisor Graph brute force constructive algorithms dsu graphs hashing math number theory *2700	0 / 0	10
	1002	P1553H XOR and Distance bitmasks divide and conquer trees *2900	0 / 0	10
	1001	P1553I Stairs combinatorics divide and conquer dp fft math *3400	0 / 0	10
	1000	P1554A Cherry greedy *800	0 / 0	3
	999	P1554B Cobb bitmasks brute force greedy math *1700	0 / 0	5
	998	P1554C Mikasa binary search bitmasks greedy implementation *1800	0 / 0	6
	997	P1554D Diane constructive algorithms greedy strings *1800	0 / 0	6
	996	P1554E You dfs and similar dp math number theory *2600	0 / 0	10
	995	P1555A PizzaForces brute force math *900	0 / 0	3
	994	P1555B Two Tables brute force *1300	0 / 0	4
	993	P1555C Coin Rows brute force constructive algorithms dp implementation *1300	0 / 0	4
	992	P1555D Say No to Palindromes brute force constructive algorithms dp strings *1600	0 / 0	5
	991	P1555E Boring Segments data structures sortings trees two pointers *2100	0 / 0	7
	990	P1555F Good Graph data structures dsu graphs trees *2700	0 / 0	10
	989	P1556A A Variety of Operations math *800	0 / 0	3
	988	P1556B Take Your Places! implementation *1300	0 / 0	4
	987	P1556C Compressed Bracket Sequence brute force implementation *1800	0 / 0	6
	986	P1556D Take a Guess bitmasks constructive algorithms interactive math *1800	0 / 0	6
	985	P1556E Equilibrium data structures dp greedy *2200	0 / 0	8
	984	P1556F Sports Betting bitmasks combinatorics dp graphs math probabilities *2500	0 / 0	9
	983	P1556G Gates to Another World bitmasks data structures dsu two pointers *3300	0 / 0	10
	982	P1556H DIY Tree graphs greedy math probabilities *3300	1 / 1	10
	981	P1557A Ezzat and Two Subsequences brute force math sortings *800	0 / 0	3
	980	P1557B Moamen and k-subarrays greedy sortings *1100	0 / 0	3
	979	P1557C Moamen and XOR bitmasks combinatorics dp math matrices *1700	0 / 0	5
	978	P1557D Ezzat and Grid data structures dp greedy *2200	0 / 0	8
	977	P1557E Assiut Chess brute force constructive algorithms interactive *2800	0 / 0	10
	976	P1558A Charmed by the Game brute force math *1300	0 / 0	4
	975	P1558B Up the Strip brute force dp math number theory two pointers *1900	0 / 0	6
	974	P1558C Bottom-Tier Reversals constructive algorithms greedy *2000	0 / 0	7
	973	P1558D Top-Notch Insertions combinatorics data structures *2600	0 / 0	10
	972	P1558E Down Below binary search dfs and similar graphs greedy meet-in-the-middle shortest paths *3000	0 / 0	10

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