[알고리즘문제] 백준_음계

내일은 이거 풀어야지

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

풀었당.

#include <iostream>>
#define SIZE 100
using namespace std;
 
int main()
{
    char scale[SIZE] = { 0, };
    int i = 0;
    int curNum = 0;
    int jumpNum = 0;
 
    // ascending, descending
    bool check_adm[3] = { false, false };
 
    cin.getline(scale, sizeof(scale));        // 입력    
 
    while (scale[i + 2] != 0)                // 검사
    {
        curNum = (int)scale[i] - 48;
        jumpNum = (int)scale[i + 2] - 48;
 
        if (curNum >= 0)
        {
            if (curNum < jumpNum)
            {
                check_adm[0] = true;
            }
            else
            {
                check_adm[1] = true;
            }
        }
            
        i++;
    }
 
    if (check_adm[0] == true && check_adm[1] == false)
    {
        cout << "ascending" << endl;
    }
    else if (check_adm[0] == false && check_adm[1] == true)
    {
        cout << "descending" << endl;
    }
    else
    {
        cout << "mixed" << endl;
    }
}