训练赛题解

A:

#include<bits/stdc++.h>
using namespace std;
int n;
int A[20],V[20];
bool P(int x){
    for(int i=2;i*i<=x;++i){
        if(x%i==0)return 0;
    }
    return 1;
}
void dfs(int x){
    if(x==n){
        if(P(A[1]+A[n])){
            cout<<A[1];
            for(int i=2;i<=n;++i)cout<<" "<<A[i];
            cout<<endl;
        }
        return;
    }
    for(int i=2;i<=n;++i){
        if(V[i]==0&&P(i+A[x])){
            A[x+1]=i;
            V[i]=1;
            dfs(x+1);
            V[i]=0;
        }
    }
}
int main(){
    int flag=0;
    while(cin>>n){
        if(flag>0)cout<<endl;
        cout<<"Case "<<++flag<<":"<<endl;
        A[1]=1;
        dfs(1);
    }
}

B:

#include<bits/stdc++.h>
using namespace std;
char s[2][100000];
int len;
int ans=0;
void fuck(char q,int num[]){
	if (q=='m'){
		ans=1;
		return;
	}
	for(int i=0;i<len;++i){
		if(s[0][i]==q&&num[i]){
			num[i]=0;
			fuck(s[1][i],num);
		}
	}
}
int main(){
	string a;
	while(cin>>a){
		ans=0;
		int i=0;
		if(*a.begin()!=*(a.end()-1)){
			s[0][i]=*a.begin();
			s[1][i++]=*(a.end()-1);
		}
		while(cin>>a&&a[0]!='0'){
			if(*a.begin()!=*(a.end()-1)){
				s[0][i]=*a.begin();
				s[1][i++]=*(a.end()-1);
			}
		}
			int number [1000];
			for(int i=0;i<1000;++i)
				number[i]=1;
			len=strlen(s[0]);
			fuck('b',number);
			cout<<(ans?"Yes.\n":"No.\n");
	}
}

floyed:下节课会讲

#include<bits/stdc++.h>
using namespace std;
bool s[26][26];
int main(){
	string a;
	while(cin>>a){
		memset(s,0,sizeof s);
		s[*a.begin()-97][*(a.end()-1)-97]=1;
		while(cin>>a&&a!="0"){
		s[*a.begin()-97][*(a.end()-1)-97]=1;
		}
		for(int k=0;k<26;++k)
			for(int i=0;i<26;++i)
				for(int j=0;j<26;++j)
					s[i][j]=max(s[i][j],s[i][k]&&s[k][j]);
		cout<<(s[1]['m'-97]?"Yes.":"No.")<<endl;
	}
}

C:

#include<bits/stdc++.h>
#define X first
#define Y second
using namespace std;
const int N=6e5+10;
int V[N];
int main(){
    int x,y;
    while(cin>>x>>y){
    memset(V,0,sizeof V);
    queue<pair<int,int> > Q;
    Q.push(make_pair(x,0));
    V[x]=1;
    while(Q.size()){
        int a=Q.front().X,b=Q.front().Y;
        Q.pop();
        if(a==y){
            cout<<b<<endl;
            break;
        }
        if(a>0&&V[a-1]==0){
           Q.push(make_pair(a-1,b+1));
           V[a-1]=1;
        }
        if(a<3*y&&V[a+1]==0){
            Q.push(make_pair(a+1,b+1));
            V[a+1]=1;
        }
        if(a<3*y&&V[a*2]==0){
            Q.push(make_pair(a*2,b+1));
            V[a*2]=1;
        }
    }
    }
}

D:

#include<bits/stdc++.h>
using namespace std;
int num[55][55];
bool num1[55][55];
int lin,x,y;
void dfs(int i,int j){
	if(num1[i][j])
		return;
	if(i<1||i>x||j<1||j>y)
		return;
	num1[i][j]=1;
	++lin;
	if((num[i][j]&1)==0)
		dfs(i,j-1);
	if((num[i][j]&2)==0)
		dfs(i-1,j);
	if((num[i][j]&4)==0)
		dfs(i,j+1);
	if((num[i][j]&8)==0)
		dfs(i+1,j);
}
int main(){
	int ans=0,maxnum=0;
	cin>>x>>y;
	for(int i=1;i<=x;++i)
		for(int j=1;j<=y;++j)
			cin>>num[i][j];
	for(int i=1;i<=x;++i)
		for(int j=1;j<=y;++j)
			if(!num1[i][j])
				lin=0,dfs(i,j),++ans,maxnum=max(maxnum,lin);
	cout<<ans<<endl<<maxnum<<endl;
}//