#55198: cpp_answer


yp11451202@yphs.tp.edu.tw (705-38黃鈺潤)


#include <iostream>
#include <algorithm>

using namespace std;

int main() {
    int s[3];
    
    // 輸入三個正整數
    if (!(cin >> s[0] >> s[1] >> s[2])) return 0;
    
    // 由小到大排序,確保 s[2] 為最大值 (c)
    sort(s, s + 3);
    
    // 輸出排序後的邊長
    cout << s[0] << " " << s[1] << " " << s[2] << endl;
    
    // 判斷三角形類型
    // 根據題目提示:a = s[0], b = s[1], c = s[2]
    if (s[0] + s[1] <= s[2]) {
        cout << "No" << endl;
    } else {
        int a2_plus_b2 = s[0] * s[0] + s[1] * s[1];
        int c2 = s[2] * s[2];
        
        if (a2_plus_b2 < c2) {
            cout << "Obtuse" << endl;
        } else if (a2_plus_b2 == c2) {
            cout << "Right" << endl;
        } else {
            cout << "Acute" << endl;
        }
    }
    
    return 0;
}