首页 > 其他 > 详细

codeforces 712 Memory and De-Evolution

时间:2019-05-19 13:54:50      阅读:112      评论:0      收藏:0      [点我收藏+]

2019-05-19

13:25:37

加油,加油,坚持,坚持!!!

一定要逆推,才可以是最少的次数

更好的方法:

https://www.cnblogs.com/ECJTUACM-873284962/p/6379014.html

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main()
{
    ll x, y;
    
    scanf("%lld %lld", &x, &y);
    ll maxx = y;
    ll midd = y;
    ll minn = y;
    ll p = 0;
    ll q = 0;
    ll count = 0;
    while(1)
    {
        p = maxx;
        q = midd;
        maxx = midd + maxx - 1;
        midd = p;
        minn = q;
        count++;
        if (maxx >= x)
        {
            cout << count + 2 << endl;
            return 0;
        }
    }    
    return 0;
}

 

codeforces 712 Memory and De-Evolution

原文:https://www.cnblogs.com/Artimis-fightting/p/10889047.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!