#include<bits/stdc++.h> #define maxn 1000050 using namespace std; int a[maxn],b[maxn],c[maxn],n,k,m,t; int main() { scanf("%d%d",&n,&k); for (int i=0;i<n;i++) scanf("%d",&a[i]); a[n]=0; memset(c,-1,sizeof(c)); m=0;b[m]=0;c[0]=0;t=0;..

#include<iostream> #include<cstdio> #include<cstring> #include<string> #include<cmath> #include<algorithm> #include<cstdlib> #define eps 1e-7 using namespace std; double x[100010],y[100010],r[100010],L; struct node{double l,r;}a[100010]; struct P{double..

#include <cstdio> #include <algorithm> using namespace std; long long n,a,b,c,d,st,len,t[300010]; int q[300010]; int main() { scanf(“%lld%lld%lld%lld%lld%lld%lld”,&n,&a,&b,&c,&d,&st,&len); for (int i=1;i<=n;i++) scanf(“%lld%d”,&t[i],&q[i]);..

#include <bits/stdc++.h> using namespace std; const int R[6][8] = { {12, 13, 4, 5, 16, 17, 20, 21}, {14, 15,..

#include<stdio.h> int main() { int n,i,j,k,m,A[10][10],B[1000]; scanf(“%d”,&n); for(i=1;i<=n;i++){ for(j=1;j<=6;j++){ scanf(“%d”,&A[i][j]);} } for(i=1;i<=100;i++){ B[i]=0;} for(i=1;i<=n;i++){ for(j=1;j<=6;j++){ B[A[i][j]]=1; for(k=1;k<=n;k++){ for(m=1;m<=6;m++){ if (k!=i){..

#include<stdio.h> char s[107]; int main() { scanf(” %s”,s); int x=0,y=0,z=0; while(s[x]==’0′) x++; while(s[z]!=0) z++; for(int i=x+1;i<z;i++) if(s[i]==’0′) y++; if(y>=6) printf(“yes”);..