Blue Bridge Cup 2015 CA provincial competition (filling the pit)

1、 Integer solution of the equation

#include<bits/stdc++.h>
using namespace std;
int main(){
    
	for(int a=1;a<35;a++){
    
		for(int b=1;b<35;b++){
    
			for(int c=1;c<35;c++){
    
				if(a*a+b*b+c*c==1000){
    
					cout<<a<<" "<<b<<" "<<c<<" "<<endl;
				}
			}
		}
	}
	return 0;
}

answer ：10

2、 The galaxy bomb

use excel Calculated
A1 Write death as 2014-11-9
C1=B1-A1
adjustment B1 until C1=1000

answer : 2017-08-05

3、 Wonderful numbers

Convert the sum of squares and cubes to a string , String concatenation , String sort , Determine whether the string is equal to 0123456789

#include<bits/stdc++.h>
using namespace std;
string num2str( double  i)
 {
    
        stringstream ss;
        string s;
        ss<<i;
        ss>>s;
        return s;
}
int main(){
    
	for(int a=1;a<10000;a++){
    
		int b=a*a;
		int c=a*a*a;
		string temp=num2str(b)+num2str(c);
		sort(temp.begin(),temp.end());
		if(temp=="0123456789"){
    
			cout<<a<<endl;
			return 0;
		}
	}
	return 0;
}

answer :69

6、 The number of brand types

What I think of is the knowledge of permutation and combination of high school mathematics problems

The vague memory is like this

DFS How to write it

#include<bits/stdc++.h>
using namespace std;
int pais[13];
vector<int> path;
int ans=0;
int countof(vector<int> path,int pai){
    
	int count=0;
	for(int i=0;i<path.size();i++){
    
		if(path[i]==pai){
    
			count++;
		} 
	}
	return count;
}
void dfs(int n,vector<int>&path){
    
	if(n==0){
    
		ans++;
		return;
	}
	for(int i=0;i<13;i++){
    
		if(countof(path,pais[i])<4){
    
			path.push_back(pais[i]);
			dfs(n-1,path);
			path.pop_back();
		} 
	} 
} 
int main(){
    
	for(int i=1;i<=13;i++) {
    
		pais[i-1]=i;
	}
	dfs(13,path); 
	cout<<ans<<endl;
}

7、 Bracelet style

8、 Drink exchange

Simulation is enough

#include<bits/stdc++.h>
using namespace std;
int main(){
    
	int n;
	cin>>n;
	int res=n;
	while(n>=3){
    
		int temp=n/3;
		n-=(temp*3);
		n+=(temp);
		res+=(temp);
	}
	cout<<res;
}

9、 Base dice

10、