题解 | #三角形判断#

#include<bits/stdc++.h>
using namespace std;
int main()
{
    vector<vector<int>> triGrp;
    vector<int> tri;
    int tmp;
    int count=0;
    int countG=0;
    while(cin>>tmp)
    {
        tri.push_back(tmp);
        count++;
        if(!(count%3))
        {
            sort(tri.begin(), tri.end());
            triGrp.push_back(tri);
            tri.clear();
            countG++;
        }            
    }
    count = 0;
    while(count!=countG)
    {
        if(triGrp[count][0]+triGrp[count][1]>triGrp[count][2])
        {
            if(triGrp[count][0]==triGrp[count][2])
                cout<<"Equilateral triangle!"<<endl;
            else if(triGrp[count][0]==triGrp[count][1]||triGrp[count][1]==triGrp[count][2])
              cout<<"Isosceles triangle!"<<endl;
            else
               cout<<"Ordinary triangle!"<<endl;
        }
        else
            cout<<"Not a triangle!"<<endl;
        count++;
    }
    return 0;
}