백준 14456 (C++) Hoof, Paper, Scissors (Bronze)

최초 업로드: 2025-10-18 07:36:30

최근 수정 시간: 2025-10-18 07:36:30

게시자: rlatjwls3333

카테고리: 백준

# [Bronze I] Hoof, Paper, Scissors (Bronze)

[문제 링크](https://www.acmicpc.net/problem/14456)

## 문제 설명

You have probably heard of the game "Rock, Paper, Scissors". The cows like to play a similar game they call "Hoof, Paper, Scissors".

The rules of "Hoof, Paper, Scissors" are simple. Two cows play against each-other. They both count to three and then each simultaneously makes a gesture that represents either a hoof, a piece of paper, or a pair of scissors. Hoof beats scissors (since a hoof can smash a pair of scissors), scissors beats paper (since scissors can cut paper), and paper beats hoof (since the hoof can get a papercut). For example, if the first cow makes a "hoof" gesture and the second a "paper" gesture, then the second cow wins. Of course, it is also possible to tie, if both cows make the same gesture.

Farmer John watches in fascination as two of his cows play a series of N games of "Hoof, Paper, Scissors" (1 ≤ N ≤ 100). Unfortunately, while he can see that the cows are making three distinct types of gestures, he can't tell which one represents "hoof", which one represents "paper" and which one represents "scissors" (to Farmer John's untrained eye, they all seem to be variations on "hoof"...)

Not knowing the meaning of the three gestures, Farmer John assigns them numbers 1, 2, and 3. Perhaps gesture 1 stands for "hoof", or maybe it stands for "paper"; the meaning is not clear to him. Given the gestures made by both cows over all N games, please help Farmer John determine the maximum possible number of games the first cow could have possibly won, given an appropriate mapping between numbers and their respective gestures.

## 입력

The first line of the input file contains N.

Each of the remaining N lines contain two integers (each 1, 2, or 3), describing a game from Farmer John's perspective.

## 출력

Print the maximum number of games the first of the two cows could possibly have won.

## 풀이
n이 100개여서 가능한 매핑을 미리 찾아 놓고, 전부 돌려보면 됩니다.

``` c++
#include<bits/stdc++.h>
using namespace std;

int beat[2][4] = {
    {0, 2, 3, 1},
    {0, 3, 1, 2},
};

int arr[100][2];

int main() {
 ios::sync_with_stdio(0); cin.tie(0);
 int n; cin >> n;
 for(int i=0;i<n;i++) cin >> arr[i][0] >> arr[i][1];

int maxCnt=0;
 for(int i=0;i<2;i++) {
 int cnt=0;
 for(int j=0;j<n;j++) {
 if(beat[i][arr[j][0]]==arr[j][1]) cnt++;
 }
 maxCnt = max(maxCnt, cnt);
 }
 cout << maxCnt;
}
```