#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(int argc, char** argv)
{
vector<int> num;
bool same=true;
for(int i=0; i<8; i++){
int n;
cin >> n;
num.push_back(n);
}
vector<int> ascending = num;
vector<int> descending = num;
sort(ascending.begin(), ascending.end());
if(ascending == num) {
cout << "ascending" << endl;
return 0;
}
sort(descending.begin(), descending.end(), [](int a, int b)
{
return a > b;
});
if(descending == num){
cout << "descending" << endl;
return 0;
}
cout << "mixed" << endl;
return 0;
}
[백준(BOJ)] 2178번: 미로 탐색 (C++) (0) | 2023.09.08 |
---|---|
[프로그래머스] 게임 맵 최단거리 (C++) (0) | 2023.09.08 |
[Softeer] 성적 평가 (C++) (0) | 2023.09.05 |
[Softeer] 장애물 인식 프로그램 (C++) (0) | 2023.08.12 |
[Softeer] GBC (C++) (0) | 2023.08.12 |