第一次做这么傻逼的暴力题,心塞塞。。
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<sstream>
#include<queue>
#include<cstdio>
using namespace std;
typedef long long LL;
const int INF = 0x3f3f3f3f;
const int M = 1010;
struct node
{
int num, v1, v2;
}a[105];
int fk[3][5];
int s[100];
int main()
{
int n;
while (cin >> n && n != 0)
{
for (int i = 0; i < n; ++i)
{
cin >> a[i].num >> a[i].v1 >> a[i].v2;
}
int flag = 0;
int cnt = 0;
for (int i = 1000; i <= 9999; ++i)
{
int res = 0;
for (int j = 0; j < n; ++j)
{
fk[2][1] = i / 1000;
fk[2][2] = i / 100 % 10;
fk[2][3] = i / 10 % 10;
fk[2][4] = i % 10;
fk[1][1] = a[j].num / 1000;
fk[1][2] = a[j].num / 100 % 10;
fk[1][3] = a[j].num / 10 % 10;
fk[1][4] = a[j].num % 10;
int tmp = 0;
for (int k = 1; k <= 4; ++k)
{
if (fk[1][k] == fk[2][k])
tmp++;
}
int tmp2 = 0;
bool v[5];
memset(v, 0, sizeof(v));
for (int k = 1; k <= 4; ++k)
{
for (int h = 1; h <= 4; ++h)
{
if (fk[1][k] == fk[2][h] && !v[h])
{
tmp2++;
v[h] = 1;
break;
}
}
}
if (tmp2 == a[j].v1 && tmp == a[j].v2)
{
res++;
}
}
if (res == n)
{
s[cnt++] = i;
}
}
if (cnt == 1)
{
cout << s[0] << endl;
}
else
{
puts("Not sure");
}
}
return 0;
}