Problem:
Score : 200 points

Problem Statement

Takahashi's house has only one socket.

Takahashi wants to extend it with some number of power strips, each with A sockets, into B or more empty sockets.

One power strip with A sockets can extend one empty socket into A empty sockets.

Find the minimum number of power strips required.

Constraints

All values in input are integers.

2 \leq A \leq 20

1 \leq B \leq 20

Input

Input is given from Standard Input in the following format:

A B

Output

Print the minimum number of power strips required.

Sample Input 1

4 10

Sample Output 1

3

3 power strips, each with 4 sockets, extend the socket into 10 empty sockets.

Sample Input 2

8 9

Sample Output 2

2

2 power strips, each with 8 sockets, extend the socket into 15 empty sockets.

Sample Input 3

8 8

Sample Output 3

1

Solution in C++14 (GCC 5.4.1) (judge verdict: Accepted)

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=998244353;
const int N=1e5+5;
const int MAXN=1e5+5;
const ll inf=0x3f3f3f3f;
char s[5],t[5];
int main(){
    std::ios::sync_with_stdio(false);
    int n,l,r;
    cin>>l>>r;
    int ans=0;
    int tt=0;
    if(r==1) cout<<0<<endl;
    else{
    while(tt<r){
        if(tt!=0) tt--;
        tt+=l;
        //cout<<tt<<endl;
        ans++;
    }
    cout<<ans<<endl;
    }
    return 0;
}