博客
关于我
强烈建议你试试无所不能的chatGPT,快点击我
Codeforces 791A Bear and Big Brother(暴力枚举,模拟)
阅读量:6803 次
发布时间:2019-06-26

本文共 2470 字,大约阅读时间需要 8 分钟。

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

 

 

转载于:https://www.cnblogs.com/ECJTUACM-873284962/p/6596694.html

你可能感兴趣的文章
Hello world!
查看>>
Solidity 函数returns多个值的接收方式 总结
查看>>
基于PCDN技术的无延时直播方案
查看>>
七周二次课
查看>>
安装版JDK后,修改环境变量,也无法生效的原因和解决办法
查看>>
springmvc源码解析MvcNamespaceHandler之<mvc:resources/>
查看>>
希尔排序就这么简单
查看>>
区块链100讲:Solidity语法的重载,继承的定义
查看>>
[HBase] LSM树 VS B+树
查看>>
当移动数据分析需求遇到Quick BI
查看>>
消除非受检警告(24)
查看>>
shell 介绍及命令历史、命令补全和别名
查看>>
ecshop 漏洞如何修复 补丁升级与安全修复详情
查看>>
mongodb
查看>>
CMAKE总结(1) .lib .dll .a .so libx.dll libx.dll.a
查看>>
java读取配置文件*.property
查看>>
how to send mail from 3rd
查看>>
mappingResources、mappingLocations、mappingDirectoryLocations、mappingJarLocations
查看>>
AJAX 传递jison数组 ;前端循环辅助数组 -----解决方案
查看>>
关于磁盘相关知识
查看>>