BZOJ 2796: [Poi2012]Fibonacci Representation

最新推荐文章于 2019-03-14 11:53:06 发布

bababaab

最新推荐文章于 2019-03-14 11:53:06 发布

阅读量465

点赞数

分类专栏： bzoj dfs

本文链接：https://blog.csdn.net/bababaab/article/details/52994201

版权

bzoj 同时被 2 个专栏收录

56 篇文章 0 订阅

订阅专栏

dfs

3 篇文章 0 订阅

订阅专栏

#include<cstdio>
#include<map>
#include<cstring>
#include<cmath>
#include<algorithm>
#define g getchar()
#define ll long long
#define inf 2e18
using namespace std;
inline ll read(){
    ll x=0,f=1;char ch=g;
    for(;ch<'0'||ch>'9';ch=g)if(ch=='-')f=-1;
    for(;ch>='0'&&ch<='9';ch=g)x=x*10+ch-'0';
    return x*f;
}
inline void out(ll x){
    int a[25],t=0;
    if(x<0)putchar('-'),x=-x;
    for(;x;x/=10)a[++t]=x%10;
    for(int i=t;i;--i)putchar('0'+a[i]);
    if(t==0)putchar('0');
    putchar('\n');
}
map<ll,int>mp;
ll num[1005],top;
int T;ll n;
int dfs(ll x){
    int ans,tmp;
    if(mp[x])return mp[x];
    tmp=lower_bound(num,num+top,x)-num;
    if(num[tmp]==x)return mp[x]=1;
    return mp[x]=min(dfs(x-num[tmp-1]),dfs(num[tmp]-x))+1;
}
int main(){
//  freopen("","r",stdin);
//  freopen("","w",stdout);
    T=read();
    num[0]=num[1]=1;for(int i=2;num[i-1]<=inf;++i,++top)num[i]=num[i-1]+num[i-2];
    for(;T--;){
        n=read();
        out(dfs(n));
    }
    return 0;
}