初等数论
码动传奇
业精于勤,荒于嬉;行成于思,毁于随。
展开
-
三角形面积
题目67三角形面积时间限制:3000 ms | 内存限制:65535 KB难度:2描述给你三个点,表示一个三角形的三个顶点,现你的任务是求出该三角形的面积输入每行是一组测试数据,有6个整数x1,y1,x2,y2,x3,y3分别表示三个点的横纵坐标。(坐标值都在0到10000之间)输入0 0 0 0 0 0表示输入结束测试数据不超过10000组输出原创 2014-04-06 11:51:50 · 890 阅读 · 0 评论 -
hdu 2096 小明A+B
hdu 2096 小明A+BTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 25316 Accepted Submission(s): 12030Problem Description小明今年3岁了,原创 2014-07-31 22:45:41 · 692 阅读 · 0 评论 -
hdu 1395 2^x mod n = 1
hdu 1395 2^x mod n = 1Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11835 Accepted Submission(s): 3684Problem DescriptionGi原创 2014-07-31 22:57:27 · 632 阅读 · 0 评论 -
hdu 1950 Bridging signals
Bridging signalsTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 618 Accepted Submission(s): 405Problem Description'Oh no, they've原创 2014-08-08 22:50:43 · 664 阅读 · 0 评论 -
NYOJ 105 九的余数
/*九的余数时间限制:3000 ms | 内存限制:65535 KB难度:3描述现在给你一个自然数n,它的位数小于等于一百万,现在你要做的就是求出这个数整除九之后的余数。输入第一行有一个整数m(1随后m行每行有一个自然数n。输出输出n整除九之后的余数,每次输出占一行。样例输入345465456541样例输出454*/原创 2014-07-27 11:56:37 · 518 阅读 · 0 评论 -
hdu 1021 Fibonacci Again
Fibonacci AgainTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 36549 Accepted Submission(s): 17648Problem DescriptionThere are an原创 2014-08-13 10:42:19 · 665 阅读 · 1 评论 -
hdu 2049 不容易系列之(4)——考新郎
不容易系列之(4)——考新郎Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 22154 Accepted Submission(s): 8177Problem Description国庆期间,省城HZ刚刚举行了原创 2014-10-08 09:56:25 · 698 阅读 · 0 评论 -
hdu 1013 Digital Roots
Digital RootsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 50128 Accepted Submission(s): 15638Problem DescriptionThe digital ro原创 2014-10-28 09:53:36 · 526 阅读 · 0 评论 -
hdu 1023 Train Problem II
Train Problem IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5945 Accepted Submission(s): 3236Problem DescriptionAs we all kno原创 2014-10-11 21:19:17 · 647 阅读 · 0 评论 -
HDU 2068 RPG的错排 【错排+排列组合】
RPG的错排Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7585 Accepted Submission(s): 3089Problem Description今年暑假杭电ACM集训队第一次组成女生队,其中原创 2014-11-02 00:39:32 · 585 阅读 · 0 评论 -
hdu 1163 Eddy's digital Roots
Eddy's digital RootsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4646 Accepted Submission(s): 2590Problem DescriptionThe digit原创 2014-10-14 19:37:09 · 674 阅读 · 0 评论 -
HDU 3501 alculation 2 【欧拉函数】
Calculation 2Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2379 Accepted Submission(s): 1003Problem DescriptionGiven a positive原创 2014-11-29 21:42:00 · 607 阅读 · 0 评论 -
hdu 1019 Least Common Multiple
hdu 1019 Least Common MultipleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 29850 Accepted Submission(s): 11285Problem Descri原创 2014-07-30 21:35:31 · 564 阅读 · 0 评论 -
hdu 1999 不可摸数
hdu 1999 不可摸数Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8274 Accepted Submission(s): 2122Problem Descriptions(n)是正整数n的真因原创 2014-07-30 21:34:44 · 637 阅读 · 0 评论 -
Triangular Sums
#include#includeint main(){ int i,m,len; char s[55]; while(~scanf("%s %d",s,&m)){ len = strlen(s); for(i=0; i s[i] -= m; if(s[i] s[i] += 26;原创 2014-04-26 20:20:45 · 701 阅读 · 0 评论 -
hdu 1060 Leftmost Digit
Leftmost DigitTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12912 Accepted Submission(s): 4943Problem DescriptionGiven a positive原创 2014-07-27 16:17:22 · 485 阅读 · 0 评论 -
A*B Problem II
题目623A*B Problem II时间限制:1000 ms | 内存限制:65535 KB难度:1描述ACM的C++同学有好多作业要做,最头痛莫过于线性代数了,因为每次做到矩阵相乘的时候,大量的乘法都会把他搞乱,所以他想请你写个程序帮他检验一下计算结果是否正确。输入有多组测试数据,每行给出一组m,n,k(0矩阵A:m行n列。矩阵B:n行k列。原创 2014-04-27 09:44:46 · 633 阅读 · 0 评论 -
NYOJ 205 求余数
NYOJ-205 求余数 求余数时间限制:1000 ms | 内存限制:65535 KB难度:3 描述现在给你一个自然数n,它的位数小于等于一百万,现在你要做的就是求出这个数除10003之后的余数 输入第一行有一个整数m(1随后m行每行有一个自然数n。 输出 输出n整除10003之后的余数,每次输出占一行。 样例输入 34原创 2014-07-27 12:14:50 · 601 阅读 · 0 评论 -
hdu 2091 空心三角形
hdu 2091 空心三角形Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 24680 Accepted Submission(s): 6820Problem Description把一个字符三角形掏空,就能节原创 2014-08-01 22:51:12 · 760 阅读 · 0 评论 -
hdu 2036 改革春风吹满地
hdu 2036 改革春风吹满地Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18534 Accepted Submission(s): 9482Problem Description“ 改革春风吹满原创 2014-08-01 22:33:02 · 576 阅读 · 0 评论 -
hdu 1249 三角形
hdu 1249 三角形Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4783 Accepted Submission(s): 3267Problem Description用N个三角形最多可以把平面原创 2014-08-01 22:55:22 · 782 阅读 · 0 评论 -
hdu 1061 Rightmost Digit
Rightmost DigitTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 31559 Accepted Submission(s): 12070Problem DescriptionGiven a原创 2014-07-28 22:46:48 · 544 阅读 · 0 评论 -
hdu 1918 GCD Again
求出小于N且与N互质的数的个数,结果为:N-1-euler(N)。单独求欧拉函数的模版:#includeint eular(int n){ int ret=1,i; for(i=2;i*i { if(n%i==0) { n/=i,ret*=i-1; whil原创 2014-07-27 11:59:12 · 537 阅读 · 0 评论 -
hdu 2588 GCD
/*错误代码:#includeint gcd(int a,int b){ return !b?a:gcd(b,a%b);}int main(){ int T; scanf("%d",&T); while(T--) { int i,n,m,count; scanf("%d %d"原创 2014-07-27 12:11:16 · 655 阅读 · 0 评论 -
hdu 1286 找新朋友
hdu 1286 找新朋友Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7441 Accepted Submission(s): 3899Problem Description新年快到了,“猪头帮协会原创 2014-07-29 22:59:22 · 554 阅读 · 0 评论 -
【编程之美】求最大公约数
//解法一:更相减损法BigInt(BigInt x,BigInt y){ if(x < y){ return gcd(y,x); } if(y==0) return x; else return gcd(x-y,y);//gcd(y-x,y)}//解法二:辗转相除法int gcd(int x, int y){ return !b ? a:gcd(b,a%b);}原创 2015-11-21 11:27:00 · 357 阅读 · 0 评论