프로그래밍/알고리즘
백준 2920 음계
ILove_NS_MoKa
2019. 8. 30. 23:13
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
|
#include <iostream>
#include <string.h>
using namespace std;
string GetString(int list[] , int size)
{
string str = "";
for (int idx = 0; idx < size-1; idx++)
{
if (list[idx + 1] == list[idx] + 1)
{
str = "ascending";
}
else if (list[idx + 1] == list[idx] - 1)
{
str = "descending";
}
else
{
str = "mixed";
return str;
}
}
return str;
}
int main()
{
const int size = 8;
int input = 0;
int list[size];
for (int idx =0 ; idx < size ; idx++)
{
scanf("%d", &input);
list[idx] = input;
}
printf("%s", GetString(list,size).c_str());
return 0;
}
http://colorscripter.com/info#e" target="_blank" style="color:#4f4f4ftext-decoration:none">Colored by Color Scripter
|
http://colorscripter.com/info#e" target="_blank" style="text-decoration:none;color:white">cs |