数论
文章平均质量分 69
Ritchie丶
这个作者很懒,什么都没留下…
展开
-
LightOJ 1236 - Pairs Forming LCM(素因子分解)
B - Pairs Forming LCMTime Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit Status Practice LightOJ 1236DescriptionFind the result of the following code:原创 2016-06-13 17:40:40 · 404 阅读 · 0 评论 -
Codeforces7C 扩展欧几里得
LineTime Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionA line on the plane is described by an equation Ax + By + C = 0.原创 2016-05-24 10:12:26 · 261 阅读 · 0 评论 -
POJ 1006 - Biorhythms (中国剩余定理)
B - BiorhythmsTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1006Description人生来就有三个生理周期,分别为体力、感情和智力周期,它们的周期长度为23天、28天和33天。每一个周期中有一原创 2016-05-24 10:12:22 · 237 阅读 · 0 评论 -
POJ 2478 Farey Sequence(欧拉函数前n项和)
A - Farey SequenceTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 2478DescriptionThe Farey Sequence Fn for any integer n with n >原创 2016-05-24 10:12:18 · 741 阅读 · 0 评论 -
LightOJ 1234 Harmonic Number
D - Harmonic NumberTime Limit:3000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit Status Practice LightOJ 1234DescriptionIn mathematics, the nth harmonic number is th原创 2016-05-24 10:12:02 · 307 阅读 · 0 评论 -
UVA 11827 Maximum GCD
F - Maximum GCDTime Limit:1000MS Memory Limit:0KB 64bit IO Format:%lld & %lluGiven the N integers, you have to nd the maximum GCD (greatest common divisor) of every possiblepair of these原创 2016-05-24 10:11:58 · 206 阅读 · 0 评论 -
HDU 1452 Happy 2004
G - Happy 2004Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1452DescriptionConsider a positive integer X,and let S be the sum o原创 2016-05-24 10:12:12 · 221 阅读 · 0 评论 -
LightOJ1336 Sigma Function(约数和为奇数的个数)
Sigma function is an interesting function in Number Theory. It is denoted by the Greek letter Sigma (σ). This function actually denotes the sum of all divisors of a number. For example σ(24) = 1+2+3+4原创 2016-05-24 10:11:54 · 213 阅读 · 0 评论 -
LightOJ 1197 Help Hanzo(区间素数筛选)
E - Help HanzoTime Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit Status Practice LightOJ 1197DescriptionAmakusa, the evil spiritual leader has captured th原创 2016-05-24 10:11:45 · 328 阅读 · 0 评论 -
数论四大定理
威尔逊定理、欧拉定理、孙子定理、费马小定理并称数论四大定理。威尔逊定理编辑若p为质数,则p可整除(p-1)!+1。欧拉定理欧拉定理,也称费马-欧拉定理。若n,a为正整数,且n,a互素,即gcd(a,n) = 1,则a^φ(n) ≡ 1 (mod n)孙子定理孙子定理,又称中国剩余定理。公元前后的《孙子算经》中有“物不知数”问题:“今有原创 2016-05-24 10:20:36 · 1417 阅读 · 0 评论 -
poj 1061 青蛙的约会 (扩展欧几里得模板)
青蛙的约会Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1061Description两只青蛙在网上相识了,它们聊得很开心,于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上,于是它们约定各自朝西原创 2016-05-24 10:21:32 · 232 阅读 · 0 评论 -
HDU 2588 GCD
GCDTime Limit: 1000MS Memory Limit: 32768KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionThe greatest common divisor GCD(a,b) of two positive integers a an原创 2016-05-24 10:12:30 · 278 阅读 · 0 评论 -
E sum
http://acm.hust.edu.cn/vjudge/contest/view.action?cid=110042#problem/E密码nefu#include #include using namespace std; const int MAXN = 1e5+5; const int MOD = 1e9+7; typedef long lo原创 2016-05-24 10:12:34 · 293 阅读 · 0 评论 -
HDU 5317 RGCDQ
RGCDQTime Limit: 3000MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionMr. Hdu is interested in Greatest Common Divisor (GCD).原创 2016-05-24 10:12:38 · 194 阅读 · 0 评论 -
关于一个群号分解的最大质数的求法
今天加群遇到了这个问题,百度有在线分解质因数的计算器,附上网址。http://www.atool.org/quality_factor.php?但是,一个ACMer要会利用百度,而不是依赖百度,这种简单的代码,自己也可以轻松搞定。#include #include using namespace std;int main(){ //不需要分解质因数 1组数原创 2016-05-24 10:19:17 · 1013 阅读 · 0 评论 -
HDU 4320 Arcane Numbers 1 (数论)
A - Arcane Numbers 1Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 4320DescriptionVance and Shackler like playing games. One day原创 2016-05-24 10:18:57 · 213 阅读 · 0 评论 -
HDU1286新朋友欧拉函数版
找新朋友Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10401 Accepted Submission(s): 5493Problem Description新年快到了,“猪头帮协会”准备搞一个聚会,已经知道现有会原创 2016-05-24 10:17:47 · 195 阅读 · 0 评论 -
Codeforces 389A (最大公约数)
Fox and Number GameTime Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionFox Ciel is playing a game with numbers now.Cie原创 2016-05-24 10:15:32 · 304 阅读 · 0 评论 -
NEFU 1151 特殊的质数
特殊的质数Problem:1151 Time Limit:1000msMemory Limit:65535KDescription如果一个数是质数,而且他在质数表中的编号也是质数,称为特殊的质数。比如质数表中第7个质数是17,因为7和17都是质数,所以我们称17是特殊的质数;比如第10个质数是29,因为10原创 2016-05-24 10:15:00 · 542 阅读 · 0 评论 -
CF GYM 100548 容斥原理+快速幂+逆元
Recently, Mr. Big recieved n owers from his fans. He wants to recolor those owers with m colors. Theowers are put in a line. It is not allowed to color any adjacent owers with the same color. Flowers原创 2016-05-24 10:13:50 · 365 阅读 · 0 评论 -
HDU 4059 容斥原理+快速幂+逆元
E - The Boss on MarsTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 4059DescriptionOn Mars, there is a huge company called ACM (A原创 2016-05-24 10:13:32 · 271 阅读 · 0 评论 -
HDU 2841 Visible Trees 数论+容斥原理
H - Visible TreesTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 2841DescriptionThere are many trees forming a m * n grid, the gr原创 2016-05-24 10:13:13 · 224 阅读 · 0 评论 -
HDU1695 GCD (欧拉函数+容斥原理)
F - GCDTime Limit:3000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1695DescriptionGiven 5 integers: a, b, c, d, k, you're to find x in a...b,原创 2016-05-24 10:13:03 · 208 阅读 · 0 评论 -
HDU 5651 xiaoxin juju needs help 逆元
xiaoxin juju needs helpTime Limit: 1000MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionAs we all known, xiaoxin is a brilliant coder. He knew **palindromic** strin原创 2016-05-24 10:12:57 · 217 阅读 · 0 评论 -
HDU 4549 (费马小定理+矩阵快速幂+二分快速幂)
M斐波那契数列Time Limit: 1000MS Memory Limit: 32768KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionM斐波那契数列F[n]是一种整数数列,它的定义如下: F[0] = a F[1] = b F[n] = F[n-1] * F原创 2016-05-24 10:22:00 · 298 阅读 · 0 评论