UTix417的博客

#include <queue> #include <cstdlib> #include <cmath> #include <cstdio> #include <string> #include <cstring> #include <iostream> #include <algorithm> usi...

#include <stdio.h> #include <string.h> #include <iostream> #include <algorithm> #include <queue> using namespace std; struct Trie { int next[220*500][128],fail[220*5...

#include<iostream> #include<algorithm> #include<cstdio> #include<cstring> using namespace std; const int MAXN = 80080; const int MAXQ = 20020; int father[MAXN],Head[MAXN],QHe...

#include<bits/stdc++.h> using namespace std; int main(){ int l=1,r=1000000; while (l<r){ int mid=(l+r+1)/2; printf("%d\n",mid); fflush(stdout); ...

# include<cstdio> # include<iostream> # define MAX 1000+4 # define inf 1e9 using namespace std; int n,t; int edge[MAX][MAX]; int dis[MAX]; int vis[MAX]; int u,v; /* void init(){ for ( ...

#include<cstdio> #include<cstring> #include<algorithm> using namespace std; int a[110]; int pa[110]; int n,m; int i ,j; struct node{ int u,v,w; }arr[5500]; void init() { for(i=1;i...

#include <iostream> #include <cstdio> #include <cstring> #include <stdlib.h> #include <math.h> #include <queue> #include <algorithm> using namespace std; #def...

#include<iostream> #include<cstdio> #include<cstring> #include<string> #include<algorithm> using namespace std; int nxt[1000005]; string T,S; int n; void getnext(int len)...

/** UTix */ #include <cstdio> #include <algorithm> #include <iostream> #include <string> #include <cstring> using namespace std; int tot,rt; int flag; struct node{ int t...

#include <stdio.h> #include <string.h> #include <iostream> #include <algorithm> #include <queue> using namespace std; struct Trie { int next[210*500][128],fail[210*5...

#include <cstdio> #include <cstring> #include <iostream> #include <algorithm> #include <vector> using namespace std; const int Max=1e5+6; const int N=31; int n,m; int fa[...

#include <iostream> #include <stdio.h> #include <memory.h> #include <cmath> using namespace std; long long h[45]; long long f[45][45]; void catalan2() /...

#include <cstdio> #include <algorithm> #include <iostream> #include <cstring> #include <stack> #include <vector> using namespace std; const int Max=12000; vector&lt...

#include<bits/stdc++.h> #define N 110009 using namespace std; typedef unsigned long long ull; const int bas=27; char s[N]; ull lh[N],rh[N],p[N]; int a,b,ans,len; int get(int maxl,int a,int b){...

#include <stdio.h> #include <string.h> #include <algorithm> using namespace std; int bit[15]; int dp[15][15][3]; //dp[i][j][k] //i:数位 //j:余数 //k:3种操作状况，0：末尾不是1,1：末尾是1,2：含有13 int df...

#include<cstdio> #include<cstring> #include<iostream> #include<queue> #include<algorithm> using namespace std; typedef long long ll; const int maxn=1000+7; char s[maxn]; ...

#include<cstdio> #include<cstring> #include<iostream> #include<queue> #include<algorithm> #define M 500 #define inf 0x3f3f3f using namespace std; int cap[M][M],pre[M],c[...

#include <bits/stdc++.h> typedef long long ll; const int MAXN = 11000; const int INF = 1e9; struct Edge { int u, v; int cap, flow; Edge(int u_, int v_, int cap_, int flow_) : u(u_...

#include <cstdio> #include <algorithm> #include <iostream> #include <cstring> #include <stack> #include <vector> #include <map> using namespace std; int n,wan...

#include <bits/stdc++.h> #define ull unsigned long long using namespace std; const int M=100100; ull tree[4*M];//数的节点数要开叶子节点的四倍 ull lazy[4*M]; ull a[M]; int n; void pushdown(int rt,int m){ if(l...

void exgcd(int a1,int b,int &x,int &y) { if(b==0) { x=1; y=0; return ; } exgcd(b,a1%b,x,y); int t=x; x=y; y=t-(a1/b)*y; } int CRT(int a[],in...