数论
搞么子啊小子
这个作者很懒,什么都没留下…
展开
-
hdu 2031 进制转换
进制转换Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 23446 Accepted Submission(s): 13132Problem Description输入一个十进制数N,将它转换成R进制数输出原创 2014-05-24 20:47:58 · 543 阅读 · 0 评论 -
hdu 3501 Calculation 2
Calculation 2Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2135 Accepted Submission(s): 898Problem DescriptionGiven a p原创 2014-08-13 09:31:10 · 643 阅读 · 0 评论 -
欧拉函数
在数对正整数n,欧拉函数是少于或等于n的数中与n互质的数的数目。它又称为Euler's totient、function、φ函数、欧拉商数等。 例如φ(8)=4,因为1,3,5,7均和8互质。 从欧拉函数引伸出来在环论方面的事实和拉格朗日定理构成了欧拉定理的证明。φ函数的值 通式:φ(x)=x(1-1/p1)(1-1/p2)(1-1/p3)(1-1/p4)…..(1-1/pn),其中p1, p原创 2014-07-30 19:41:36 · 888 阅读 · 0 评论 -
poj 1061 青蛙的约会
青蛙的约会Time Limit: 1000MSMemory Limit: 10000KTotal Submissions: 90251Accepted: 16393Description两只青蛙在网上相识了,它们聊得很开心,于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上,于是它们约定各自朝西跳,直到碰面原创 2014-08-12 13:03:43 · 636 阅读 · 0 评论 -
数论
数论欧几里德算法:用于计算两个整数a,b的最大公约数。基本算法:设a=qb+r,其中a,b,q,r都是整数,则gcd(a,b)=gcd(b,r),即gcd(a,b)=gcd(b,a%b)。算法的实现(递归算法):[cpp] view plaincopyprint?int gcd(int a,int b)原创 2014-08-12 08:50:29 · 1564 阅读 · 0 评论 -
hdu 1573 X问题
X问题Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3305 Accepted Submission(s): 1071Problem Description求在小于等于N的正整数中有多少个X满足:X mod原创 2014-08-11 20:57:33 · 1232 阅读 · 0 评论 -
卡塔兰数(Catalan)
卡塔兰数(Catalan)原理:令h(0)=1,h(1)=1。卡塔兰数满足递推式:h(n)=h(0)*h(n-1)+h(1)*h(n-2) + ... + h(n-1)h(0)(n>=2)例如:h(2)=h(0)*h(1)+h(1)*h(0)=1*1+1*1=2h(3)=h(0)*h(2)+h(1)*h(1)+h(2)*h(0)=1*2+1*1+2*1=5另原创 2014-07-31 16:23:26 · 861 阅读 · 0 评论 -
hdu 1018 Big Number
Big NumberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25567 Accepted Submission(s): 11600Problem DescriptionIn many appli原创 2014-08-01 09:14:47 · 788 阅读 · 0 评论 -
hdu 1593 find a way to escape
find a way to escapeTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1374 Accepted Submission(s): 501Problem Description一日,话说0原创 2014-08-01 16:17:42 · 742 阅读 · 0 评论 -
hdu 2067 小兔的棋盘
小兔的棋盘Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2374 Accepted Submission(s): 1393Problem Description小兔的叔叔从外面旅游回来给她带来了一个礼物,小兔原创 2014-07-31 15:52:10 · 854 阅读 · 0 评论 -
poj 2478 Farey Sequence
Farey SequenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11996 Accepted: 4657DescriptionThe Farey Sequence Fn for any integer n with n >= 2 is the原创 2014-07-30 22:02:24 · 591 阅读 · 0 评论 -
快速幂取模
快速幂取模算法在网站上一直没有找到有关于快速幂算法的一个详细的描述和解释,这里,我给出快速幂算法的完整解释,用的是C语言,不同语言的读者只好换个位啦,毕竟读C的人较多~所谓的快速幂,实际上是快速幂取模的缩写,简单的说,就是快速的求一个幂式的模(余)。在程序设计过程中,经常要去求一些大数对于某个数的余数,为了得到更快、计算范围更大的算法,产生了快速幂取模算法。[有读者反映在讲转载 2014-08-01 20:25:51 · 574 阅读 · 0 评论 -
hdu 2817 A sequence of numbers
A sequence of numbersTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3284 Accepted Submission(s): 986Problem DescriptionXinlv原创 2014-08-01 19:39:18 · 634 阅读 · 0 评论 -
poj 2084 Game of Connections
Game of ConnectionsTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 7413 Accepted: 3753DescriptionThis is a small but ancient game. You are supposed to w原创 2014-07-31 21:05:38 · 655 阅读 · 0 评论 -
hdu 2086 A1 = ?
A1 = ?Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4682 Accepted Submission(s): 2990Problem Description有如下方程:Ai = (Ai-1 + Ai原创 2014-06-09 21:14:58 · 852 阅读 · 0 评论 -
hdu 1019 Least Common Multiple
Least Common MultipleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 28917 Accepted Submission(s): 10881Problem DescriptionThe原创 2014-05-24 20:51:37 · 656 阅读 · 0 评论 -
hdu 1452 Happy 2004
Happy 2004Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 983 Accepted Submission(s): 700Problem DescriptionConsider a positi原创 2014-08-12 15:59:36 · 682 阅读 · 0 评论