문제 링크입니다: https://www.acmicpc.net/problem/8815
8815번: Test
Hektor lubi kartkówki w formie testów w których każde pytanie ma cztery możliwe odpowiedzi ( A, B, C lub D ). Kiedy nie zna prawidłowych odpowiedzi, zamiast strzelać, zaznacza odpowiedzi według schematu: W pierwszym zadaniu odpowiedź A W drugim za
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 = 12; | |
int main(void) | |
{ | |
ios_base::sync_with_stdio(0); | |
cin.tie(0); | |
int Z; | |
cin >> Z; | |
char result[MAX] = { 'A', 'B', 'C', 'B', 'C', 'D', 'C', 'D', 'A', 'D', 'A', 'B' }; | |
for (int z = 0; z < Z; z++) | |
{ | |
int N; | |
cin >> N; | |
cout << result[(N - 1) % MAX] << "\n"; | |
} | |
return 0; | |
} |


개발환경:Visual Studio 2017
지적, 조언, 질문 환영입니다! 댓글 남겨주세요~
반응형
'알고리즘 > BOJ' 카테고리의 다른 글
백준 9085번 더하기 (0) | 2021.06.28 |
---|---|
백준 8932번 7종 경기 (0) | 2021.06.28 |
백준 8806번 Papier kamień nożyczki (0) | 2021.06.27 |
백준 8725번 Szachy (0) | 2021.06.27 |
백준 8721번 Wykreślanka (0) | 2021.06.27 |