![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数论
文章平均质量分 84
akxxsb
写写博客装装逼,存代码
展开
-
Codeforces Round #265 (Div. 2)E. Substitutes in Number(数学)
E. Substitutes in Numbertime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAndrew and Eugene are playing a gam原创 2014-09-09 10:22:27 · 1305 阅读 · 0 评论 -
数论(同余+hash)
Time Limit:3000MS Memory Limit:65536KB Description You are given a sequence a[0]a[1] ... a[N-1] of digits and a prime number Q. For each i<=j with a[i] != 0, the subsequence a[i]a[i+1]...a[j] can be原创 2014-10-10 20:16:57 · 885 阅读 · 0 评论 -
UVA11005 Semi-prime H-numbers(筛法)
UVA - 11105Semi-prime H-numbersTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescriptionProblem A: Semi-prime H-number原创 2015-05-07 01:12:31 · 1146 阅读 · 0 评论 -
UVA 1210 Sum of Consecutive Prime Numbers(数论)
UVA - 1210Sum of Consecutive Prime NumbersTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescriptionSome positive integ原创 2015-05-07 01:26:05 · 1666 阅读 · 0 评论 -
xdu 1022(数论筛法)
1022: A simple math problem 2时间限制: 1 Sec 内存限制: 128 MB提交: 73 解决: 13[提交][状态][讨论版]题目描述高斯函数: [x]表示,小于等于x的最大整数,即向下取整。 如 [2.5]=2,[1.2]=1等。 定义函数f(n)=[n/1]+[n/2]+[n/3]+...+[n/n] . sum(a,b)=f(a原创 2015-05-07 01:05:59 · 1029 阅读 · 0 评论 -
UVA 10622 Perfect P-th Powers(数论)
UVA - 10622Perfect P-th PowersTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescriptionProblem E: Perfect Pth Powers原创 2015-05-07 01:31:08 · 841 阅读 · 0 评论