大菲波数
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 23754 Accepted Submission(s): 8517
Problem Description
Fibonacci数列,定义如下:
f(1)=f(2)=1
f(n)=f(n-1)+f(n-2) n>=3。
计算第n项Fibonacci数值。
Input
输入第一行为一个整数N,接下来N行为整数Pi(1<=Pi<=1000)。
Output
输出为N行,每行为对应的f(Pi)。
Sample Input
5
1
2
3
4
5
Sample Output
1
1
2
3
5
复习一下高精度。
AC代码:
#include<iostream>
#include<sstream>
#include<algorithm>
#include<string>
#include<cstring>
#include<iomanip>
#include<vector>
#include<cmath>
#include<ctime>
#include<stack>
#include<queue>
using namespace std;
struct Wint:vector<int>
{
Wint(int n=0)
{
push_back(n);
check();
}
Wint& check()
{
while(!empty()&&!back()) pop_back();
if(empty()) return *this;
for(int i=1;i<size();i++)
{
(*this)[i]+=(*this)[i-1]/10;
(*this)[i-1]%=10;
}
while(back()>=10)
{
push_back(back()/10);
(*this)[size()-2]%=10;
}
return *this;
}
};
istream& operator >>(istream& is,Wint& n)
{
string s;
is>>s;
n.clear();
for(int i=s.size()-1;i>=0;i--) n.push_back(s[i]-'0');
return is;
}
ostream& operator <<(ostream& os,Wint& n)
{
if(n.empty()) os<<0;
for(int i=n.size()-1;i>=0;i--) os<<n[i];
return os;
}
bool operator != (Wint& a,Wint& b)
{
if(a.size()!=b.size()) return 1;
for(int i=a.size()-1;i>=0;i--)
if(a[i]!=b[i]) return 1;
return 0;
}
bool operator == (Wint& a,Wint& b)
{
return !(a!=b);
}
bool operator < (Wint& a,Wint& b)
{
if(a.size()!=b.size()) return a.size()<b.size();
for(int i=a.size()-1;i>=0;i--)
if(a[i]!=b[i]) return a[i]<b[i];
return 0;
}
bool operator > (Wint& a,Wint& b)
{
return b<a;
}
Wint& operator += (Wint& a,Wint& b)
{
if(a.size()<b.size()) b.resize(a.size());
for(int i=0;i!=b.size();i++) a[i]+=b[i];
return a.check();
}
Wint operator + (Wint a,Wint& b)
{
return a+=b;
}
Wint operator * (Wint a,Wint& b)
{
Wint n;
n.assign(a.size()+b.size()-1,0);
for(int i=0;i!=a.size();i++)
for(int j=0;j!=b.size();j++)
n[i+j]+=a[i]*b[j];
return n.check();
}
int main()
{
int N,P;
cin>>N;
Wint F[1001];
F[1]=1;F[2]=1;
for(int i=3;i<=1000;i++)
F[i]=F[i-1]+F[i-2];
while(N--)
{
cin>>P;
cout<<F[P]<<endl;
}
}