HDU - 5686 Problem B

1．题面

２．题意

３．思路

４．代码

/*****************************************************************
> File Name: Cpp_Acm.cpp
> Author: Uncle_Sugar
> Mail: uncle_sugar@qq.com
> Created Time: 2016年05月14日 星期六 20时23分59秒
*****************************************************************/
# include <cstdio>
# include <cstring>
# include <cctype>
# include <cmath>
# include <cstdlib>
# include <climits>
# include <iostream>
# include <iomanip>
# include <set>
# include <map>
# include <vector>
# include <stack>
# include <queue>
# include <algorithm>
using namespace std;

const int debug = 1;
const int size  = 100 + 10;
const int INF = INT_MAX>>1;
typedef long long ll;

struct bigint{
int num[size];
int len;
bigint():len(0){
memset(num,0,sizeof(num));
}
bigint(int n):len(0){
memset(num,0,sizeof(num));
while (n>0){
num[len++] = n%10;
n /= 10;
}
}
bigint operator + (const bigint& oper){
bigint ret;
int k = max(oper.len,len);
int rest = 0;
int i;
for (i=0;i<k;i++){
ret.num[i] = oper.num[i] + num[i] + rest;
rest = ret.num[i]/10;
ret.num[i] %= 10;
}
ret.len = k;
while (rest!=0){
ret.num[ret.len++] = rest%10;
rest /= 10;
}
return ret;
}
void Print(){
for (int i = len-1;i>=0;i--){
cout << num[i];
}
cout << endl;
}
};
bigint bi[200+10];
int main()
{
std::ios::sync_with_stdio(false);cin.tie(0);
int i,j;
bi[1] = bigint(1);
bi[2] = bigint(2);
for (i=3;i<=200;i++)
bi[i] = bi[i-1] + bi[i-2];
int n;
while (cin >> n){
bi
.Print();
}
return 0;
}