/*题目链接*/
题意:求斐波那契数列的前N项和。
题目分析:
将求前N项和转化为求斐波那契数列的第N+2项-1,考虑到0<N<1000000000,直接求会超时,所以采用矩阵快速幂。
AC代码:
#include <algorithm>
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <numeric>
#include <cstring>
#include <climits>
#include <cassert>
#include <complex>
#include <cstdio>
#include <string>
#include <vector>
#include <bitset>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <list>
#include <set>
#include <map>
typedef long long LL;
const int MOD = int(100000000);
using namespace std;
struct Mat{
LL f[2][2];
};
Mat operator *(Mat &a, Mat &b)
{
Mat c;
c.f[0][0] = (a.f[0][0]*b.f[0][0]+a.f[0][1]*b.f[1][0])%MOD;
c.f[1][0] = (a.f[1][0]*b.f[0][0]+a.f[1][1]*b.f[1][0])%MOD;
c.f[0][1] = (a.f[0][0]*b.f[0][1]+a.f[0][1]*b.f[1][1])%MOD;
c.f[1][1] = (a.f[1][0]*b.f[0][1]+a.f[1][1]*b.f[1][1])%MOD;
return c;
}
Mat operator ^(Mat &a, int k)
{
Mat c;
c.f[0][0] = c.f[1][1] = 1;
c.f[0][1] = c.f[1][0] = 0;
for (; k; k >>= 1)
{
if (k&1)
c = c*a;
a = a*a;
}
return c;
}
int main()
{
LL n;
while (~scanf("%I64d",&n))
{
Mat a;
a.f[0][0] = a.f[0][1] = a.f[1][0] = 1;
a.f[1][1] = 0;
a = a^n;
cout << (a.f[0][0]+a.f[0][1]-1)%MOD << endl;
}
return 0;
}