摘要:
视频链接:https://www.bilibili.com/video/BV1mg411a7o2/ #include <iostream> #include <cstring> #include <algorithm> using namespace std; int exgcd(int a,int 阅读全文
摘要:
视频链接:https://www.bilibili.com/video/BV1rD4y1C7qg/ #include <iostream> #include <cstring> #include <algorithm> using namespace std; int exgcd(int a,int 阅读全文
摘要:
视频链接:https://www.bilibili.com/video/BV1bW4y1e7n9/ Luogu P4549 【模板】裴蜀定理 #include<iostream> #include<cmath> using namespace std; int n,a,s; int gcd(int 阅读全文
摘要:
视频链接:https://www.bilibili.com/video/BV1GG411n7tW/ HDU 2973 YAPTCHA #include <iostream> using namespace std; typedef long long LL; const int N = 100000 阅读全文
摘要:
视频链接:https://www.bilibili.com/video/BV1iN4y1K7ZN/ Luogu P5091 【模板】扩展欧拉定理 #include <iostream> using namespace std; typedef long long LL; int a,b,m,phi, 阅读全文
摘要:
视频链接:https://www.bilibili.com/video/BV1RD4y1i7PK/ #include<iostream> using namespace std; typedef long long LL; int a, p; int quickpow(LL a, int b, in 阅读全文
摘要:
视频链接:https://www.bilibili.com/video/BV1Te4y1C7DP/ #include <iostream> using namespace std; const int N = 1000010; int p[N], vis[N], cnt; int mu[N]; vo 阅读全文
摘要:
视频链接:https://www.bilibili.com/video/BV1sd4y1M74E/ #include <iostream> using namespace std; const int N = 1000010; int p[N], vis[N], cnt; //g[i]表示i的最小质 阅读全文
摘要:
视频链接:https://www.bilibili.com/video/BV1ft4y1A7mW/ #include <iostream> using namespace std; const int N = 1000010; int p[N], vis[N], cnt; int a[N]; //a 阅读全文
摘要:
视频链接:https://www.bilibili.com/video/BV1VP411p7Bs/ #include <iostream> using namespace std; const int N = 1e9+10; int phi(int n){ //试除法求欧拉函数 int res = 阅读全文