数论
文章平均质量分 85
码代码的猿猿的AC之路
人一我百,人十我万追逐青春的梦想,怀着自信的心,永不放弃
展开
-
CodeForces 374A. Divisible by Seven
构造。。。。A. Divisible by Seventime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou have number a,原创 2013-12-25 11:21:02 · 1444 阅读 · 0 评论 -
POJ 2800 Joseph's Problem
给n 和 k 求: ∑1(k mod i). p = k/ik mod i = k - p * ik mod ( i + 1 ) = k - p * ( i + 1 ) = k mod i - pk mod ( i + 2 ) = k - p * ( i + 2 ) = k mod i - 2 * p对于连续的 i ,很多p都是一样的 . 相差的部分是一个等差数列 ,原创 2015-02-02 15:57:20 · 1132 阅读 · 0 评论 -
UVA 11440 Help Mr. Tomisu 欧拉phi函数
欧拉phi函数的改进版.....Help TomisuTime Limit: 7000MSMemory Limit: Unknown64bit IO Format: %lld & %lluSubmit StatusDescriptionProblem DHelp Mr. TomisuInpu原创 2015-02-03 14:18:14 · 1014 阅读 · 0 评论 -
UVA10214 Trees in a Wood. 欧拉phi函数
只看某一个象限 能看到的数 == 一个 象限*4+4能看到的树既距离原点的距离 gcd(x,y)==1a 和 b 一大一小 预处理2000以内的phi函数,枚举小的一条边从1...a 与 a gcd 为 1 的数的个数就是 phi(a)从 1+a ... 2*a 与 a gcd 为 1 的数的个数 因为 GCD(i,a) = GCD(i+a,a) 所以还是 phi(a)...原创 2015-02-03 23:46:21 · 1166 阅读 · 0 评论 -
UVA 1642 Magical GCD 暴力+簡單數論
枚舉右端點,往前查找左端點....右端點一定的話,最多只有log個不同的gcd值,用一個數組記錄不同的GCD的值,對每個相同的GCD值記錄一下最靠左的位置...因爲GCD值不是很多所以 移動右端點時暴力統計即可..對與樣例:30 60 20 20 20從第1個數座右端點開始枚舉 // (gcd,位置)(30,1)枚舉以第2個數做爲右端點(30,1) (原创 2015-02-04 14:47:18 · 1734 阅读 · 1 评论 -
HDOJ 5150 Sum Sum Sum Miller_Rabin
很少有这么裸的题目,测一下Miller_RabinSum Sum SumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 72 Accepted Submission(s): 52Proble原创 2014-12-27 22:19:04 · 1085 阅读 · 0 评论 -
SPOJ VLATTICE - Visible Lattice Points 莫比乌斯反演
VLATTICE - Visible Lattice Pointsno tags Consider a N*N*N lattice. One corner is at (0,0,0) and the opposite one is at (N,N,N). How many lattice points are visible from corner at (0,0,0)原创 2015-03-26 22:16:56 · 1148 阅读 · 0 评论 -
HDOJ 1695 GCD phi函数+容斥原理
既求gcd(b/k,d/k)==1的组合的个数,设B=b/k D=d/k 且 B考虑从D中取一个数如果在1~B这部分可由欧拉phi函数求得,若在B+1~D这部分,可以用容斥原理求得.GCDTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Tota原创 2015-03-27 12:04:28 · 877 阅读 · 0 评论 -
Codeforces 487C. Prefix Product Sequence 逆元+构造
题意:对于数字n, 问是否存在1~n的一个排列 使这个排列的每一个前缀的乘积模上n 可以是0~n-1的一个排列解析:通过观察1肯定要在首位,n一定要在最后构造 a[i]=i*inv[i-1] , 这样用逆元把前面每个数的影响都消除掉C. Prefix Product Sequencetime limit per test1 s原创 2015-03-12 20:38:28 · 842 阅读 · 0 评论 -
HDOJ 4549 M斐波那契数列 费马小定理+矩阵快速幂
MF( i ) = a ^ fib( i-1 ) * b ^ fib ( i ) ( i>=3)mod 1000000007是质数 , 根据费马小定理 a^phi( p ) = 1 ( mod p ) 这里 p 为质数 且 a 比 p小 所以 a^( p - 1 ) = 1 ( mod p )所以对很大的指数可以化简 a ^ k % p == a ^ ( k %(p-1)原创 2015-03-13 00:06:42 · 1296 阅读 · 0 评论 -
POJ 3243 Clever Y BSGS
Clever YTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 6861 Accepted: 1676DescriptionLittle Y finds there is a very interesting formula in mathematic原创 2015-03-31 20:13:14 · 1159 阅读 · 2 评论 -
POJ 2417 Discrete Logging BSGS
Discrete LoggingTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 4011 Accepted: 1849DescriptionGiven a prime P, 2 31, an integer B, 2 BL == N (mo原创 2015-03-31 20:00:50 · 780 阅读 · 0 评论 -
HDOJ 5184 Brackets 卡特兰数扩展
既求从点(0,0)只能向上或者向右并且不穿越y=x到达点(a,b)有多少总走法...有公式: C(a+b,min(a,b))-C(a+b,min(a,b)-1) /// 折纸法证明卡特兰数: http://blog.sina.com.cn/s/blog_6917f47301010cno.htmlBracketsTime Limit: 2000/1000 MS原创 2015-03-19 00:30:42 · 957 阅读 · 0 评论 -
HDOJ 4579 Random Walk 解方程
Random WalkTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 65535/65536 K (Java/Others)Total Submission(s): 200 Accepted Submission(s): 117Problem DescriptionYuanfang is walk原创 2015-05-06 10:42:16 · 844 阅读 · 0 评论 -
UVA 10294 Arif in Dhaka (First Love Part 2) Polya计数
题目链接Polya计数入门题10294 Arif in Dhaka (First Love Part 2)Our hero Arif is now in Dhaka (Look at problem 10244 – First Love if you want to know more about Arif, but that information is not necessary for th原创 2015-05-06 17:13:13 · 828 阅读 · 0 评论 -
HDOJ 5297 Y sequence 容斥原理
Y sequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1174 Accepted Submission(s): 260Problem DescriptionYellowstar likes原创 2015-08-09 17:40:07 · 582 阅读 · 0 评论 -
HDOJ 5381 The sum of gcd 莫队算法
大神题解:http://blog.csdn.net/u014800748/article/details/47680899The sum of gcdTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 526原创 2015-08-16 13:38:47 · 803 阅读 · 0 评论 -
HDOJ 5392 Infoplane in Tina Town LCM
找循环节,分解质因数,求LCMInfoplane in Tina TownTime Limit: 14000/7000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 1627 Accepted Submission(s): 380Pro原创 2015-08-17 16:30:43 · 767 阅读 · 0 评论 -
UVA 10820 Send a Table euler_phi函数
除1,1外其他的x,y都不相等对于 xF[x]= phi(i) 2结果为 2*F[x]+1Problem ASend a TableInput: Standard InputOutput: Standard Output When participating in programming contests, you sometimes face the fo原创 2014-11-19 10:57:04 · 1172 阅读 · 0 评论 -
POJ 2167 Irrelevant Elements 质因数分解
Irrelevant ElementsTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 2231 Accepted: 550Case Time Limit: 2000MSDescriptionYoung cryptoanalyst Georgie原创 2014-11-19 09:43:05 · 980 阅读 · 0 评论 -
Codeforces 385 C. Bear and Prime Numbers
把求和混到求素数里就快多了。。。。C. Bear and Prime Numberstime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputRecent原创 2014-01-25 03:00:26 · 2489 阅读 · 0 评论 -
SERC 2013 A: Beautiful Mountains
http://acm.hunnu.edu.cn/online/?action=problem&type=show&id=114416482 - Beautiful MountainsTime limit: 3.000 seconds一顿乱优化。。。。#include #include #include #include原创 2014-03-19 18:53:24 · 1547 阅读 · 0 评论 -
Codefoces 432 C. Prime Swaps
歌德巴赫猜想:任一大于2的偶数,都可表示成两个素数之和。任一大于5的整数都可写成三个质数之和。贪心取尽可能大的素数.....C. Prime Swapstime limit per test2 secondsmemory limit per test256 megabytesinputsta原创 2014-05-23 22:15:41 · 1395 阅读 · 0 评论 -
Codeforces 155 D. Colliders
素数分解+暴力D. Colliderstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputBy 2312 there were n Large Ha原创 2014-08-02 17:37:40 · 1226 阅读 · 0 评论 -
【转】逆元的几种求法
点击打开链接 定义 a * x = 1(mod p), 求x1、扩展欧几里德: 令ax + py = 1Gcd的本质就是进行迭代,不断缩小范围。不详细讲。。参考:http://baike.baidu.com/view/1478219.htm 2、根据费马小定理:若(a,p)互质,且p为质数: 则 a ^ (转载 2014-08-10 17:09:52 · 1176 阅读 · 0 评论 -
HDOJ 3037 Saving Beans
假设有n+1个树,第n+1个树埋不足m的种子,隔板法C【n+m】【m】大组合数取mod用Lucas定理:Lucas(n,m,p) = C[n%p][m%p] × Lucas(n/p,m/p,p) ;Saving BeansTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K原创 2014-08-10 17:57:57 · 1238 阅读 · 0 评论 -
HDOJ 3944 DP?
尽量沿着边走距离最短,化减后 C(n+1,k)+ n - k,预处理阶乘,Lucas定理组合数取模DP?Time Limit: 10000/3000 MS (Java/Others) Memory Limit: 128000/128000 K (Java/Others)Total Submission(s): 1899 Accepted Submissi原创 2014-08-11 00:37:43 · 1140 阅读 · 0 评论 -
HDOJ 4983 Goffi and GCD
题意:给你 N 和 K,问有多少个数对满足 gcd(N-A, N) * gcd(N - B, N) = N^K分析:由于 gcd(a, N) 2 都是无解,K=2 只有一个解 A=B=N,只要考虑 K = 1 的情况就好了其实上式和这个是等价的 gcd(A, N) * gcd(B, N) = N^K,我们枚举 gcd(A, N) = g,那么gcd(B, N) = N / g。问题转化为原创 2014-08-25 16:15:54 · 1124 阅读 · 0 评论 -
HDOJ 5019 Revenge of GCD
第k大GCD = GCD/第K大因子Revenge of GCDTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 877 Accepted Submission(s): 259Problem Desc原创 2014-09-22 00:24:27 · 1655 阅读 · 0 评论 -
HDOJ 4944 FSF’s game
http://blog.csdn.net/keshuai19940722/article/details/38519681不明真相的补一发。。。FSF’s gameTime Limit: 9000/4500 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s)原创 2014-08-13 21:34:36 · 1022 阅读 · 0 评论 -
HDOJ 4259 Double Dealing
找每一位的循环节,求lcmDouble DealingTime Limit: 50000/20000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1806 Accepted Submission(s): 622Problem De原创 2014-08-14 00:35:04 · 828 阅读 · 0 评论 -
UVA 11582 Colossal Fibonacci Numbers! 数学
n比较小,最多n*n就回出现循环节....Colossal Fibonacci Numbers!Time Limit: 1000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescription原创 2014-11-09 10:48:45 · 1380 阅读 · 0 评论 -
UVA10375 Choose and divide 质因数分解
质因数分解:Choose and divideTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescriptionProblem D: Choose and原创 2014-11-10 11:22:32 · 977 阅读 · 0 评论 -
HDOJ 2769 Disgruntled Judge 扩展GCD
扩展GCD:枚举a,扩展GCD求b,再暴力检查Disgruntled JudgeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 329 Accepted Submission(s): 142Pr原创 2014-11-09 23:20:15 · 1051 阅读 · 0 评论 -
UVA10791 Minimum Sum LCM 质因数分解
Minimum Sum LCMTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescription Minimum Sum LCM LCM (L原创 2014-11-10 13:40:45 · 800 阅读 · 0 评论 -
UVA 12716 GCD XOR
12716 GCD XORGiven an integer N, find how many pairs (A, B) are there such that: gcd(A, B) = A xor B where1 ≤ B ≤ A ≤ N.Here gcd(A, B) means the greatest common divisor of the numbers A and B. A原创 2014-11-10 15:50:03 · 1102 阅读 · 0 评论 -
HDOJ 4704 Sum 规律 欧拉定理
规律 欧拉定理:找规律 2^n-1 ,n 很大用欧拉定理SumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1465 Accepted Submission(s): 622Proble原创 2014-10-24 20:05:55 · 995 阅读 · 0 评论 -
HDOJ 4473 Exam 暴力枚举
所求的既 a*b*c暴力枚举a,b根据c计算结果ExamTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1316 Accepted Submission(s): 559Problem原创 2015-09-02 13:57:07 · 700 阅读 · 0 评论