关于队里面最菜的在博客打卡第八天这件事

这是一道时间复杂度到10的7次方的暴力题。

题目链接：Problem - A - Codeforces

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;

int at[10][10];
int p[10][10];
int B[10][10];
int g[10];
int Be[10];
int s[10];
int q[10];
int main()
{
	ios :: sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	
	string a, b;
	cin >> a >> b;
	int sump = 0;
	memset(g, -1, sizeof g);
	memset(Be,-1,sizeof Be);
	for (int i = 0; i < b.size(); i++)
	{
		if (i == 2 || i == 5)
			continue;
		if (b[i] == 'P')
		{
			p[i][a[i] - '0'] = true;
			q[a[i]-'0'] ++ ;
			sump++;
		}
		else if (b[i] == 'G')
		{
			g[i] = a[i] - '0';
			q[a[i]-'0'] ++;
		}
		else if (b[i] == 'B')
		{
			B[i][a[i]-'0'] = true;
			if(Be[a[i] - '0'] == -1)Be[a[i]-'0'] = 1;
			else Be[a[i] - '0'] ++ ;
		}
	}

	vector<string > ans ;

	for (s[0] = 0; s[0] <= 9; s[0]++)
	{
		if(g[0] != -1 && g[0] != s[0])continue;
		for (s[1] = 0; s[1] <= 9; s[1]++)
		{
			if(g[1] != -1 && g[1] != s[1])continue;
			for (s[3] = 0; s[3] <= 9; s[3]++)
			{
				if(g[3] != -1 && g[3] != s[3])continue;
				for (s[4] = 0; s[4] <= 9; s[4]++)
				{
					if(g[4] != -1 && g[4] != s[4])continue;
					for (s[6] = 0; s[6] <= 9; s[6]++)
					{
						if(g[6] != -1 && g[6] != s[6])continue;
						for (s[7] = 0; s[7] <= 9; s[7]++)
						{
							int num[10] = {0};
							if(g[7] != -1 && g[7] != s[7])continue;
							vector<int> v;
							for(int i = 0 ; i < 8 ; i ++)
								if(i == 2 || i == 5)continue;
								else v.push_back(s[i]);

							for(int i = 0 ; i < v.size() ; i ++)num[v[i]] ++ ;

							sort(v.begin(),v.end());
							v.erase(unique(v.begin(),v.end()),v.end());
							int sum = 0;
							for(auto it : v)sum += q[it];
							bool f = true;
							for(int i = 0 ; i < 8 ; i ++)
							{
								if(i == 2 || i == 5)continue;
								else if(p[i][s[i]])f = false;
							}

							for(int i = 0 ; i <= 9 ; i ++)
							{
								if(!num[i])continue;
								else if(Be[i] == -1)continue;
								else if(num[i] > q[i])f = false;
							}


							for(int i = 0 ; i < 8 ; i ++)
							{
								if(i == 2 || i == 5)continue;
								if(B[i][s[i]])f = false;
							}
							for(int i = 0 ; i <= 9 ; i ++)if(num[i] < q[i])f = false;
							if( f )
							if(s[0] * 10 + s[1] + s[3] * 10 + s[4] == s[6] * 10 + s[7])
							{
								string res;
								for(int i = 0 ; i < 8 ; i++)
								{
									if(i == 2)res += '+';
									else if(i == 5)res +='=';
									else res += (char)(s[i]+'0');
								}
								ans.push_back(res);
							}
						}
					}
				}
			}
		}
	}
	cout << ans.size()<<endl;
	for(auto it : ans)cout << it << endl;
	return 0 ;
}