문제 링크입니다: https://www.acmicpc.net/problem/8806
8806번: Papier kamień nożyczki
W pierwszej linii wejścia znajduje się liczba zestawów testowych Z ( 1 <= Z <= 10 ). Pierwsza linia pojedynczego zestawu testowego zawiera liczby X1 Y1 Z1 ( 0 <= X1, Y1, Z1 <= 1, X1 + Y1 + Z1 = 1) określające z jakim prawdopodobieństwem
www.acmicpc.net
간단한 구현 문제였습니다.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <iostream> | |
using namespace std; | |
const int MAX = 3; | |
int main(void) | |
{ | |
ios::sync_with_stdio(0); | |
cin.tie(0); | |
int Z; | |
cin >> Z; | |
for (int z = 0; z < Z; z++) | |
{ | |
double adamPercentage[MAX]; | |
double gosiaPercentage[MAX]; | |
for (int i = 0; i < MAX; i++) | |
{ | |
cin >> adamPercentage[i]; | |
} | |
for (int i = 0; i < MAX; i++) | |
{ | |
cin >> gosiaPercentage[i]; | |
} | |
double adam = 0, gosia = 0; | |
for (int i = 0; i < MAX; i++) | |
{ | |
adam += adamPercentage[i] * gosiaPercentage[(i + 1) % MAX]; | |
gosia += adamPercentage[i] * gosiaPercentage[(i + 2) % MAX]; | |
} | |
if (adam > gosia) | |
{ | |
cout << "ADAM\n"; | |
} | |
else if (adam == gosia) | |
{ | |
cout << "=\n"; | |
} | |
else | |
{ | |
cout << "GOSIA\n"; | |
} | |
} | |
return 0; | |
} |


개발환경:Visual Studio 2017
지적, 조언, 질문 환영입니다! 댓글 남겨주세요~
반응형
'알고리즘 > BOJ' 카테고리의 다른 글
백준 8932번 7종 경기 (0) | 2021.06.28 |
---|---|
백준 8815번 Test (0) | 2021.06.28 |
백준 8725번 Szachy (0) | 2021.06.27 |
백준 8721번 Wykreślanka (0) | 2021.06.27 |
백준 8719번 Piłeczka (0) | 2021.06.27 |