문제 링크입니다: www.acmicpc.net/problem/19602
19602번: Dog Treats
There are three lines of input. Each line contains a non-negative integer less than 10. The first line contains the number of small treats, S, the second line contains the number of medium treats, M, and the third line contains the number of large treats,
www.acmicpc.net
간단한 구현 문제였습니다.
This file contains 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 HAPPY = 10; | |
| int main(void) | |
| { | |
| ios_base::sync_with_stdio(0); | |
| cin.tie(0); | |
| int S, M, L; | |
| cin >> S >> M >> L; | |
| int mood = S + 2 * M + 3 * L; | |
| cout << (mood >= HAPPY ? "happy\n" : "sad\n"); | |
| return 0; | |
| } |
개발환경:Visual Studio 2017
지적, 조언, 질문 환영입니다! 댓글 남겨주세요~
반응형
'알고리즘 > BOJ' 카테고리의 다른 글
| 백준 5102번 Sarah's Toys (0) | 2021.03.28 |
|---|---|
| 백준 19698번 헛간 청약 (0) | 2021.03.27 |
| 백준 18414번 X に最も近い値 (0) | 2021.03.27 |
| 백준 18411번 試験 (0) | 2021.03.27 |
| 백준 18408번 3 つの整数 (0) | 2021.03.27 |