uva 296 - Safebreaker

枚举法

 #include <cstdio>
 using namespace std;

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

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

         int cnt = , ans;
         char s[];
         for(i = ; i <= ; i++)
         {
             s[] = f[i][];
             s[] = f[i][];
             s[] = f[i][];
             s[] = f[i][];
             for(j = ; j < n; j++)
             {
                 int num[] = {}, a = , b = ;

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

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

                 for(k = ; k < ; 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 == )
                     break;
             }
         }
         if(cnt == ) printf("%04d\n", ans);
         else if(cnt == ) puts("impossible");
         else puts("indeterminate");
     }
     return ;
 }

 #include <iostream>
 #include <set>
 #include <stdio.h>

 using namespace std;
 struct Combination {
 int num[];
 int taken[];
 Combination(int N) {
 for (size_t i = ; i < ; i++)
 num[i] = N % , N /= , taken[i] = ;
 }
 int matches(Combination & o) {
 int count = ;
 for (size_t i = ; i < ; i++) {
 if (this->num[i] == o.num[i]) {
 count++;
 taken[i] = o.taken[i] = ;
 }
 }
 return count;
 }
 int contains(Combination & o) {
 int count = ;
 for (int i = ; i < ; i++) {
 if (taken[i])
 continue;
 for (int j = ; j < ; j++) {
 if (o.taken[j])
 continue;
 if (o.num[j] == num[i]) {
 count++;
 taken[i] = o.taken[j] = ;
 }
 }
 }
 return count;
 }
 };
 struct Guess {
 int n, r, w;
 Combination com;
 Guess() :
 r(), w(), com(Combination()) {
 }
 ;
 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 = ; i < g; i++) {
 scanf("%d %d/%d", &N, &R, &W);
 guesses[i] = Guess(N, R, W);
 }
 int matches = ;
 Combination match();
 for (int n = ; n < ; n++) {
 for (size_t i = ; i < g; i++) {
 guesses[i].reset();
 }
 bool applyToAll = true;

 Combination abc = Combination(n);

 if (abc.valid())
 for (size_t i = ; i < g; i++) {
 Combination ab = Combination(n);
 applyToAll &= guesses[i].apply(ab);
 }

 if (applyToAll) {
 matches++;
 match = Combination(n);
 }
 }
 if (!matches)
 printf("impossible\n");
 else if (matches == )
 printf("%d%d%d%d\n", match.num[], match.num[], match.num[], match.num[]);
 else if (matches > )
 printf("indeterminate\n");
 }
 return ;
 }