数论/欧几里得/中国剩余定理/gcd
等我学会后缀自动机
侠影之谜
展开
-
Codeforces Round #554 (Div. 2) (A,B,C)
题目链接:http://codeforces.com/contest/1152第一题(模拟)#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define ll long l...原创 2019-05-11 18:57:14 · 150 阅读 · 0 评论 -
ZOJ 3785 What day is that day? (指数循环定理+最小公倍数)
题目链接:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3785#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x...原创 2018-12-03 23:55:03 · 171 阅读 · 0 评论 -
2018-2019 ICPC, NEERC, Northern Eurasia Finals F Fractions (数论)
题目链接:http://codeforces.com/contest/1089#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define ll long long#def...原创 2018-12-06 07:37:53 · 468 阅读 · 0 评论 -
CodeForces 75C Modified GCD (二分+数论)
题目链接:http://codeforces.com/problemset/problem/75/C#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define ll long...原创 2018-11-25 06:20:00 · 205 阅读 · 0 评论 -
Gym 100548K Last Defence (辗转相除)
题目链接:http://codeforces.com/gym/100548/attachments#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define ll long ...原创 2018-11-23 23:47:40 · 207 阅读 · 0 评论 -
CodeForces 83D Numbers (数论+递归)*
题目链接:http://codeforces.com/problemset/problem/83/D#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define ll long...原创 2018-11-21 20:54:28 · 207 阅读 · 0 评论 -
HDU 2601 An easy problem I(基础数论)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2601#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define ll lon...原创 2018-11-21 19:35:52 · 147 阅读 · 1 评论 -
CodeForces 87C Interesting Game (博弈论+数论)*
#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define ll unsigned long long#define lrt int l,int r,int rt#defi...原创 2018-11-20 23:43:54 · 259 阅读 · 0 评论 -
Gym 101550E Exponial (欧拉降幂公式)
题目链接:http://codeforces.com/gym/101550/attachments#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define ll unsig...原创 2018-11-20 20:40:21 · 209 阅读 · 0 评论 -
Codeforces Round #538 (Div. 2)F Please, another Queries on Array? (数论+线段树+状态压缩)
题目链接:http://codeforces.com/contest/1114题目大意:查询结构,初始给定一个序列,支持两种操作,一种是 在区间上每个数都乘上一个x,一种是查询区间上每个数累乘后的结果的欧拉函数。题目分析: 这道题应该是 比较简单的,主要感觉还是考验代码功底吧。观察欧拉函数的性质即可,euler(n)=n*{因子乘积(1-1/p)}形式,打表发现...原创 2019-02-17 10:37:00 · 403 阅读 · 0 评论 -
CodeForces 623B Array GCD (数论+DP)*好题
题目链接:http://codeforces.com/problemset/problem/623/B题目大意:给定一个整数序列,给定两种操作,一种是删除一整段区间,一种是对一个指定的数修改成x+1,或者x-1,其中要求是操作一不能删除全部的序列且只能删除一段,操作二对每个数只能进行一次(不是操作只能进行一次,是对每个数~)题目分析: 这道题我是看了别人的思路才码出来...原创 2019-02-18 22:45:45 · 307 阅读 · 0 评论 -
HDU 1299 Diophantus of Alexandria (数论+思维)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1299题目大意要求求解满足1/x+1/y=1/n的二元组(x,y)解的个数。题目分析令y=n+k,那么式子变为我们只需要确定k的个数就可以得到解的个数,当然要去个重。问题转化为n*n的因子个数,这个个数有一半是重复的,当然n和n这一对不算。#include<...原创 2019-03-02 11:37:17 · 167 阅读 · 0 评论 -
POJ 2800 Joseph's Problem (数论分块)
最后是要求sigma k%i,i从1到n,转换为k-k/i*i,明显这个东西可以分块求,时间复杂度是根号级别的,即从i到k/(k/i)这个区间所对应的k/i都是一样的,然后变化的是i部分可以等差数列求和O(1)得出.#include<iostream>#include<cmath>#include<algorithm>using ...原创 2019-05-07 07:18:18 · 179 阅读 · 0 评论 -
CodeForces 582A GCD Table (分析状态+贪心)
题目链接:http://codeforces.com/problemset/problem/582/A题目大意给定一个序列的GCD table的乱序,GCDtable的定义十分简单形象,要求根据这个table 序列还原出原来的序列.题目分析我们可以发现,table中最大的一个数肯定是序列中的一个数,这样状态就可以根据当前情况缩减了!!假设我们已经得知前k个数...原创 2019-04-24 18:47:49 · 213 阅读 · 0 评论 -
Codeforces Round #552 (Div. 3)G Minimum Possible LCM (数论+优化枚举状态)
题目链接:http://codeforces.com/contest/1154题目大意给定一序列数,问其中两个数的lcm最小值是多少.题目分析这道题大致就是我最近一直想着的优化决策问题,或者说是优化枚举状态问题,所有答案候选集合明显过大了,要想办法优化,我们可以把每个数都丢到其所有因子的桶中试试看,如果对于同一个因子,有若干个数根据贪心的思想我们只要把前...原创 2019-05-01 22:21:19 · 153 阅读 · 0 评论 -
CodeForces 588B Duff in Love (数论)
题目链接:http://codeforces.com/problemset/problem/588/B题目大意给定x,要求在x的因数中找出最大的无平方数。题目分析纯水题,质因分解贪心下即可。#include<bits/stdc++.h>using namespace std;#define min(x,y) ((x)<(y)?(x):(y)...原创 2019-04-05 18:32:04 · 216 阅读 · 0 评论 -
CodeForces 592C The Big Race (高精度+数论)
题目链接:http://codeforces.com/problemset/problem/592/C题目大意给定一个长度的赛道,两个人分别每步只能走x步和y步,终点后全是深渊,两个人不会走到深渊中并且他们会走到最远的情况,假设终点长度是x,其两人比赛结果相同的,概率是多少,对于x取值1到p来说。题目分析这题思路不难就是高精度会出问题,因为数据范围所以要开无符号...原创 2019-04-05 18:28:33 · 335 阅读 · 0 评论 -
CodeForces 603B Moodular Arithmetic (数论循环节+欧拉定理)
题目链接:http://codeforces.com/problemset/problem/603/B题目大意给定一种函数关系,f(x*k%p)=k*f(x)%p,值域和定义域都是0到p-1,问这样的函数关系有多少种。题目分析这题是数论题,并且参杂些细节,首先对于0这个位置,如果k为1,那么有p种f(0),否则只有一种,那就是0,我们可以把0这个位置独立出来不难...原创 2019-04-05 17:35:07 · 198 阅读 · 0 评论 -
CodeForces 55D Beautiful numbers (数位DP+数论+打表规律)
题目链接:http://codeforces.com/problemset/problem/55/D题目大意给定L和R,求这个区间中满足条件的数的个数,条件为:该数可以整除每一位上非零的数。题目分析这道题我看题解思路的,刚接触数位DP,我觉得这道题应该是利用数论技巧来化简状态的题目。、首先分析状态,数位DP其状态的延展方式可能不方便用循环描述所以直接记忆化,关键是...原创 2019-03-21 23:21:12 · 108 阅读 · 0 评论 -
HDU 2824 The Euler function (水)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2824#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define ll lon...原创 2019-02-26 17:11:49 · 105 阅读 · 0 评论 -
HDU 5505 GT and numbers (数论gcd水题)*
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5505#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define ll uns...原创 2018-11-14 11:17:08 · 123 阅读 · 0 评论 -
Codeforces 483B Friends and Presents (二分+数论基础知识)
题目链接:http://codeforces.com/problemset/problem/483/B#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define ll lon...原创 2018-10-31 21:05:00 · 201 阅读 · 0 评论 -
牛客网多校1 A Monotonic Matrix(数论阶乘逆元+组合数学不相交路径定理)
链接:https://www.nowcoder.com/acm/contest/139/A来源:牛客网 题目描述Count the number of n x m matrices A satisfying the following condition modulo (109+7).* Ai, j ∈ {0, 1, 2} for all 1 ≤ i ≤ n, 1 ≤ j ≤ m....原创 2018-07-22 18:02:57 · 305 阅读 · 0 评论 -
UVA 10375 选择与除法 (唯一分解性定理)
The binomial coefficient C(m,n) is defined asC(m,n) =m! (m−n)! n! Given four natural numbers p, q, r, and s, compute the the result of dividing C(p,q) by C(r,s).InputInput consists of a sequence of l...原创 2018-07-22 11:08:55 · 255 阅读 · 0 评论 -
UVA 11582 巨大的斐波那契数! (打表+周期规律)
The i’th Fibonacci number f(i) is recursively defined in the following way: • f(0) = 0 and f(1) = 1 • f(i + 2) = f(i + 1) + f(i) for every i ≥ 0 Your task is to compute some values of this sequence.In...原创 2018-07-22 10:23:29 · 712 阅读 · 0 评论 -
UVA 10820 交表 (欧拉函数简单应用)
When participating in programming contests, you sometimes face the following problem: You know how to calcutale the output for the given input values, but your algorithm is way too slow to ever pass t...原创 2018-07-26 12:20:45 · 123 阅读 · 0 评论 -
UVA 1635 无关的元素(杨辉三角+唯一分解性定理)
Young cryptoanalyst Georgie is investigating different schemes of generating random integer numbers ranging from 0 to m−1. He thinks that standard random number generators are not good enough, so he ha...原创 2018-07-26 11:16:16 · 309 阅读 · 0 评论 -
UVA 12716 GCD XOR (素数筛法思想+打表规律)
Given an integer N, nd 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. And A xor B is thev...原创 2018-07-24 23:50:47 · 207 阅读 · 0 评论 -
UVA 10791 最小公倍数的最小和(唯一分解性定理)
LCM (Least Common Multiple) of a set of integers is defined as the minimum number, which is a multiple of all integers of that set. It is interesting to note that any positive integer can be expressed ...原创 2018-07-23 22:22:58 · 545 阅读 · 0 评论 -
ZOJ 2305 C Looooops (扩展欧几里得模板题)
C Looooops Time Limit: 2 Seconds Memory Limit: 65536 KB A Compiler Myster...原创 2018-06-17 11:12:36 · 229 阅读 · 0 评论 -
2017 百度之星 初赛 A 小C的初等数论问题 (基础数论)
小C的倍数问题Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1609 Accepted Submission(s): 789 Problem Description根据小学数学的知识,我们知道一个正整数x是3的倍数的...原创 2018-08-11 05:24:13 · 165 阅读 · 0 评论 -
UVA 1363 约瑟夫的数论问题 (基础数论)
Joseph likes taking part in programming contests. His favorite problem is, of course, Joseph’s problem. It is stated as follows.There are n persons numbered from 0 to n - 1 standing in a circle. The ...原创 2018-08-11 08:21:30 · 181 阅读 · 0 评论 -
UVA 10214 Trees in a Wood.(欧拉函数+规律)
The saying “You can’t see the wood for the trees” is not only a cliche, but is also incorrect. The real problem is that you can’t see the trees for the wood. If you stand in the middle of a wood, the ...原创 2018-08-15 18:44:02 · 324 阅读 · 0 评论 -
HDU 4662 MU Puzzle (基础数论)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4662#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define read(x...原创 2018-10-13 07:57:53 · 159 阅读 · 0 评论 -
HDU 5512 Pagodas (数论水题)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5512#include<bits/stdc++.h>#pragma comment(linker,"/STACK:1024000000,1024000000")using namespace std;#define debug puts("YES");#define rep(...原创 2018-09-06 18:59:09 · 153 阅读 · 0 评论 -
沈阳网络赛 C Convex Hull (莫比乌斯反演+推公式+快速乘)*
题目链接:https://nanti.jisuanke.com/t/31444#include<bits/stdc++.h>#pragma comment(linker,"/STACK:1024000000,1024000000")using namespace std;#define debug puts("YES");#define rep(x,y,z) for(i...原创 2018-09-09 08:38:16 · 493 阅读 · 0 评论 -
ACM-ICPC 2018 南京赛区网络预赛 A An Olympian Math Problem (简单数论题)
Alice, a student of grade 666, is thinking about an Olympian Math problem, but she feels so despair that she cries. And her classmate, Bob, has no idea about the problem. Thus he wants you to help him...原创 2018-09-01 21:57:07 · 272 阅读 · 0 评论 -
ACM-ICPC 2018 南京赛区网络预赛 J.Sum (欧拉筛的应用+DP思维)
题目链接:https://nanti.jisuanke.com/t/30999#pragma comment(linker, "/STACK:102400000,102400000")#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(in...原创 2018-09-01 21:25:27 · 936 阅读 · 0 评论 -
HDU 5514 Frogs (容斥思想+数论知识)*
Frogs Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 4142 Accepted Submission(s): 1396 Problem Description There are ...原创 2018-08-25 08:04:35 · 178 阅读 · 0 评论 -
HDU 6440 Dream (数论常识题)
Dream Time Limit: 12000/6000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 882 Accepted Submission(s): 111Special Judge Problem Description ...原创 2018-08-26 11:02:20 · 327 阅读 · 2 评论