zoukankan      html  css  js  c++  java
  • Codeforces A. Bear and Big Brother

    。。。不行。这题之后、不做1000分以下的了。很耻辱
     
    A. Bear and Big Brother
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

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

    #include<iostream>
    using namespace std;
    int main(){
        int a;
        int b;
        cin>>a;
        cin>>b;
        int res = 0;
        do{
            res++;
            a*=3;
            b*=2;
        }while(a<=b);
        cout<<res;
        return 0;
    }

  • 相关阅读:
    android开发 软键盘出现后 防止EditText控件遮挡 总体平移UI
    jQuery中this与$(this)的差别
    纯手写wcf代码,wcf入门,wcf基础教程
    JavaScript权威指南第01章 JavaScript 概述
    Python
    微信支付界面中文乱码问题
    EasyUI基础入门之Pagination(分页)
    Maximum Subarray
    CF1063F String Journey
    排序
  • 原文地址:https://www.cnblogs.com/godoforange/p/10944674.html
Copyright © 2011-2022 走看看