数学题
k_Tao
这个作者很懒,什么都没留下…
展开
-
Pseudoprime numbers
F - Pseudoprime numbersTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 3641Appoint description: System Crawler (2016-05-20)原创 2016-05-22 22:44:49 · 323 阅读 · 0 评论 -
Survive in the White Terror
Problem B: Survive in the White TerrorTime Limit: 1 Sec Memory Limit: 128 MBSubmit: 127 Solved: 31[Submit][Status][Web Board]Description In 1927~1949, the whole of China were e原创 2016-05-20 17:04:23 · 305 阅读 · 0 评论 -
steps
StepsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7913 Accepted: 3632DescriptionOne steps through integer points of the straight line. The length of a原创 2016-05-20 16:50:16 · 247 阅读 · 0 评论 -
N的二进制中1的个数
解法一:对于二进制数的操作,我们知道除以一个2,原来的位数将会减少一位,如果除的过程中有余数,那么就表示当前位置有一个1,否则为0。以10100010为例:第一次除以2时,商为1010001,余0。第二次除以2时,商为101000,余1。第三次除以2时,商为10100,余0。第四次除以2时,商为1010,余0。第五次除以2时,商为101,余0。第六次除以2时,商为1原创 2016-05-19 15:15:13 · 1743 阅读 · 0 评论 -
求N!的位数
N!的位数提示:整数K的位数(int)log10(N)+1N!=1*2*......*N整数N!的位数(int)log10(1*2*......*N)+1log10(1*2*......*N)=log10(1)+log10(2)+......+log10(N)简单代码实现:#include#includeusing namespace std;int原创 2016-05-19 14:08:55 · 266 阅读 · 0 评论 -
求组合数(c(m,n))
定义:从n个不同元素中取出m(m≤n)个元素的所有组合的个数,叫做从n个不同元素中取出m个元素的组合数。用符号c(n,m) 表示。性质:c(n,m)=c(n,n-m); c(n,0)=1;递推公式:c(n,m)=c(n-1,m-1)+c(n-1,m)C(n+1,m)=c(n,m-1)+c(n,m)=c(n,m-1)+c(n-1,m)+c(n-1,m-1);原创 2016-05-19 13:33:44 · 11987 阅读 · 2 评论 -
GCD & LCM Inverse(目前超时)
GCD & LCM InverseTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 13128 Accepted: 2424DescriptionGiven two positive integers a and b, we can easily calcu原创 2016-05-22 22:17:53 · 283 阅读 · 0 评论 -
Prime Distance(两次筛素)
Prime DistanceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15858 Accepted: 4213DescriptionThe branch of mathematics called number theory is about prope原创 2016-05-25 13:23:18 · 212 阅读 · 0 评论 -
无限循环小数化分数
Problem I: Dead FractionTime Limit: 1 Sec Memory Limit: 128 MBSubmit: 54 Solved: 8[Submit][Status][Web Board]DescriptionMike is frantically scrambling to finish his thesis at the last原创 2016-05-18 15:27:56 · 442 阅读 · 0 评论