大佬的详解
代码:
// Problem: 六级的烦恼
// Contest: QDUOJ
// URL: https://qduoj.com/problem/22Spring3
// Memory Limit: 256 MB
// Time Limit: 1000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<complex>
#include<cstring>
#include<cmath>
#include<vector>
#include<map>
#include<unordered_map>
#include<list>
#include<set>
#include<queue>
#include<stack>
#define OldTomato ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr)
#define fir(i,a,b) for(int i=a;i<=b;++i)
#define mem(a,x) memset(a,x,sizeof(a))
#define p_ priority_queue
// round() 四舍五入 ceil() 向上取整 floor() 向下取整
// lower_bound(a.begin(),a.end(),tmp,greater<ll>()) 第一个小于等于的
// #define int long long //QAQ
using namespace std;
typedef complex<double> CP;
typedef pair<int,int> PII;
typedef long long ll;
// typedef __int128 it;
const double pi = acos(-1.0);
const int INF = 0x3f3f3f3f;
const ll inf = 1e18;
const int N = 2e5+10;
const int M = 1e6+10;
const int mod = 1e9+7;
const double eps = 1e-6;
inline int lowbit(int x){ return x&(-x);}
template<typename T>void write(T x)
{
if(x<0)
{
putchar('-');
x=-x;
}
if(x>9)
{
write(x/10);
}
putchar(x%10+'0');
}
template<typename T> void read(T &x)
{
x = 0;char ch = getchar();ll f = 1;
while(!isdigit(ch)){if(ch == '-')f*=-1;ch=getchar();}
while(isdigit(ch)){x = x*10+ch-48;ch=getchar();}x*=f;
}
int n,m,k,T;
struct Matrix
{
ll a[3][3];
Matrix()
{
mem(a,0);
}
void init()
{
a[1][1] = a[1][2] = a[2][1] = 1;
}
Matrix operator*(const Matrix&b)
{
Matrix ans;
for(int i=1;i<=2;++i)
{
for(int j=1;j<=2;++j)
{
for(int k=1;k<=2;++k)
{
ans.a[i][j] = (ans.a[i][j] + a[i][k] * b.a[k][j]) % mod; //第i行乘以第j列
}
}
}
return ans;
}
};
ll qpow(ll n)
{
Matrix res,base;
base.init();
res.init();
while(n > 0)
{
if(n & 1) res = res * base;
base = base * base;
n >>= 1;
}
return res.a[1][1];
}
void solve()
{
read(n);
write(qpow(n-2)); //res是base,求res * base的n-2次幂 = (base)(n-1).
}
signed main(void)
{
T = 1;
// OldTomato; cin>>T;
// read(T);
while(T--)
{
solve();
}
return 0;
}