ACM模板 - 随笔分类 - xlinsist

势能线段树

摘要：The 2021 ICPC Asia Regionals Online Contest (II)，PTA #include <bits/stdc++.h> //#define endl '\n' #define lose {printf("NO\n");return;} #define win {p 阅读全文

posted @ 2021-09-30 11:42 xlinsist 阅读(63) 评论(0) 推荐(0)

矩阵快速幂

摘要：//https://nanti.jisuanke.com/t/A2022 #include <bits/stdc++.h> //#define endl '\n' #define lose {printf("NO\n");return;} #define win {printf("YES\n");r 阅读全文

posted @ 2020-09-28 16:55 xlinsist 阅读(77) 评论(0) 推荐(0)

SG函数博弈模板

摘要：just a template 阅读全文

posted @ 2020-09-27 22:21 xlinsist 阅读(111) 评论(0) 推荐(0)

c++ techniques

摘要：struct myComp { bool operator() (const int &a, const int &b) { if (ac[a]<ac[b]) return a; else if (ac[a]==ac[b]&&pen[a]>=pen[b]) return a; return fals 阅读全文

posted @ 2020-09-26 14:03 xlinsist 阅读(107) 评论(0) 推荐(0)

质因数分解统计

摘要：int divide(int number) { int tot = 0; for (int i = 2; i <= number; i++) { if (number % i == 0) { tot++; prime[tot] = i; while (number % i == 0) { prim 阅读全文

posted @ 2020-08-08 17:10 xlinsist 阅读(163) 评论(0) 推荐(0)

分块

摘要：LL fenkuai(LL k){ LL j; LL ans=0; for (LL i=1;i<=k;i=j+1){ j=n/(n/i); ans+=(j-i+1)%mod*((n/i)%mod)%mod; ans%=mod; } return ans; } 阅读全文

posted @ 2020-08-02 10:04 xlinsist 阅读(68) 评论(0) 推荐(0)

素数欧拉筛法

摘要：线性筛素数 int pnum=0; int pa[maxn]; bool pvis[maxn]; void prime_init() { memset(pvis,0,sizeof(pvis)); FOR(i,2,MAX) { if (!pvis[i]) { pvis[i]=1; pnum++; pa 阅读全文

posted @ 2020-06-06 14:11 xlinsist 阅读(143) 评论(0) 推荐(0)

优秀代码样板收集计划（python）

摘要：the Art of coding 阅读全文

posted @ 2020-05-02 14:25 xlinsist 阅读(221) 评论(0) 推荐(0)

数据结构：树的链式递归实现

摘要：指针阅读全文

posted @ 2020-04-27 23:28 xlinsist 阅读(226) 评论(0) 推荐(0)

kmp

摘要：字符串匹配kmp 阅读全文

posted @ 2020-04-18 16:04 xlinsist 阅读(124) 评论(0) 推荐(0)

hash

摘要：字符串hash 阅读全文

posted @ 2020-04-12 19:45 xlinsist 阅读(107) 评论(0) 推荐(0)

计算几何

摘要：点，距离，叉积阅读全文

posted @ 2020-04-05 23:07 xlinsist 阅读(100) 评论(0) 推荐(0)

tarjan

摘要：强联通分量，双联通分量阅读全文

posted @ 2020-03-24 23:43 xlinsist 阅读(158) 评论(0) 推荐(0)

换根dp

摘要："https://codeforces.com/contest/1324/problem/F" description you are given a tree, in which the vertices are all printed either black or white. , find 阅读全文

posted @ 2020-03-17 23:11 xlinsist 阅读(108) 评论(0) 推荐(0)

逆元与组合数

摘要：int add(int a,int b) { int c=(a+b); if (c>=mod) c-=mod; return c; } int mul(int a,int b) { ll c=1ll*a*b; return c-c/mod*mod; } int fpow(int x,int powe 阅读全文

posted @ 2020-03-14 23:11 xlinsist 阅读(179) 评论(0) 推荐(0)

数位dp

摘要：阅读全文

posted @ 2020-03-09 23:29 xlinsist 阅读(115) 评论(0) 推荐(0)

RMQ

摘要：1 D void initRMQ(int n) { int MAX=(int)log2(n); FOR(i,1,n) { f[i][0]=a[i]; } FOR(j,1,MAX) { FOR(i,1,n) if (i+(1<<(j-1))<=n) { f[i][j]=max(f[i][j-1],f[ 阅读全文

posted @ 2020-02-25 15:44 xlinsist 阅读(114) 评论(0) 推荐(0)

kruscal

摘要：``` #include using namespace std; const int maxn=2e5+10; int fi[maxn],ne[maxn],v[maxn],w[maxn]; struct re { int x,y,z; }; re a[maxn]; int fa[maxn]; int t=-1; bool cmp(re a,re b) { return a.z>n>>m; for 阅读全文

posted @ 2020-02-22 12:57 xlinsist 阅读(110) 评论(0) 推荐(0)

dijkstra

摘要：dijkstra 阅读全文

posted @ 2020-02-22 12:17 xlinsist 阅读(98) 评论(0) 推荐(0)

ORIGIN

摘要：ONE FOR ALL!! 阅读全文

posted @ 2020-02-19 12:16 xlinsist 阅读(155) 评论(0) 推荐(0)

xlinsist

随笔分类 - ACM模板