12459 - Bees' ancestors solutions

#include<iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <sstream>
#include <utility>
#include <set>
#include <math.h>
using namespace std;
int main()
{
    int i,j,k;
    int n;
    long long fib[85];
    fib[0]=1;
    fib[1]=1;
    for(i=2; i<=80; i++)
        fib[i]=fib[i-1]+fib[i-2];
    while(scanf("%d",&n)==1&& n)
    {
        printf("%lld\n",fib[n]);
    }
}