目錄
題目描述
https://vj.e949.cn/ef72995afa0f802e4cfcb268592c3df3?v=1542412459
題意分析
題意:給出一行答案序列,再給出一系列猜測序列全爲0時,猜測結束。
輸出(位置正確數 , 在兩個序列中出現過但位置不正確的個數)
AC代碼
/**
* Copyright(c)
* All rights reserved.
* Author : Mingzhe
* Date : 2018-11-04-11.01.41
* Description : sample
*/
#include <cstdio>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <cstdlib>
#include <map>
#include <list>
#include <stack>
#include <queue>
#include <string>
#include <cstring>
#include <memory.h>
#define MAXN 10005
#define INF 0x3f3f3f3f
using namespace std;
typedef long long ll;
int trueg[MAXN];
int falseg[MAXN];
int a[15];
int b[15];
int main()
{
int n;
int p=1;
while(cin>>n){
if(n==0)break;
printf("Game %d:\n",p++);
memset(a,0,sizeof(a));
for(int i=0;i<n;i++){
scanf("%d",&trueg[i]);
a[ trueg[i] ]++;
}
while(1){
int amount = 0;
int sum1=0,sum2=0;
memset(b,0,sizeof(b));
for(int i=0;i<n;i++){
scanf("%d",&falseg[i]);
b[ falseg[i] ]++;
if(falseg[i]==0){
amount++;
}
if(falseg[i]==trueg[i]){
sum1++;
}
}
for(int i=0;i<=9;i++)
{
if(a[i]<b[i]) sum2 += a[i];
else sum2 += b[i];
}
if(amount == n)break;
printf(" (%d,%d)\n",sum1,sum2-sum1);
}
}
return 0;
}