CF - 791A. Bear and Big Brother - 模拟

最新推荐文章于 2022-05-07 15:49:00 发布

寒江雪里独钓着的蓑笠翁

最新推荐文章于 2022-05-07 15:49:00 发布

阅读量543

点赞数

分类专栏：模拟文章标签： acm 算法 codeforces

本文链接：https://blog.csdn.net/dragon60066/article/details/63684718

版权

模拟专栏收录该内容

53 篇文章 0 订阅

订阅专栏

1.题目描述：

Bear Limak wants to become the largest of bears, or at least to become larger than his brother Bob.

Right now, Limak and Bob weigh a and b respectively. It's guaranteed that Limak's weight is smaller than or equal to his brother's weight.

Limak eats a lot and his weight is tripled after every year, while Bob's weight is doubled after every year.

After how many full years will Limak become strictly larger (strictly heavier) than Bob?

Input

The only line of the input contains two integers a and b (1 ≤ a ≤ b ≤ 10) — the weight of Limak and the weight of Bob respectively.

Output

Print one integer, denoting the integer number of years after which Limak will become strictly larger than Bob.

Note

In the first sample, Limak weighs 4 and Bob weighs 7 initially. After one year their weights are 4·3 = 12 and 7·2 = 14 respectively (one weight is tripled while the other one is doubled). Limak isn't larger than Bob yet. After the second year weights are 36 and 28, so the first weight is greater than the second one. Limak became larger than Bob after two years so you should print 2.

In the second sample, Limak's and Bob's weights in next years are: 12 and 18, then 36 and 36, and finally 108 and 72 (after three years). The answer is 3. Remember that Limak wants to be larger than Bob and he won't be satisfied with equal weights.

In the third sample, Limak becomes larger than Bob after the first year. Their weights will be 3 and 2 then.

2.题意概述：

Limak 想在体重上超过 Bob，Limak 以每年3倍体重增长，Bob 以每年2倍增长，问你至少多少年 Limak 可以超过Bob。

3.解题思路与：

直接模拟就好了

4.AC代码：

#include <bits/stdc++.h>
#define INF 0x3f3f3f3f
#define maxn 100100
#define N 1111
#define eps 1e-6
#define pi acos(-1.0)
#define e exp(1.0)
using namespace std;
const int mod = 1e9 + 7;
typedef long long ll;
typedef unsigned long long ull;

int main()
{
#ifndef ONLINE_JUDGE
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
    long _begin_time = clock();
#endif
    int a, b;
    while (~scanf("%d%d", &a, &b))
    {
        int ans = 0;
        while (a <= b)
        {
            ans++;
            a *= 3;
            b *= 2;
        }
        printf("%d\n", ans);
    }
#ifndef ONLINE_JUDGE
    long _end_time = clock();
    printf("time = %ld ms.", _end_time - _begin_time);
#endif
    return 0;
}