Blue bridge cup several full array questions

Fill in the squares

#include<bits/stdc++.h>using namespace std;bool check(vector<int>arr){	if(		abs(arr[0]-arr[1])==1||		abs(arr[0]-arr[3])==1||		abs(arr[0]-arr[4])==1||		abs(arr[0]-arr[5])==1||				abs(arr[1]-arr[2])==1||		abs(arr[1]-arr[4])==1||		abs(arr[1]-arr[5])==1||		abs(arr[1]-arr[6])==1||				abs(arr[2]-arr[5])==1||		abs(arr[2]-arr[6])==1||				abs(arr[3]-arr[4])==1||		abs(arr[3]-arr[7])==1||		abs(arr[3]-arr[8])==1||				abs(arr[4]-arr[5])==1||		abs(arr[4]-arr[7])==1||		abs(arr[4]-arr[8])==1||		abs(arr[4]-arr[9])==1||				abs(arr[5]-arr[6])==1||		abs(arr[5]-arr[8])==1||		abs(arr[5]-arr[9])==1||				abs(arr[6]-arr[9])==1||				abs(arr[7]-arr[8])==1||				abs(arr[8]-arr[9])==1	){		return false;	}	return true;		} int main(){	vector<int>arr;	int ans=0;	for(int i=0;i<10;i++){		arr.push_back(i);	}	do{		if(check(arr)){			ans++;		}			}while(next_permutation(arr.begin(),arr.end()));		cout<<ans<<endl;	return 0;} 

Winter homework

#include<bits/stdc++.h>using namespace std;int a[13]={1,2,3,4,5,6,7,8,9,10,11,12,13};int b[12];  // Save a full spread  int vis[13];int ans=0;void dfs(int level,int num){	if(level==3){		if(b[0]+b[1]!=b[2]){			return;		}	}	if(level==6){		if(b[3]-b[4]!=b[5]){			return;		}	}	if(level==9){		if(b[6]*b[7]!=b[8]){			return;		}	}	if(level==12){		if(b[9]==b[10]*b[11]){			ans++;		}		return;	}		for(int i=0;i<num;i++){		if(!vis[i]){			vis[i]=1;			b[level]=a[i];			dfs(level+1,num);			vis[i]=0;		}	}}int main(){	memset(vis,0,sizeof(vis));	dfs(0,13);	cout<<ans<<endl;	return 0;}

Pay attention to this b[9]==b[10]*b[11], Do not use b[9]/b[10]==b[11]

Bracelet style

#include<bits/stdc++.h>using namespace std;int main(){	int ans=0;	vector<string>arr; // Save all str+str 	string str="aaabbbbccccc";	do{		int i=0;		for(;i<arr.size();i++){			if(arr[i].find(str)!=string::npos){				break;			}		}		if(i!=arr.size()){			continue;		}		string temp=str+str;		arr.push_back(temp);		reverse(temp.begin(),temp.end());		arr.push_back(temp);				ans++;			}while(next_permutation(str.begin(),str.end()));		cout<<ans<<endl;}

Sanyang offers Rui

link

#include<bits/stdc++.h>using namespace std;int a[10]={0,1,2,3,4,5,6,7,8,9};int b[8];  // Used to save a full spread int vis[10];int ans=0;bool check(int b[]){	int sum=b[0]*10000+b[1]*1000+b[2]*100+b[3]*10+b[4];	int num1=b[5]*1000+b[3]*100+b[2]*10+b[6];	int num2=b[0]*1000+b[1]*100+b[7]*10+b[3];	if(num1+num2==sum){		return true;	}	return false;}void dfs(int level,int num){	if(level==8){   // The eight numbers are " Sanyang is blessed with auspicious Qi " 		if(check(b)){			ans++;			for(int i=0;i<8;i++){				cout<<b[i]<<" ";			}			cout<<endl;		}		return;	}	for(int i=0;i<num;i++){		if(!vis[i]){			vis[i]=1;			b[level]=a[i];			dfs(level+1,num);			vis[i]=0;		}	}} int main(){	memset(vis,0,sizeof(vis));	dfs(0,10);   //level by 0, The first ten numbers in the array  	return 0;}