蓝桥杯_c++组_B组_凑算式

题目：

凑算式

这个算式中A ~ i 代表1~9的数字，不同的字母代表不同的数字。

比如：
6+8/3+952/714 就是一种解法，
5+3/1+972/486 是另一种解法。

这个算式一共有多少种解法？

注意：你提交应该是个整数，不要填写任何多余的内容或说明性文字。

超级暴力的代码

#include<iostream>
#include<queue>
#include<cstring>
#include<string>
#include<sstream>
#include<map>
#include<vector>
#include<cstdio>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#include<stack>
#include<ctime>
using namespace std; 
#define rep(i,aa,bb) for(register int i=aa;i<=bb;i++)
#define rrep(i,aa,bb) for(register int i=aa;i>=bb;i--)
#define LL long long 
#define eps 0.000001
#define inf 0x3f3f3f3f
#define exp 0.000001
#define pai 3.141592654
#define random(x)   rand()%(x)
#define lowbit(x)   x&(-x)
inline int read()
{
	int x=0,y=1;char a=getchar();while ( a>'9' || a<'0'){if ( a=='-')y=-1;a=getchar();}
	while ( a>='0' && a<='9' ){	x=10*x+a-'0'; a=getchar();}return x*y;
}
#define N 100009
int ans = 0 ; 
bool vis[100];
int main()
{
//	freopen("1.txt","r",stdin);
	srand((int)time(0));
//	std::ios::sync_with_stdio(false);
	for (int a = 1; a <= 9; a++){
		if ( vis[a] )	continue; 
		vis[a] = 1;
		for (int b = 1; b <= 9; b++){
			if ( vis[b] )	continue; 
			vis[b] = 1;
			for (int c = 1; c <= 9; c++){
				if ( vis[c] )	continue; 
				vis[c] = 1;
				for (int d = 1; d <= 9; d++){
					if ( vis[d] )	continue; 
					vis[d] = 1;
					for (int e = 1; e <= 9; e++){
						if ( vis[e] )	continue; 
						vis[e] = 1;
						for (int f = 1; f <= 9; f++){
							if ( vis[f] )	continue; 
							vis[f] = 1;
							for (int g = 1; g <= 9; g++){
								if ( vis[g] )	continue; 
								vis[g] = 1;
								for (int h = 1; h <= 9; h++){
									if ( vis[h] )	continue; 
									vis[h] = 1;
									for (int i = 1; i <= 9; i++){
										if ( vis[i] )	continue; 
										vis[i] = 1;
										
										if ( abs(a + double(b)/c + double(d*100+e*10+f)/double(g*100+h*10+i) - 10 ) < 0.00001){
											printf("%d %d %d %d %d %d %d %d %d\n",a,b,c,d,e,f,g,h,i);	
											ans++;
										}
										
										
										vis[i] = 0; 
									}										
									vis[h] = 0; 
								}										
								vis[g] = 0; 
							}								
							vis[f] = 0; 
						}							
						vis[e] = 0; 
					}						
					vis[d] = 0; 
				}				
				vis[c] = 0; 
			}			
			vis[b] = 0; 
		}
		vis[a] = 0; 
	}
	cout<<endl<<ans<<endl; 
	return 0;
}

next_permutation(a,a+9)的解法：

#include <bits/stdc++.h> 
using namespace std;
int a[]={1,2,3,4,5,6,7,8,9};
int ans;
bool check(){
    int x = a[3] * 100 + a[4] * 10 + a[5];
    int y = a[6] * 100 + a[7] * 10 + a[8];
    if((a[1] * y + a[2] * x) % (y * a[2])==0 && a[0] + (a[1] * y + a[2] * x) / (y * a[2]) == 10)
        return true;
    return false;
}
int main() {
    do{
        if(check())
            ans++;
    }while(next_permutation(a,a+9));
    cout<<ans<<endl;
    return 0;
}

dfs暴力解法（简洁版）：

#include <iostream>
#include <cmath>
#include <bits/stdc++.h> 
using namespace std;
int a[]={1,2,3,4,5,6,7,8,9};
int ans;
bool check(){
    int x = a[3] * 100 + a[4] * 10 + a[5];
    int y = a[6] * 100 + a[7] * 10 + a[8];
    if((a[1] * y + a[2] * x) % (y * a[2])==0 && a[0] + (a[1] * y + a[2] * x) / (y * a[2]) == 10)
        return true;
    return false;
}
void f(int k) {
    if(k==9){
        if(check())
            ans++;
    }
    for (int i = k; i < 9; ++i) {
        {int t=a[i];a[i]=a[k];a[k]=t;}
        f(k+1);
        {int t=a[i];a[i]=a[k];a[k]=t;}
    }
}
int main() {
	f(0);
    cout<<ans<<endl;
    return 0;
}

另外一种dfs（繁杂版）：

#include <iostream>
#include <cmath>
#include <bits/stdc++.h> 
using namespace std;
int a[]={1,2,3,4,5,6,7,8,9};
int ans;
bool check(){
    int x = a[3] * 100 + a[4] * 10 + a[5];
    int y = a[6] * 100 + a[7] * 10 + a[8];
    if((a[1] * y + a[2] * x) % (y * a[2])==0 && a[0] + (a[1] * y + a[2] * x) / (y * a[2]) == 10)
        return true;
    return false;
}
bool vis[20];
void f(int k){
    if(k==9){
        if(check())
            ans++;
    }
    for (int i = 1; i <= 9; i++){
    	if ( vis[i] )	continue; 
    	a[k] = i; 
    	vis[i] = 1; 
    	f(k+1);
    	vis[i] = 0; 
    }
}
int main() {
	f(0);
    cout<<ans<<endl;
    return 0;
}