*1800 - Codeforces - 题库

ID	题目显示标签隐藏标签	AC / 尝试	难度
8126	P1750D Count GCD combinatorics math number theory *1800	0 / 0	6
8395	P1758D Range = √Sum binary search brute force constructive algorithms math two pointers *1800	0 / 0	6
8107	P1759F All Possible Digits binary search data structures greedy math number theory *1800	0 / 0	6
8383	P1768D Lucky Permutation constructive algorithms dfs and similar graphs greedy *1800	0 / 0	6
8368	P1775D Friendly Spiders dfs and similar graphs math number theory shortest paths *1800	0 / 0	6
8336	P1781D Many Perfect Squares brute force math number theory *1800	0 / 0	6
8508	P1915G Bicycles graphs greedy implementation shortest paths sortings *1800	0 / 0	6
8458	P1922E Increasing Subsequences bitmasks constructive algorithms divide and conquer greedy math *1800	0 / 0	6
8608	P1965B Missing Subsequence Sum bitmasks constructive algorithms greedy number theory *1800	0 / 0	6
8588	P1968F Equal XOR Segments binary search data structures *1800	0 / 0	6
8567	P1970E1 Trails (Easy) dp *1800	0 / 0	6
8538	P1974E Money Buys Happiness dp *1800	0 / 0	6

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

分类