number theory - Codeforces - 题库

ID	题目显示标签隐藏标签	AC / 尝试	难度
8608	P1965B Missing Subsequence Sum bitmasks constructive algorithms greedy number theory *1800	0 / 0	6
8600	P1967B1 Reverse Card (Easy Version) brute force math number theory *1400	0 / 0	4
8599	P1967B2 Reverse Card (Hard Version) brute force math number theory *2200	0 / 0	8
8593	P1968A Maximize? brute force math number theory *800	0 / 0	3
8591	P1968C Assembly via Remainders constructive algorithms number theory *1000	0 / 0	3
8543	P1973F Maximum GCD Sum Queries bitmasks brute force dp implementation number theory *3100	0 / 0	10
8524	P1977C Nikita and LCM brute force data structures dp greedy math number theory sortings	0 / 0	(无)

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

分类