数论
文章平均质量分 77
KirinSB
这个作者很懒,什么都没留下…
展开
-
hdu2552 (浮点数复杂运算的四舍五入)题解
三足鼎立Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4632 Accepted Submission(s): 2680Problem DescriptionMCA山中人才辈出,洞悉外界战火纷纷,山中各路豪杰决定出山拯救百姓于水火,...原创 2018-02-25 15:12:08 · 218 阅读 · 0 评论 -
The equation (扩展欧几里得)题解
There is an equation ax + by + c = 0. Given a,b,c,x1,x2,y1,y2 you must determine, how many integer roots of this equation are satisfy to the following conditions : x1<=x<=x2, y1<=y<=y2. ...原创 2018-04-07 23:12:12 · 387 阅读 · 0 评论 -
C Looooops(扩展欧几里得)题解
A Compiler Mystery: We are given a C-language style for loop of type for (variable = A; variable != B; variable += C) statement;I.e., a loop which starts by setting variable to value A and while va...原创 2018-04-06 14:28:06 · 424 阅读 · 0 评论 -
POJ1061 青蛙的约会(扩展欧几里得)题解
青蛙的约会Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 124016 Accepted: 26479Description两只青蛙在网上相识了,它们聊得很开心,于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上,于是它们约定各自朝西跳,直到碰面为止。可是它们出发之前忘记了一件很重要的事情,既没有问清楚对方的特征,也没...原创 2018-04-06 13:34:07 · 674 阅读 · 0 评论 -
POJ1061 青蛙的约会(扩展欧几里得)题解
Description两只青蛙在网上相识了,它们聊得很开心,于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上,于是它们约定各自朝西跳,直到碰面为止。可是它们出发之前忘记了一件很重要的事情,既没有问清楚对方的特征,也没有约定见面的具体位置。不过青蛙们都是很乐观的,它们觉得只要一直朝着某个方向跳下去,总能碰到对方的。但是除非这两只青蛙在同一时间跳到同一点上,不然是永远都不可能碰面的。为了...原创 2018-07-09 23:31:51 · 163 阅读 · 0 评论 -
UVA 11426 GCD - Extreme (II) (欧拉函数)题解
思路:虽然看到题目就想到了用欧拉函数做,但就是不知道怎么做...当a b互质时GCD(a,b)= 1,由此我们可以推出GCD(k*a,k*b)= k。设ans[i]是1~i-1与i的GCD之和,所以最终答案是将ans[0]一直加到ans[n]。当 k*i==j 时,ans[j]=k*euler[i]。看完题解瞬间领悟:神奇海螺突然忘记欧拉函数是什么:欧拉函数代码:#include<cstdi...原创 2018-04-05 16:02:08 · 93 阅读 · 0 评论 -
Harmonic Number (调和级数+欧拉常数)题解
Harmonic NumberIn mathematics, the nth harmonic number is the sum of the reciprocals of the first n natural numbers:In this problem, you are given n, you have to find Hn.InputInput starts with an inte...原创 2018-04-02 21:29:19 · 655 阅读 · 0 评论 -
Pairs Forming LCM (LCM+ 唯一分解定理)题解
Pairs Forming LCMFind the result of the following code:long long pairsFormLCM( int n ) { long long res = 0; for( int i = 1; i <= n; i++ ) for( int j = i; j <= n; j++ ) if(...原创 2018-04-02 12:53:14 · 359 阅读 · 0 评论 -
Goldbach`s Conjecture(素筛水题)题解
Goldbach`s Conjecture Goldbach's conjecture is one of the oldest unsolved problems in number theory and in all of mathematics. It states:Every even integer, greater than 2, can be expressed as the sum...原创 2018-04-01 14:44:46 · 1788 阅读 · 0 评论 -
Leading and Trailing(数论/n^k的前三位)题解
Leading and Trailing You are given two integers: n and k, your task is to find the most significant three digits, and least significant three digits of nk.InputInput starts with an integer T (≤ 1000),...原创 2018-04-01 13:55:04 · 156 阅读 · 0 评论 -
lightoj 1341 Aladdin and the Flying Carpet(算术基本定理)题解
题意:给一个矩形(非正方形)面积a和最小边长b,要求边长均大于b,求这样的矩形有几个思路:先用到了之前学的质因数分解,还有一个新的公式:然后我们可以先算出a的所有约数,因为只算约数个数面积重复,所以要/2;然后暴力出<b的所有约数减去。技巧:1.用save[i]*save[i]<=temp剪枝 2.要注意判断出循环的ans是否大于1,如果大于1则表示还有一个素数没除尽,*2代码:#in...原创 2018-03-27 13:09:40 · 145 阅读 · 0 评论 -
Bi-shoe and Phi-shoe(欧拉函数/素筛)题解
Bi-shoe and Phi-shoeBamboo Pole-vault is a massively popular sport in Xzhiland. And Master Phi-shoe is a very popular coach for his success. He needs some bamboos for his students, so he asked his ass...原创 2018-03-25 17:17:58 · 302 阅读 · 0 评论 -
Max Factor(素数筛法)题解
Max FactorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10245 Accepted Submission(s): 3304Problem DescriptionTo improve the organization of...原创 2018-02-24 22:44:23 · 832 阅读 · 0 评论 -
Farey Sequence (素筛欧拉函数/水)题解
The Farey Sequence Fn for any integer n with n >= 2 is the set of irreducible rational numbers a/b with 0 < a < b <= n and gcd(a,b) = 1 arranged in increasing order. The first few are F2 =...原创 2018-04-09 11:55:00 · 159 阅读 · 0 评论