/*#include<stdio.h>
int main() {
printf("Hello");
return 0;
}
/*#include<stdio.h>
int main()
{
printf("\"Hello World\"");
return 0;
}
#include<stdio.h>
int main()
{
printf("\"C:\\Download\\hello.cpp\"");
return 0;
}
#include<stdio.h>
int main()
{
int n;
scanf("%d", &n);
printf("%d", n);
return 0;
}
#include<stdio.h>
int main()
{
int h, m;
scanf("%d:%d", &h, &m);
printf("%d:%d", h, m);
return 0;
}
#include<stdio.h>
int main()
{
long long int a;
scanf("%lld", &a);
a++;
printf("%lld", a);
return 0;
}
#include<stdio.h>
int main()
{
long long int a, b;
scanf("%lld %lld", &a, &b);
printf("%lld\n%lld\n%lld\n%lld\n%lld\n", a+b, a-b, a*b, a/b, a%b);
printf("%.2f", (float)a/(float)b);
return 0;
}
#include<stdio.h>
int main()
{
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
printf("%d\n", a+b+c);
printf("%.1f", ((float)a+(float)b+(float)c)/3);
return 0;
}
#include<stdio.h>
int main()
{
int a, b;
scanf("%d %d", &a, &b);
printf("%d", a==b);
return 0;
}
#include<stdio.h>
int main()
{
int a, b;
scanf("%d %d", &a, &b);
printf("%d", a!=b);
return 0;
}
#include<stdio.h>
int main()
{
int a, b;
scanf("%d %d", a, b);
printf("%d" , a||b);
return 0;
}
#include<stdio.h>
int main()
{
int a, b;
scanf("%d, %d", &a, &b);
printf("%d", ab);
return 0;
}
#include<stdio.h>
int main()
{
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
printf("%d", (a<b?a:b)<c?(a<b?a:b):c);
return 0;
}
*/
#include<stdio.h>
int main()
{
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if(a+b>c)
{
if(a==b&&b==c)
{
printf("정삼각형");
}
else if(a==b||b==c||c==a)
{
printf("이등변삼각형");
}
else if(a*a+b*b==c*c)
{
printf("직각삼각형");
}
else
{
printf("삼각형");
}
}
else
{
printf("삼각형아님");
}
}
출력문(printf)
1002, 1005, 1007
입력문(scanf)
1010. 1015, 1018,
산술연산자(+, -, *, /, %)
1044, 1045, 1046
비교연산자(>, >=, <, <=, ==, !=)
1050, 1052
논리연산자(&&-그리고, ||, !)
1054, 1056, 1057
삼항연산자( A ? B : C)
1064,
조건문1(if, else, else if)
1218, 1180, 1212
조건문2(switch ~ case)
1202, 1207
단순 반복문(for, while, do ~ while)
for > 1266, 1254, 1273
while > 1255, 1271, 1274
do ~ while > 1279, 1282, 1091
중첩 반복문
static > 1356, 1365, 1369
normal > 1353, 1358
1차원 배열( int arr[5] )
1402, 1403, 1405, 1440, 1430
모름
1015, 1054, 1056, 1057