- 博客(122)
- 问答 (1)
- 收藏
- 关注
RSS订阅原创 CSP认证:202009-4 星际旅行
题目链接:点击这里#include<cstdio>#include<iostream>#include<cstring>#include<algorithm>#include<string>#include<deque>//代码写的有点丑#include<cmath>using namespace std;const double pi=acos(-1.0);double kkk[2005][105];
2021-03-23 00:33:29
231
原创 第十八届浙大城市学院程序设计竞赛
题目链接:点击这里A:签到B:签到#include<cstdio>#include<iostream>#include<cstring>#include<algorithm>#include<string>#include<deque>#include<cmath>using namespace std;typedef long long ll;const int mxm=1e6+5;int mai
2021-03-22 22:04:27
257
原创 ICPC North Central NA Contest 2019
题目链接:点击这里D题:签到题#include<cstdio>#include<iostream>#include<cstring>#include<queue>#include<algorithm>typedef long long ll;typedef long double ld;using namespace std;const int maxn=1e5+5;const int maxm=2e5+5;int main
2021-03-22 21:58:15
186
原创 拓扑排序:[USACO20FEB]Timeline G
题目链接:点击这里#include<cstdio>#include<iostream>#include<cstring>#include<queue>#include<algorithm>typedef long long ll;typedef long double ld;using namespace std;const int maxn=1e5+5;const int maxm=2e5+5;ll in[maxn],hea
2021-03-07 00:38:21
237
原创 拓扑排序:绿豆蛙的归宿
题目链接:点击这里#include<cstdio>#include<iostream>#include<cstring>#include<queue>#include<algorithm>typedef long long ll;typedef long double ld;using namespace std;const int maxn=1e5+5;const int maxm=2e5+5;ll in[maxn],hea
2021-03-06 23:56:38
82
原创 拓扑排序:最大食物链计数
题目来自:点击这里#include<cstdio>#include<iostream>#include<cstring>#include<queue>#include<algorithm>using namespace std;const int maxn=5005;const int maxm=500005;const int mod=80112002;int in[maxn],head[maxn],num=0,ans=0,o
2021-03-06 00:02:17
118
原创 差分:2020CCPC秦皇岛 D Exam Results
题目链接:点击这里#include<cstdio>#include<iostream>#include<cstring>#include<algorithm>//差分性质:1.差分序列求前缀和可得到原序列//2.原序列[l,r]区间内所有元素+k，转化为差分序列l处+k，r+1处-k; //对于每一个分数,都有一个分数上限和分数下限,在这个区间内的所有分数都可以使它及格//可很显然,1<=bi<=ai<=1e9,爆内存//开
2020-12-19 01:57:48
508
1
原创 并查集:2020CCPC秦皇岛 Friendly Group
题目链接:点击这里#include<bits/stdc++.h>using namespace std;typedef long long ll; int s[300005];int sum[300005];//花十个月时间学了个假算法int ddd[300005];//绝了int find(int u){ if(u==s[u]) return u; return s[u]=find(s[u]);}int main(){ int t; scanf("%d",&
2020-12-18 22:36:49
566
1
原创 2020.9CSP 点亮数字人生
题目链接:点击这里#include<iostream>#include<cstdio>#include<queue>#include<cstring>#include<algorithm>using namespace std;char s[30];int (*ans[10005])(int , int);int st[10005];int NOT(int x, int y){return !y;}int AND(int x,
2020-12-17 17:47:21
230
原创 2019icpc南京站K Triangle
#include<cstdio>#include<iostream>#include<queue>//妈的绝了#include<cmath>using namespace std;int ax,ay,bx,by,cx,cy,dx,dy;int mxm(int a,int b){ return a>b?a:b;}int mim(int a,int b){ return a<b?a:b;}double dis(double x1
2020-12-16 17:12:30
369
原创 单调队列
题目来源:点击这里#include<cstdio>#include<iostream>#include<cstring>#include<algorithm>#include<string>#include<stack>#include<queue>#include<map>#include<deque>using namespace std;int a[5005][5005];
2020-12-05 19:12:46
35
原创 图论:非严格次小生成树
参考博客:这位大佬写的很详细#include <cstdio>#include <cstring>#include <vector>#include <algorithm>using namespace std;const int maxn = 1000 + 10, maxe = 1000 * 1000 / 2 + 5, INF = 0x3f3f3f3f;int n, m;//n个点，m条边 int head[maxn];//并查集用 int
2020-12-05 19:11:32
117
原创 ST表求RMQ(区间最值问题)
点击这里#include<cstdio>#include<iostream>#include<algorithm>#include<cmath>using namespace std;const int mxm=1e6+5;int ans[mxm][21];int query(int l,int r){ int k=log2(r-l+1); return max(ans[l][k],ans[r-(1<<k)+1][k]);}
2020-12-05 19:11:14
55
原创 中国计量大学现代科技学院第四届“中竞杯”程序设计校赛（同步赛）F爬山
题目来源:点击这里#include <cstdio>#include <iostream>#include <cstring>#include <algorithm>typedef long long ll;ll yinin[1000+5][1000+5];ll a[105],n,m,tot,k,kk;ll total=0;ll dp[100*100+5],tip[1000+5],sum[1000+5];ll sum2[1000+5];u
2020-12-05 16:48:13
226
原创 数论:快速乘
题目来源:点击这里#include<bits/stdc++.h>using namespace std;typedef long long ll;ll q_mul( ll a, ll b, ll mod ){//快速乘 long long ans = 0; while(b){ if(b & 1){ b--; ans =(ans+ a)%mod; } b /= 2;
2020-12-01 18:03:42
64
原创 hhuoj贪吃蛇
题目来源:点击这里#include <cstdio>#include <cstring>#include <vector>#include<queue>#include<iostream>#include <algorithm>#include<deque>using namespace std; struct node{ int x; int y; //node *p;//本来想用链表模拟，但是st
2020-11-23 22:13:22
196
原创 数论分块
#include<cstdio>#include<algorithm>#include<iostream>#include<vector>#include<cstring>#include<cmath>using namespace std;typedef long long ll;int main(){//求1<=i<=n,求sum(k mod i);正常O(n),数论分块O(sqrt(n)) l
2020-11-20 15:58:07
80
原创 数论：min25筛求sum(1,n)
#include<cstdio>#include<algorithm>#include<iostream>#include<vector>#include<cstring>#include<cmath>using namespace std;typedef long long ll;const int mxm=2e5+5;const ll N=1e10+5;bool isprime[mxm];ll prime[
2020-11-19 19:52:03
104
原创 数论：min25筛求n个1相加
#include<cstdio>#include<algorithm>#include<iostream>#include<vector>#include<cstring>#include<cmath>using namespace std;typedef long long ll;const int mxm=2e5+5;const ll N=1e10+5;bool isprime[mxm];ll prime[
2020-11-19 19:06:58
564
原创 数论:min25筛求素数个数
#include<cstdio>#include<algorithm>#include<iostream>#include<vector>#include<cstring>#include<cmath>using namespace std;typedef long long ll;const int mxm=2e5+5;const ll N=1e10+5;bool isprime[mxm];ll prime[
2020-11-19 14:59:23
612
原创 数论:min25筛
#include<cstdio>#include<algorithm>#include<iostream>#include<vector>#include<cstring>#include<cmath>using namespace std;typedef long long ll;const int mxm=2e5+5;const ll N=1e10+5;bool isprime[mxm];ll prime[
2020-11-18 16:22:14
105
1
原创 博弈论：ccpc2020nim
#include<cstdio>#include<algorithm>#include<iostream>#include<vector>#include<cstring>#include<cmath>using namespace std;typedef long long ll;const int mxm=2e5+5;bool isprime[mxm];int num_pri=0;int prime[mxm]
2020-11-18 16:17:04
116
原创 数论:莫比乌斯函数
莫比乌斯函数μ(n)的定义域是Nμ(1)=1当n存在平方因子时，μ(n)=0当n是素数或奇数个不同素数之积时，μ(n)=-1当n是偶数个不同素数之积时，μ(n)=1
2020-11-10 19:15:34
335
原创 数论：Stirling数
第一类Stirling数有n个仓库，每个仓库有2把钥匙，共2n把钥匙，有n位保管员，保管员分别属于k个不同的部，部中的保管员数量和他们管理的仓库数量一样多，例如第i个部有m个管理员，保管m个仓库，如何放钥匙，使得同部的所有保管员能打开本部的所有仓库，但是无法打开其他的仓库。s[n][k]=s[n-1][k-1]+(n-1)s[n-1][k] ,1<=k<=ns[0][0]=1,s[k][0]=0 , 1<=k<=n第二类Stirling数把n个不同的球分配到k个相同的盒子里
2020-11-08 16:04:56
200
原创 数论：扩展欧拉定理
#include<cstdio>#include<stack>#include<iostream>#include<queue>#include<algorithm>#include<iterator>#include<set>#include<string>#include<cstring> #include<map>#include<vector>us
2020-11-08 10:34:09
74
原创 数论：欧拉函数
#include<cstdio>#include<stack>#include<iostream>#include<queue>#include<algorithm>#include<iterator>#include<set>#include<string>#include<cstring> #include<map>#include<vector>us
2020-11-08 09:53:52
102
1
原创 数论：错排问题
n个有序的元素应有n!个不同的排列，如若一个排列使得所有的元素不在原来的位置上，则称这个排列为错排。f[0]=0;f[1]=1;f[i]=(i-1)*(f[i-1]+f[i-2])
2020-11-07 23:40:32
50
原创 数论：卢卡斯定理
#include <cstdio>#include <cstring>#include <vector>#include<queue>#include<string>#include<iostream>#include <algorithm>using namespace std;typedef long long ll;ll n,m,p;ll c[100005];ll fastpow(ll a,ll
2020-11-07 21:15:56
99
原创 数论：中国剩余定理
#include <cstdio>#include <cstring>#include <vector>#include<queue>#include<string>#include<iostream>#include <algorithm>using namespace std;typedef long long ll;ll a[20],b[20];//a是除数 ,b是余数 ll ans[20];ll
2020-11-07 19:35:18
61
1
原创 数论：逆元
#include <cstdio>#include <cstring>#include <vector>#include<queue>#include<string>#include<iostream>#include <algorithm>typedef int ll;using namespace std;void exgcd(ll a,ll b,ll &x,ll &y) { if(!
2020-11-07 16:06:50
82
原创 图论：spfa求同余最短路
题目来自：点击这里#include<cstring>#include<iostream>#include<queue>#include<cstdio>#include<algorithm>using namespace std;typedef long long ll;const ll inf = 0x3f3f3f3f;struct edge{ ll to,w,next;}kkk[1000050*2];ll head[10
2020-11-05 16:40:56
65
原创 图论：最小割
题目来自：点击这里#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>#include<cmath>#include<queue>const int maxm=2000100;const int maxd=2000100;const int inf=0x7ffffff;using namespace std;int n;int
2020-11-03 22:07:00
187
原创 spfa最长路差分约束
题目链接:点击这里#include<cstring>#include<iostream>#include<queue>#include<cstdio>#include<algorithm>using namespace std;inline int read(){ int a=0;char x=getchar(); while(x<'0'||x>'9')x=getchar(); while(x>
2020-11-02 20:14:59
109
原创 图论：差分约束
题目链接：点击这里#include<cstring>#include<iostream>#include<queue>#include<cstdio>#include<algorithm>using namespace std;struct edge{ int to,w,next;}kkk[100005];int head[50005],neg[50005],dis[50005],vis[50005],numedge,n,m;
2020-11-01 18:44:59
77
原创 差分约束
题目链接：点击这里#include<cstring>#include<iostream>#include<queue>#include<cstdio>#include<algorithm>using namespace std;struct edge{ int to,w,next;}kkk[10005];int head[5005],neg[5005],dis[5005],vis[5005],numedge,n,m;void
2020-11-01 18:19:21
46
原创 图论：KM算法求解二分图最大权完美匹配
#include<iostream>//二分图最大权匹配 #include<cstdio>#include<algorithm>#define N 505#define M 250005#define INF 9990365505#define ll long longusing namespace std;int n,m,x,y,z,tot,tim,l,r,q[N],fr[N],nxt[M],d1[M],d2[M];int pre[N],visx[N]
2020-11-01 14:46:06
196
原创 图论：差分约束算法
题目链接：点击这里代码如下:#include<cstring>#include<iostream>#include<queue>#include<cstdio>#include<algorithm>using namespace std;struct edge{ int to,w,next;}kkk[10005];//存边用int head[5005],neg[5005],dis[5005],vis[5005],numedg
2020-11-01 11:51:04
100
空空如也
交换机连接pc或者其他设备
2022-06-09
TA创建的收藏夹 TA关注的收藏夹
TA关注的人