340 - Master-Mind Hints

最新推荐文章于 2020-03-13 22:02:10 发布

HackQ_sxj

最新推荐文章于 2020-03-13 22:02:10 发布

阅读量134

点赞数

分类专栏：算法

本文链接：https://blog.csdn.net/HackQ_sxj/article/details/88356920

版权

算法专栏收录该内容

37 篇文章 0 订阅

订阅专栏

#include <stdio.h>
#define maxn 1010

int main()
{
    int n;
    int a[maxn], b[maxn];
    int kase = 0;
    while(scanf("%d", &n)!=EOF&&n)
    {
        for(int i = 0; i < n; i++)
            scanf("%d", &a[i]);
        printf("Game %d:\n", ++kase);
        for(;;)
        {
            int A = 0, B = 0;
            for(int i = 0; i < n; i++)
            {
                scanf("%d", &b[i]);
                if(b[i] == a[i])
                    A++;
            }
            if(b[0] == 0) break;
            for(int d = 1; d <= 9; d++)
            {
                int c1 = 0, c2 = 0;
                for(int i = 0; i < n; i++)
                {
                    if(a[i] == d) c1++;
                    if(b[i] == d) c2++;
                }
                if(c1 < c2) B += c1;
                else B += c2;
            }
            printf("    (%d,%d)\n", A, B-A);
        }
    }
    return 0;
}