//pointer
/*
#include <stdio.h>
int main()
{
int a=5;
int* pa = &a;
//int * pa;
//int *pa;
printf("a : %d\n",a);
printf("&a : %d\n",&a);
printf("pa : %d\n",pa);
printf("*pa : %d\n",*pa);
return 0;
}
*/
/*
#include <stdio.h>
int myswap(int* a, int* b)
{
int temp;
if (*a>*b)
{
temp=*a;
*a=*b;
*b=temp;
}
}
main()
{
int a, b;
scanf("%d%d", &a, &b);
myswap(&a, &b);
printf("%d %d", a, b);
}
*/
/*
int main()
{
int A, B, C, T;
scanf("%d", &T);
if (T%10!=0)
{
printf("-1");
return 0;
}
else
{
A=T/300;
T%=300;
B=T/60;
T%=60;
C=T/10;
T%=10;
}
printf("%d %d %d", A, B, C);
}
*/
#include <stdio.h>
#include <string.h>
int NUMBERSTRING(int n)
{
int a=0, b=0, c=0, d=0, e=0, f=0;
if (n>100000000)
{
a=n/100000000;
printf("%d억", a);
n=n-(a*1000000000);
}
if (n>10000)
{
b=n/10000;
printf("%d만", b);
n=n-b*10000;
}
if (n>1000)
{
c=n/1000;
printf("%d천", c);
n=n-c*1000;
}
if (n>100)
{
d=n/100;
printf("%d백", d);
n=n-d*100;
}
if (n>10)
{
e=n/10;
printf("%d십", e);
n=n-e*10;
}
printf("%d", n);
}
int main()
{
int n;
scanf("%d", &n);
NUMBERSTRING(n);
return 0;
}
//array ♡ pointer
/*
#include <stdio.h>
int main()
{
char str[100];
scanf("%s",str);
//배열의 이름은 배열의 첫번째 원소의 주소이다
//str[0] str[1] str[2]
//str == &str[0]
printf("str : %d\n",str);
printf("&str[0] : %d\n",&str[0]);
printf("*str : %c\n",*str);
printf("*(str+1) : %c\n",*(str+1));
int arr[100]={7,8,9};
printf("arr : %d\n",arr);
printf("&arr[0] : %d\n",&arr[0]);
printf("*arr : %d\n",*arr);
printf("arr+1 : %d\n",arr+1);
printf("*(arr+1) : %d\n",*(arr+1));
// str[i] == *(str+i) != *str+i
}
*/
/*
#include <stdio.h>
//void f(int* arr1, int len)
void f(int arr1[], int len)
{
printf("arr1 : %d",*arr1);
}
int main()
{
int arr[100]={7,8,9};
f(arr,3);
//printf("arr : %d\n",arr);
// printf("&arr[0] : %d\n",&arr[0]);
}
#include <stdio.h>
int main()
{
int N, C, M, i, j, arr[3][10000];
scanf("%d %d", &N, &C);
scanf("%d", &M);
for (i=0;i<M;i++)
{
scanf("%d %d %d", &s[i], &a[i], b[i]);
}
for (i=0;i<N;i++)
{
}
}
*/