Napoleon2004的博客

#include<bits/stdc++.h>using namespace std;int n,i,a,b,ok,tar[1010];int main(){ while(scanf("%d",&n)){ if(n==0)break; stack<int>s; while(1){ a=b=1; scanf("%d",&tar[...

#include<bits/stdc++.h>using namespace std;int n,m,i,j,maxt,b[110],d[110],e[110],a[110][110],c[110][110];void dfs(int u,int t){ b[u]=t; e[u]=1; maxt=max(maxt,t); for(int v=1;v<=n;v++)...

#include<bits/stdc++.h>const int maxn=105;char c[maxn][maxn];int i,j,n,m,ans,b[maxn][maxn],q[10]={-1,-1,-1,0,1,1,1,0},p[10]={-1,1,0,-1,-1,1,0,1};void dfs(int x,int y){ if(x<1||x>n||y&...

#include<bits/stdc++.h>using namespace std;const int maxn=1e5;int sum[maxn];void build(int p){ int v; scanf("%d",&v); if(v==-1)return; sum[p]+=v; build(p-1); build(p+1);}int init...

#include<bits/stdc++.h>using namespace std;bool solve(int& w){ int w1,d1,w2,d2; bool b1=1,b2=1; scanf("%d%d%d%d",&w1,&d1,&w2,&d2); if(!w1)b1=solve(w1); if(!w2)b2=solve...

#include<bits/stdc++.h>using namespace std;const int Max=10010;struct node{ int l,r;}s[Max];int n,bestn,bestm,ord1[Max],ord2[Max];bool read(int* a){ string l; int x; if(!getline(cin,l)...

#include<bits/stdc++.h>int t,n,x,i,k;int main(){ scanf("%d",&t); while(t--){ scanf("%d%d",&n,&x); int k=1; for(i=0;i<n-1;i++) if(x%2){ k=(k<<1); x=((x+1...

#include<bits/stdc++.h>using namespace std;long long n,m,t,i,inv,cas,ans;struct node{ long long l,r;}a[100010];void link(long long x,long long y){ a[x].r=y; a[y].l=x;}int main(){ whil...

#include<bits/stdc++.h>int i,n,cur,last,next[100010];char c,s[100010];int main(){ while(scanf("%s",s+1)==1){ n=strlen(s+1); last=cur=0; next[0]=0; for(i=1;i<=n;i++){ c=s[i]; ...

#include<bits/stdc++.h>using namespace std;struct Matrix{ int l,r; Matrix(int l=0,int r=0):l(l),r(r){}}m1,m2,m[26];stack<Matrix>s;int n,i,t1,t2,ans,error;char c;string str;int ma...

#include<bits/stdc++.h>using namespace std;int t,l,n,i,ok,root,bin[26],bout[26],fat[26];int find(int x){ if(fat[x]!=x)return fat[x]=find(fat[x]); return x;}string s;int main(){ scanf("%...