zoukankan      html  css  js  c++  java
  • Codeforces Round #405 (rated, Div. 2, based on VK Cup 2017 Round 1) A

    Description

    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.

    Examples
    input
    4 7
    output
    2
    input
    4 9
    output
    3
    input
    1 1
    output
    1
    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.

    题意:一个人每年是*3的增长,一个人是每年*2的增长,问几年后可以超过

    解法:模拟

     1 #include<cstdio>
     2 #include<iostream>
     3 #include<cstring>
     4 using namespace std;
     5 int main()
     6 {
     7     int i;
     8     int a,b;
     9     cin>>a>>b;
    10     for(i=1;a<=b;i++)
    11     {
    12         a*=3;
    13         b*=2;
    14     }
    15     cout<<i-1<<endl;
    16     return 0;
    17 }
  • 相关阅读:
    用队列打印杨辉三角
    mysql允许远程连接
    window文件恢复工具
    android 虚拟机没有sd卡
    StringUtils 的填充方法
    plsql 中出现 Dynamic Performance Tables not accessible 问题解决
    oracle数据库服务介绍
    遮罩的使用
    <pre>标签
    总结五个小技巧定位数据库性能问题
  • 原文地址:https://www.cnblogs.com/yinghualuowu/p/6666835.html
Copyright © 2011-2022 走看看