小G的GCD 题解(思维)
题目链接
题目思路
打表找规律或者思考会发现是斐波那契最优
斐波那契真有用qwq
代码
#include<bits/stdc++.h>
#define fi first
#define se second
#define debug cout<<"I AM HERE"<<endl;
using namespace std;
typedef long long ll;
const int maxn=1e5+5,inf=0x3f3f3f3f,mod=1e9+7;
const double eps=1e-6;
typedef pair<int,int> pii;
const ll INF=0x3f3f3f3f3f3f3f3f;
ll n;
ll fac[100];
signed main(){
scanf("%lld",&n);
fac[1]=fac[2]=1;
for(int i=3;;i++){
fac[i]=fac[i-1]+fac[i-2];
if(fac[i]>n){
printf("%d",i-1);
break;
}
}
return 0;
}
不摆烂了,写题