Codeforces 791A Bear and Big Brother(暴力枚举,模拟)

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
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.

分析:给你两个数字a和b; a每次乘3,b每次乘2,问你什么时候a第一次大于b!

题目链接:http://codeforces.com/contest/791/problem/A

下面给出AC代码:

复制代码
 1 #include <bits/stdc++.h>
 2 using namespace std;
 3 int main()
 4 {
 5     int a,b,i;
 6     int c,d;
 7     while(scanf("%d%d",&a,&b)!=EOF)
 8     {
 9         int ans=0;
10         if(a-b>0)
11             printf("0\n");
12             else if(a-b==0)
13                 printf("1\n");
14         while(a-b<0)
15         {
16             ans++;
17             a*=3;
18             b*=2;
19             if(a-b>0)
20             {
21                 printf("%d\n",ans);
22                 break;
23             }
24             else if(a-b==0)
25             {
26                 printf("%d\n",ans+1);
27                 break;
28             }
29         }
30     }
31     return 0;
32 }
复制代码

 

 

posted @   Angel_Kitty  阅读(573)  评论(0编辑  收藏  举报
编辑推荐:
· 如何编写易于单元测试的代码
· 10年+ .NET Coder 心语,封装的思维:从隐藏、稳定开始理解其本质意义
· .NET Core 中如何实现缓存的预热?
· 从 HTTP 原因短语缺失研究 HTTP/2 和 HTTP/3 的设计差异
· AI与.NET技术实操系列:向量存储与相似性搜索在 .NET 中的实现
阅读排行:
· 周边上新:园子的第一款马克杯温暖上架
· Open-Sora 2.0 重磅开源!
· 分享 3 个 .NET 开源的文件压缩处理库,助力快速实现文件压缩解压功能!
· Ollama——大语言模型本地部署的极速利器
· [AI/GPT/综述] AI Agent的设计模式综述
点击右上角即可分享
微信分享提示
剑桥
14:14发布
剑桥
14:14发布
6°
南风
3级
空气质量
相对湿度
87%
今天
多云
4°/16°
周日
9°/18°
周一
大雨
8°/15°