2013 Asia Nanjing Regional Contest B

Poor Warehouse Keeper

Time Limit: 2000/1000 MS (Java/Others)    

Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 404    Accepted Submission(s): 117

Problem Description

Jenny is a warehouse keeper. He writes down the entry records everyday. The record is shown on a screen, as follow:There are only two buttons on the screen. Pressing the button in the first line once increases the number on the first line by 1. The cost per unit remains untouched. For the screen above, after the button in the first line is pressed, the screen will be:The exact total price is 7.5, but on the screen, only the integral part 7 is shown. Pressing the button in the second line once increases the number on the second line by 1. The number in the first line remains untouched. For the screen above, after the button in the second line is pressed, the screen will be:Remember the exact total price is 8.5, but on the screen, only the integral part 8 is shown.
A new record will be like the following:At that moment, the total price is exact 1.0. Jenny expects a final screen in form of:Where x and y are previously given. What’s the minimal number of pressing of buttons Jenny needs to achieve his goal?

 

Input

There are several (about 50, 000) test cases, please process till EOF. Each test case contains one line with two integers x(1 <= x <= 10) and y(1 <= y <= 10⁹) separated by a single space - the expected number shown on the screen in the end.

 

Output

For each test case, print the minimal number of pressing of the buttons, or “-1”(without quotes) if there’s no way to achieve his goal.

 

Sample Input

1 1

3 8

9 31

 

Sample Output

0

5

11

Hint

For the second test case, one way to achieve is: (1, 1) -> (1, 2) -> (2, 4) -> (2, 5) -> (3, 7.5) -> (3, 8.5)

 

Source

2013ACM/ICPC亚洲区南京站现场赛——题目重现

 

Recommend

liuyiding   |   We have carefully selected several similar problems for you:  4812 4810 4809 4808 4807 

#include <cstdio>
#include <vector>
#include <cmath>
#include <queue>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define INF 0x7fffffff
#define mod 1000003
#define ll long long
#define maxn 1005
#define pi acos(-1.0)
double n, m, k, x, y, a, b;
ll t,d;
int main(){
    while (~scanf("%lf%lf", &x, &y)){
        t = 0;
        a = b = 1;
        if (y<x){ printf("-1\n"); continue; }
        y+=0.999;
        while (a<=x&&b<=y-1){
            if (b+1<=(y)*a/x){
                d = (ll) ((y)*a / x - b);
                t += d;
                b += d;
            }
            else{
                t++;
                b += (b / a);
                a++;
            }
        }
        printf("%I64d\n", (ll)t);
    }
    return 0;
}