初等数论
丿残念灬
这个作者很懒,什么都没留下…
展开
-
POJ-1061 青蛙的约会(扩展欧几里得)
青蛙的约会 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 107260 Accepted: 21395 Description 两只青蛙在网上相识了,它们聊得很开心,于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上,于是它们约定各自朝西跳,直到碰原创 2016-08-21 00:08:18 · 312 阅读 · 0 评论 -
Codeforces-839D Winter is here(容斥原理)
D. Winter is here time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output Winter is here at the North and the White原创 2017-08-21 17:27:39 · 599 阅读 · 0 评论 -
HDU-6102 GCDispower(莫比乌斯函数+树状数组)
传送门:HDU-6102 题解:莫比乌斯函数+树状数组+离线操作 先对查询按R升序排序,从左到右枚举Ak,再枚举A1~Ak-1中Ak的倍数(因为是1~n的全排列,因此总枚举量为nlogn),得到B数组,将B数组中的数都除以Ak,并按照A中的下标从小到大排序,然后只要求B中所有GCD(Bi,Bj)==1(i 求二元组个数可以直接用莫比乌斯函数求得,对于Bi对答案的贡献为cnt[下标大于i且与B原创 2017-08-12 00:45:48 · 415 阅读 · 0 评论 -
Codeforces-837E Vasya's Function(gcd)
E. Vasya's Function time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Vasya is studying number theory. He has原创 2017-08-04 13:13:19 · 680 阅读 · 0 评论 -
HDU-5943 Kingdom of Obsession(数学+二分图匹配)
Kingdom of Obsession Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1202 Accepted Submission(s): 368 Problem Description There is a原创 2017-07-18 20:06:56 · 519 阅读 · 0 评论 -
HDU-5512 Pagodas(GCD+找规律)
Pagodas Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 950 Accepted Submission(s): 676 Problem Description n pagodas were sta原创 2016-09-22 22:22:02 · 753 阅读 · 0 评论 -
HDU-5584 LCM Walk(GCD/LCM+找规律)
LCM Walk Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1005 Accepted Submission(s): 525 Problem Description A frog has just le原创 2016-09-22 23:37:17 · 1663 阅读 · 0 评论 -
HDU-5512 Pagodas(GCD)(2015ACM/ICPC亚洲区沈阳站-重现赛)
Pagodas Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 921 Accepted Submission(s): 654 Problem Description n pagodas were sta原创 2016-09-16 23:46:41 · 548 阅读 · 0 评论 -
SPOJ FACVSPOW(数论+二分)
传送门:http://www.spoj.com/problems/FACVSPOW/en/ 题意:给出一个数a,要求找到最小的n使得n!>a^n 题解:先将不等式两边取对数得到ln(1)+ln(2)+...+ln(n)>nln(a) 可以发现a #include using namespace std; const int MX = 3e6 + 5; double sum[MX]; voi原创 2017-02-25 16:33:39 · 581 阅读 · 0 评论 -
LightOJ-1105 Fi Binary Number(斐波那契数列)
F - Fi Binary Number Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu Submit Status Practice LightOJ 1105 uDebug Description A Fi-binary number is a number th原创 2016-10-19 14:57:21 · 412 阅读 · 0 评论 -
LightOJ-1165 Digit Dancing(BFS+康托展开)
B - Digit Dancing Time Limit:3000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu Submit Status Practice LightOJ 1165 uDebug Description Digits like to dance. One day, 1, 2,原创 2016-10-19 14:47:41 · 368 阅读 · 0 评论 -
LightOJ-1117 Helping Cicada(容斥定理)
A - Helping Cicada Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu Submit Status Practice LightOJ 1117 uDebug Description Cicada is an insect with large tran原创 2016-10-19 14:42:56 · 614 阅读 · 0 评论 -
CodeForces-492E Vanya and Field(思维题/最小公倍数)
传送门:http://codeforces.com/problemset/problem/492/E 题意:有一个n*n的矩阵,在矩阵中有m颗苹果树,一个人移动的单位向量为(dx,dy),且dx,dy与n互质,每次移动后的位置是((x+dx)%n,(y+dy)%n),当走到一个走过的点时停止, 问起点在哪个点时,走过的苹果树最多 题解:首先最重要的条件就是gcd(n,dx)=gcd(原创 2016-08-16 23:43:44 · 441 阅读 · 0 评论 -
CodeForces-711E ZS and The Birthday Paradox(勒让德定理+抽屉原理)
E. ZS and The Birthday Paradox time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output ZS the Coder has recently fo原创 2016-09-04 22:33:29 · 514 阅读 · 0 评论 -
Codeforces-869C The Intriguing Obsession(DP/组合数)
传送门:CF-869C 题意:有3个集合,其中元素分别有a、b、c个,且元素之间各不相同,元素之间可以连一条边,连边后相同集合的元素之间的距离不能小于3(当然相同集合的元素之间不能连边),问连边的方案数 题解: 首先只考虑2个集合的情况: dp[i][j]:集合A,B的元素分别有i个和j个时的方案数 向集合A新增一个元素时(设这一个元素为i),如果i不与任何点连线,则方案数为dp[i][原创 2017-10-18 01:10:57 · 487 阅读 · 0 评论