View Code of Problem 23

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
using namespace std;

int main()
{
    long long big[92];
    long long small[92];
    int n;
    small[0] = 0,small[1] = 1,small[2] = 1,small[3] = 1;
    big[0] = 0,big[1] = 0,big[2] = 1,big[3] = 1;
    for(int i =4;i<=91;i++)
    {
        small[i] = big[i-1];
        big[i] = small[i-1] + big[i-1];
    }
    while(scanf("%d",&n))
    {
        if(n==0)
            break;
        else if(n==1)
            printf("1\n");
        else
        {
            printf("%lld\n",big[n+1]+small[n+1]);
        }    
    }
	return 0;
}