Master-Mind Hints UVa - 340

题目链接

#include<iostream>
using namespace std;
#define maxn 2000
int main()
{
    int n,gue[maxn],ans[maxn],t=0;
    while(cin >> n&&n){
        cout << "Game " << ++t << ":" << endl;
        for(int i=0;i<n;i++) cin >> ans[i];
        while(true){
            int x=0,y=0;  // x:位置正确   y:数字在两个序列中都出现过的情况(整对)
            for(int i=0;i<n;i++){
                cin >> gue[i];
                if(ans[i] == gue[i]) x++;
            }
            if(gue[0]==0) break;
            for(int num=1;num<=9;num++){
                int y1=0,y2=0;
                for(int i=0;i<n;i++){
                    if(ans[i]==num) y1++;
                    if(gue[i]==num) y2++;
                }
                y+=y1>y2?y2:y1;
            }
            // y-x  减去位置正确的情况
            cout << "    " <<'(' << x << ',' << y-x << ')' << endl;
        }
    }
    return 0;
}