Educational Codeforces Round 65 (Rated for Div. 2) A-D

//A
#include <bits/stdc++.h>
using namespace std;
int main()
{
	int t,n;
	string s;
	scanf("%d",&t);
	while(t--){
		scanf("%d",&n);
		cin>>s;
		int st = (int)s.find('8');
		int sz = s.size() - st;
		//printf("%d %d\n",st,sz);
		if(st!=-1&&sz>=11){
			cout<<"yes\n";
		}else cout<<"no\n";
	}
	return 0;
}

//B
#include <bits/stdc++.h>
using namespace std;
int a[10] = {4,8,15,16,23,42};
int d[5];
int main()
{
	for(int i=1;i<=4;i++){
		printf("? %d %d\n",i,i+1);
		fflush(stdout);
		cin>>d[i];
	}
	do{
		if(a[0]*a[1]==d[1]&&a[1]*a[2]==d[2]&&a[2]*a[3]==d[3]&&a[3]*a[4]==d[4]){
			break;
		}
		
	}while(next_permutation(a,a+6));
	printf("!");
	for(int i=0;i<6;i++){
		printf(" %d",a[i]);
	}
	printf("\n"); 
	fflush(stdout);
	return 0;
}

//C
#include <bits/stdc++.h>
using namespace std;
const int N = 600005;
int n,m;
int f[N];
int rank1[N];
int find(int x) {
	int g = x;
	while(x!=f[x]) {
		x = f[x];
		rank1[g]++;
	}
	return x;
}
int find1(int x) {
	while(x!=f[x]) {
		x = f[x];
	}
	return x;
}

int main() {
	scanf("%d %d",&n,&m);
	for(int i=0; i<=n+1; i++)f[i] = i,rank1[i] = 1;
	for(int i=1; i<=m; i++) {
		int k,t,t2;
		scanf("%d",&k);
		if(k==0)continue;
		scanf("%d",&t);
		for(int j=0; j<k-1; j++) {
			scanf("%d",&t2);
			int a = find(t);
			int b = find(t2);
			if(a!=b) {
				if(rank1[a]>rank1[b]) {
					f[b] = a;
					rank1[a]+=rank1[b];
				} else {
					f[a] = b;
					rank1[b]+=rank1[a];
				}
			}

		}
	}
	for(int i=1; i<=n; i++) {
		f[i] = find1(f[i]);
		rank1[i] = rank1[find(f[i])];
	}
	for(int i=1; i<=n; i++) {
		if(i==1)printf("%d",rank1[i]);
		else printf(" %d",rank1[i]);
		
	}
	return 0;

}

#include <bits/stdc++.h>
using namespace std;
int main()
{
	int n;
	scanf("%d",&n);
	stack<char> str1,str2;
	string s;
	char ans[200005];
	cin>>s;
	for(int i=0;i<n;i++){
		if(s[i]=='('){
			if(str1.size()<str2.size()){
				str1.push(s[i]); 
				ans[i] = '0';
			}else
			{
				str2.push(s[i]);
				ans[i] = '1';
			}
		}else{
			if(str1.size()>str2.size()){
				str1.pop();
				ans[i] = '0';
			}else{
				str2.pop();
				ans[i] = '1';
			}
		} 		
	}
	ans[n]='\0';
	cout<<ans<<endl;
	return 0;
 }