구현(Implementation)
백준 5656번: 비교 연산자
cepiloth
2018. 8. 5. 17:08
반응형
https://www.acmicpc.net/problem/5656
1. 문제
2. 알고리즘
키워드 - 구현
3. 코드
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 | #include <iostream> #include <sstream> #include <string> #include <algorithm> #include <functional> #include <vector> #include <list> #include <queue> #include <deque> #include <map> #include <set> #include <stack> #include <math.h> #include <memory.h> using namespace std; #define MAX_SIZE 100 #define INF 0x7fffffff #define CENDL "\n" #define ll long long int main() { cin.tie(0); std::ios::sync_with_stdio(false); int count = 1; while(true) { int a, b; string s; cin >> a >> s >> b; if (s == "E") { break; } cout << "Case " << count << ": "; if (s == "<") { if (a < b) { cout << "true"; } else { cout << "false"; } } else if(s == "<=") { if (a <= b) { cout << "true"; } else { cout << "false"; } } else if (s == ">") { if (a > b) { cout << "true"; } else { cout << "false"; } } else if(s == ">=") { if (a >= b) { cout << "true"; } else { cout << "false"; } } else if (s == "==") { if (a == b) { cout << "true"; } else { cout << "false"; } } else if(s == "!=") { if (a != b) { cout << "true"; } else { cout << "false"; } } cout << CENDL; count++; } return 0; } | cs |
반응형