/*
4624 괄호의 값
#include <stdio.h>
int stack[31] = {};
int top = -1;
void push(int x)
{
top++;
stack[top] = x;
}
int pop()
{
if (top < 0)
{
return 0;
}
return stack[top--];
}
int main()
{
char arr[31] = {};
int i;
scanf("%s", arr);
int wrong = 0;
for (i = 0; arr[i] != '\0'; i++)
{
if (arr[i] == '(') push(-1);
else if (arr[i] == '[') push(-2);
else if (arr[i] == ')')
{
int sum = 0;
while (top >= 0 && stack[top] > 0)
{
sum = sum + pop();
}
if (top < 0 || stack[top] != -1)
{
wrong = 1;
break;
}
pop();
if (sum == 0) push(2);
else push(sum * 2);
}
else if (arr[i] == ']')
{
int sum = 0;
while (top >= 0 && stack[top] > 0)
{
sum = sum + pop();
}
if (top < 0 || stack[top] != -2)
{
wrong = 1;
break;
}
pop();
if (sum == 0) push(3);
else push(sum * 3);
}
}
int result = 0;
while (top >= 0 && stack[top] > 0)
{
result = result + pop();
}
if (top >= 0) wrong = 1;
if (wrong) printf("0\n");
else printf("%d\n", result);
return 0;
}
*/
/*
1861 파스칼의 삼각형2
#include <stdio.h>
int memo[30][30]= {};
int f(int r, int c)
{
if(c==0 || c==r) return 1;
if(memo[r][c]!=0) return memo[r][c];
return memo[r][c] = f(r-1,c-1) + f(r-1,c);
}
void pf(int r, int c, int n)
{
if(r==n)
return ;
if(c>r)
{
printf("\n");
pf(r+1,0,n);
return ;
}
printf("%d ",f(r,c));
pf(r,c+1,n);
}
int main()
{
int n;
scanf("%d",&n);
pf(0,0,n);
return 0;
}
*/
/*
1919 숫자 거꾸로 출력하기
#include <stdio.h>
long long int f(long long int k, int t)
{
if(t==0)
{
if(k%10 == 0)
{
return f(k/10,0);
}
return f(k,1);
}
if(k<10) return k%10;
printf("%lld",k%10);
return f(k/10,1);
}
int main()
{
long long int n;
scanf("%lld",&n);
if(n==0) printf("0");
else printf("%lld", f(n,0));
return 0;
}
*/
4564 계단 오르기
#include <stdio.h>
int main()
{
int n;
int arr[301]={};
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d",arr);
}
return 0;
}