백준 9366번: 삼각형 분류

https://www.acmicpc.net/problem/9366

1. 문제

2. 알고리즘

키워드 - 구현

3. 코드

#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
 
#define c_reverse(s) reverse(s.begin(), s.end())
 
#define print_vector(v) for(int i=0; i<v.size(); i++) cout << v[i];
 
int main() {
 
    cin.tie(0);
    std::ios::sync_with_stdio(false);
 
    int n; cin >> n;
    for(int i=1; i<=n; i++){
        int a[3];
        cin >> a[0] >> a[1] >> a[2];
        sort(a, a+3);
        cout << "Case #" << i << ": ";
        if(a[0]+a[1] <= a[2]) cout << "invalid!";
        else if(a[0] == a[1] && a[1] == a[2]) cout << "equilateral";
        else if(a[0] == a[1] || a[1] == a[2]) cout << "isosceles";
        else cout << "scalene";
        cout << CENDL;
    }
 
    return 0; 
}