小聲BB

又開始更新了，最近打游戲王DL，這個欄目會留一些上分的心得。

題干

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.

分析

輸入兩個值，小的每年翻3倍，大的每年翻倍，問幾年小的能超過大的

代碼

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

總結

以上是生活随笔為你收集整理的Codeforces——791A Bear and Big Brother的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。