uva 296

枚举法

#include <cstdio>
using namespace std;

int main()
{
    int t, n, i, j, k;
    scanf("%d", &t);
    char f[10000][5];
    for(i = 0; i <= 9999; i++)
        sprintf(f[i], "%04d", i);

    while(t--)
    {
        scanf("%d", &n);
        char G[100][5], A[100], B[100];
        for(i = 0; i < n; i++)
            scanf("%s %d/%d", G[i], &A[i], &B[i]);

        int cnt = 0, ans;
        char s[5];
        for(i = 0; i <= 9999; i++)
        {
            s[0] = f[i][0];
            s[1] = f[i][1];
            s[2] = f[i][2];
            s[3] = f[i][3];
            for(j = 0; j < n; j++)
            {
                int num[10] = {}, a = 0, b = 0;

                for(k = 0; k < 4; k++)
                    num[G[j][k] - '0'] ++;

                for(k = 0; k < 4; k++)
                    if(num[s[k]-'0'] > 0)
                        b++, num[s[k]-'0']--;

                for(k = 0; k < 4; k++)
                    if(s[k] == G[j][k])
                        a++, b--;

                if(A[j] == a && B[j] == b) continue;
                else break;
            }
            if(j == n)
            {
                cnt ++;
                ans = i;
                if(cnt == 2)
                    break;
            }
        }
        if(cnt == 1) printf("%04d
", ans);
        else if(cnt == 0) puts("impossible");
        else puts("indeterminate");
    }
    return 0;
}

#include <iostream>
#include <set>
#include <stdio.h>
 
using namespace std;
struct Combination {
int num[4];
int taken[4];
Combination(int N) {
for (size_t i = 0; i < 4; i++)
num[i] = N % 10, N /= 10, taken[i] = 0;
}
int matches(Combination & o) {
int count = 0;
for (size_t i = 0; i < 4; i++) {
if (this->num[i] == o.num[i]) {
count++;
taken[i] = o.taken[i] = 1;
}
}
return count;
}
int contains(Combination & o) {
int count = 0;
for (int i = 0; i < 4; i++) {
if (taken[i])
continue;
for (int j = 0; j < 4; j++) {
if (o.taken[j])
continue;
if (o.num[j] == num[i]) {
count++;
taken[i] = o.taken[j] = 1;
}
}
}
return count;
}
};
struct Guess {
int n, r, w;
Combination com;
Guess() :
r(0), w(0), com(Combination(0)) {
}
;
Guess(int N, int R, int W) :
n(N), r(R), w(W), com(Combination(N)) {
}
bool apply(Combination& c) {
int m = com.matches(c), co = com.contains(c);
return m == r && co == w;
}
void reset() {
com = Combination(n);
}
};
int main(void) {
int T, g, N, R, W;
 
scanf("%d", &T);
while (T--) {
scanf("%d", &g);
Guess guesses[g];
for (size_t i = 0; i < g; i++) {
scanf("%d %d/%d", &N, &R, &W);
guesses[i] = Guess(N, R, W);
}
int matches = 0;
Combination match(0);
for (int n = 0; n < 10000; n++) {
for (size_t i = 0; i < g; i++) {
guesses[i].reset();
}
bool applyToAll = true;
 
Combination abc = Combination(n);
 
if (abc.valid())
for (size_t i = 0; i < g; i++) {
Combination ab = Combination(n);
applyToAll &= guesses[i].apply(ab);
}
 
if (applyToAll) {
matches++;
match = Combination(n);
}
}
if (!matches)
printf("impossible
");
else if (matches == 1)
printf("%d%d%d%d
", match.num[3], match.num[2], match.num[1], match.num[0]);
else if (matches > 1)
printf("indeterminate
");
}
return 0;
}