数论篇
数论篇
桑榆207
在最终的结果到来之前,任何肯定会赢之类的话都是虚无缥缈的。
展开
-
51NOD 1181 质数中的质数(质数筛法) 线性筛
思路:在筛法的过程中,判断当前第i个素数x,看i是不是素数,看x是不是大于等于n。代码:#include<iostream>#include<algorithm>#define rep(i,a,b) for(int i=a;i<=b;i++)#define dep(i,a,b) for(int i=a;i>=b;i--)#define LL...原创 2020-03-11 20:14:24 · 157 阅读 · 1 评论 -
CF--839EMother of Dragons--容斥原理+数学+算贡献
There arencastles in the Lannister's Kingdom and some walls connect two castles, no two castles are connected by more than one wall, no wall connects a castle to itself.Sir Jaime Lannister has dis...原创 2019-08-12 20:45:06 · 279 阅读 · 0 评论 -
HDU--5212Code--容斥原理+算贡献
Code Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1452Accepted Submission(s): 605 Problem Description WLD likes pl...原创 2019-08-14 20:24:25 · 139 阅读 · 0 评论 -
HDU5514-Frogs--容斥原理
题意有m个环形石子,编号为0...m-1,围成一个圆,距离为1,有n只青蛙,从0位置跳,每次跳跃的长度为ai,求它们所跳过的石子标号的和。思路设,那么第i个青蛙跳的标号的公差为gcdx,且小于m。多只青蛙之间会有重复计算,所以要用到容斥原理。其中一定是m的因子。先求出来m的因子,然后求出每一个因子的贡献,因为青蛙走过的路径一定是以m的因子为起点的。以因子x为起点,那么答案...原创 2019-11-04 21:22:38 · 166 阅读 · 0 评论 -
整数唯一分解+约数和公式
Consider two natural numbers A and B. Let S be the sum of all natural divisors of A^B. Determine S modulo 9901 (the rest of the division of S by 9901).InputThe only line contains the two natural n...原创 2019-02-11 21:38:37 · 336 阅读 · 0 评论 -
HDU1495 非常可乐 BFS||数论
http://acm.hdu.edu.cn/showproblem.php?pid=1495大家一定觉的运动以后喝可乐是一件很惬意的事情,但是seeyou却不这么认为。因为每次当seeyou买了可乐以后,阿牛就要求和seeyou一起分享这一瓶可乐,而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子,它们的容量分别是N 毫升和M 毫升 可乐的体积为S (S<101)毫升 ...原创 2019-02-09 12:41:38 · 158 阅读 · 0 评论 -
HDU5478 Can you find it 数学快速幂
http://acm.hdu.edu.cn/showproblem.php?pid=5478枚举a,b=第一个式子中所得数,验证即可。 Problem Description Given a prime number C(1≤C≤2×105) , and three integers k1, b1, k2 (1≤k1,k2,b1≤109) . Please find al...原创 2019-01-15 21:30:22 · 176 阅读 · 2 评论 -
牛客 斐波那契数列第几项
链接:https://ac.nowcoder.com/acm/contest/71/C来源:牛客网 题目描述小W在计算一个数列{An},其中A1=1,A2=2,An+2=An+1+An。尽管他计算非常精准,但很快他就弄混了自己的草稿纸,他找出了一些他计算的结果,但他忘记了这些都是数列中的第几项。输入描述: 每行包括数列中的一项Ak(k<=100000)。总行数...原创 2019-02-05 18:28:39 · 396 阅读 · 0 评论 -
HDU 4810 Wall Painting 组合数+位运算
Ms.Fang loves painting very much. She paints GFW(Great Funny Wall) every day. Every day before painting, she produces a wonderful color of pigments by mixing water and some bags of pigments. On the K-...原创 2019-02-05 11:50:06 · 173 阅读 · 0 评论 -
中国剩余定理以及互质非互质情况
https://www.cnblogs.com/MashiroSky/p/5918158.html互质#include<bits/stdc++.h># define ll long longusing namespace std;int extend_gcd(int a,int b,int &x,int &y){ if(b==0) {...原创 2019-02-01 20:07:07 · 204 阅读 · 0 评论 -
二进制中1的个数
int count(int n){ int s=0; while(n){ n=n&(n-1); s++; } return s;}#include<bits/stdc++.h>using namespace std;int count(int n){ int s=0; while(...原创 2019-02-03 13:50:33 · 120 阅读 · 0 评论 -
HDU多校--6608Fansblog--威尔逊定理推公式
Fansblog Time Limit: 2000/2000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 2579Accepted Submission(s): 1068 Problem Description Farmer ...原创 2019-09-21 11:00:48 · 135 阅读 · 0 评论 -
HDU--YAPTCHA--威尔逊定理
YAPTCHA Time Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1928Accepted Submission(s): 987 Problem Description The math ...原创 2019-09-22 09:15:59 · 133 阅读 · 0 评论 -
牛客挑战赛32--C斐波那契数列卷积 推公式+矩阵快速幂+逆元
链接:https://ac.nowcoder.com/acm/contest/1087/C来源:牛客网斐波那契数列卷积时间限制:C/C++ 1秒,其他语言2秒空间限制:C/C++ 524288K,其他语言1048576K64bit IO Format: %lld题目描述已知数列an=∑k=0nFn−k×Fka_n=\sum_{k=0}^{n}F_{n-k} \times...原创 2019-09-21 09:56:10 · 217 阅读 · 0 评论 -
Codeforces Round #565 (Div. 3)--D. Recover it!--思维+欧拉筛
D. Recover it!time limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAuthors guessed an arrayaaconsisting ofnnintegers; each intege...原创 2019-09-02 18:11:43 · 166 阅读 · 0 评论 -
HDU多校--6595--Everything Is Generated In Equal Probability--推公式+期望
Everything Is Generated In Equal Probability Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 791Accepted Submission(s): 583 ...原创 2019-09-17 22:05:09 · 291 阅读 · 0 评论