/**
#include<stdio.h>
int f(int n)
{
if (n == 1) return 1;
return f(n - 1) * n;
}
int main()
{
int n;
scanf("%d", &n);
printf("%d", f(n));
return 0;
}
f(n) : 피보나치 n번째수 .
#include<stdio.h>
int arr[201]={};
int f(int n)
{
if(arr[n]!=0) return arr[n];
if(n<=2) return 1;
return arr[n]=(f(n-1)+f(n-2))%10009;
}
int main()
{
int n;
scanf("%d", &n);
printf("%d", f(n));
}
#include <stdio.h>
int n;
void f(int a)
{
if (a == 1)
{
return ;
}
if (a % 2 != 0)
{
a *= 3;
a ++;
f(a);
printf("%d\n", a);
}
else
{
a /= 2;
f(a);
printf("%d\n",a);
}
}
int main()
{
scanf("%d", &n);
f(n);
printf("%d\n",n);
return 0;
}
#include<stdio.h>
int arr[1001][1001] = {};
int f(int x, int y)
{
if (x == 1 || y == 1)
{
return 1;
}
if (arr[x][y] != 0)
{
return arr[x][y];
}
return arr[x][y] = arr[y][x] = (f(x, y - 1) + f(x - 1, y)) % 100000000;
}
int main()
{
int x,y;
scanf("%d %d", &x, &y);
printf("%d", f(x,y));
}
**/