整理的算法模板合集: ACM模板
题单链接:我是传送门
Part 6.2 整除相关
与整除相关的概念有很多,比较常用的有素数,最大公约数和欧拉函数。
Part 6.2.1 素数
素数,指的是除 1 和它本身之外没有其他约数的数。
P4718 【模板】Pollard-Rho算法
直接上模板
#include <bits/stdc++.h>
using namespace std;
#define rg register
#define RP(i,a,b) for(register int i=a;i<=b;++i)
#define DRP(i,a,b) for(register int i=a;i>=b;--i)
#define fre(z) freopen(z".in","r",stdin),freopen(z".out","w",stdout)
typedef long long ll;
typedef double db;
#define lll __int128
template<class type_name> inline type_name qr(type_name sample) {
type_name ret = 0, sgn = 1;
char cur = getchar();
while (!isdigit(cur))
sgn = (cur == '-' ? -1 : 1), cur = getchar();
while (isdigit(cur))
ret = (ret << 1) + (ret << 3) + cur - '0', cur = getchar();
return sgn == -1 ? -ret : ret;
}
ll max_factor;
inline ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
inline ll qp(ll x, ll p, ll mod) {
ll ans = 1;
while (p) {
if (p & 1)
ans = (lll)ans * x % mod;
x = (lll)x * x % mod;
p >>= 1;
}
return ans;
}
inline bool mr(ll x, ll b) {
ll k = x - 1;
while (k) {
ll cur = qp(b, k, x);
if (cur != 1 && cur != x - 1)
return false;
if ((k & 1) == 1 || cur == x - 1)
return true;
k >>= 1;
}
return true;
}
inline bool prime(ll x) {
if (x == 46856248255981ll || x < 2)
return false;
if (x == 2 || x == 3 || x == 7 || x == 61 || x == 24251)
return true;
return mr(x, 2) && mr(x, 61);
}
inline ll f(ll x, ll c, ll n) {
return