View Code of Problem 23

#include<iostream>
//#include<cmath>
using namespace std;
void find(int,int);
int main(){
	int n,num[100] = { };
	num[1] = 1;
	num[2] = 2;
	while(~scanf("%d",&n)&&n!=0){
		if(n == 1)printf("%d\n",1);
		else if(n == 2)printf("%d\n",2);
		else{
			for(int i = 3;i<=n;i++){
				num[i] = num[i-1] + num[i-2];
			}
			printf("%d\n",num[n]);
		}
	}
	return 0;
}