#UVa:340-Master-Mind Hints

利用兩個boolean陣列去紀錄答案與猜測的兩陣列中哪些已經被比過了,這樣去找幾A幾B就沒有問題了。

C++(0.032)

/*******************************************************/
/* UVa 340 Master-Mind Hints                           */
/* Author: LanyiKnight [at] knightzone.studio             */
/* Version: 2013/05/01                                 */
/*******************************************************/
#include <iostream>
#include <cstdio>
using namespace std;

bool isAllZero( int N, int password[] ){
  for( int i = 0 ; i < N ; i++ )
    if( password[i] != 0 ) return false;
  return true;
}

int main(){
  int gameNum = 1;
  int N;

  while( scanf("%d", &N ) != EOF && N != 0 ){
    int password[1005], guestPassword[1005];

    printf( "Game %d:\n", gameNum++ );

    for( int i = 0 ; i < N ; ++i )
      scanf( "%d", &password[i] );

    while( true ){
      for( int i = 0 ; i < N ; ++i )
        scanf( "%d", &guestPassword[i] );
      if( isAllZero( N, guestPassword ) ) break;

      bool checkCorrect[1005] = {false};
      bool checkGuest[1005] = {false};
      int A = 0, B = 0;
      for( int i = 0 ; i < N ; ++i ){
        if( password[i] == guestPassword[i] ){
          ++A;
          checkCorrect[i] = true;
          checkGuest[i] = true;
        }
      }

      for( int i = 0 ; i < N ; ++i ){
        if( checkCorrect[i] ) continue;
        for( int j = 0 ; j < N ; ++j ){
          if( checkGuest[j] ) continue;
          if( i != j && password[i] == guestPassword[j] &&
              !checkCorrect[i] && !checkGuest[j] ){
            ++B;
            checkCorrect[i] = true;
            checkGuest[j] = true;
          }
        }
      }

      printf( " (%d,%d)\n", A, B );
    }

  }

  return 0;
}
廣告

Comment

There is no comment on this post. Be the first one.

發表迴響

這個網站採用 Akismet 服務減少垃圾留言。進一步瞭解 Akismet 如何處理網站訪客的留言資料

%d 位部落客按了讚: