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 <iostream>
#include <vector>
#include <deque>
#include <algorithm>
#include <numeric>
#include <string>
#include <cstring>
#include <list>
#include <unordered_set>
#include <tuple>
#include <cmath>
#include <limits>
#include <type_traits>
#include <iomanip>
#include <unordered_map>
using namespace std;

namespace {

	using lint = long long;
	using uli = unsigned long long;

	uli gcd(uli a, uli b) {
		while (1) {
			if (a < b) swap(a, b);
			if (!b) break;
			a %= b;
		}
		return a;
	}

	uli lcm(uli a, uli b)
	{
		return a / gcd(a, b) * b;
	}

	const uli mod = 1000000007;
	const double pi = 3.141592653589793238462;
	const lint intmax = 9223372036854775807;

	uli _PowMod(uli x, uli y, uli _mod)
	{
		if (y == 0)
		{
			return 1;
		}
		else if (y == 1)
		{
			return x % _mod;
		}
		else if (y % 2 == 0)
		{
			auto tmp = _PowMod(x, y / 2, _mod);
			return tmp * tmp % _mod;
		}
		else
		{
			auto tmp = _PowMod(x, y / 2, _mod);
			return (tmp * tmp % _mod) * x % _mod;
		}
	}


	uli PowMod(uli x, uli y)
	{
		return _PowMod(x, y, mod);
	}

	uli getModInv(uli N)
	{
		return PowMod(N, mod - 2);
	}

	lint nCrMod(lint start, lint n, lint r)
	{
		if (n < r)
		{
			return 0;
		}
		lint a = start;
		for (size_t i = n; i >= n - r + 1; i--)
		{
			a *= i;
			a %= mod;
		}
		for (size_t i = 1; i <= r; i++)
		{
			a *= getModInv(i);
			a %= mod;
		}
		return a;
	}

	lint nHrMod(lint start, lint n, lint r)
	{
		return nCrMod(start, n + r - 1, r);
	}

	lint _nCrMod(lint start, lint n, lint r)
	{
		if (n <= 0)
		{
			return 0;
		}
		return nCrMod(start, n, r);
	}

	struct uf
	{
		vector<lint> p;

		uf(lint n) : p(n)
		{
			for (size_t i = 0; i < n; i++)
			{
				p[i] = i;
			}
		}

		lint rt(lint n)
		{
			return p[n] == n ? n : p[n] = rt(p[n]);
		}

		void un(lint n, lint m)
		{
			p[rt(n)] = p[rt(m)];
		}

		bool eq(lint n, lint m)
		{
			return rt(n) == rt(m);
		}
	};

	bool lineCol(lint a1x, lint a1y, lint a2x, lint a2y, lint b1x, lint b1y, lint b2x, lint b2y)
	{
		auto ta = (b1x - b2x) * (a1y - b1y) + (b1y - b2y) * (b1x - a1x);
		auto tb = (b1x - b2x) * (a2y - b1y) + (b1y - b2y) * (b1x - a2x);
		auto tc = (a1x - a2x) * (b1y - a1y) + (a1y - a2y) * (a1x - b1x);
		auto td = (a1x - a2x) * (b2y - a1y) + (a1y - a2y) * (a1x - b2x);

		return tc * td < 0 && ta * tb < 0;
	}

	lint powInt(lint a, lint b)
	{
		if (b == 0)
		{
			return 1;
		}
		if (b == 1)
		{
			return a;
		}
		lint tmp = powInt(a, b / 2);
		return (b % 2 == 1 ? a * tmp * tmp : tmp * tmp);
	}

	lint _sMod(string n, lint mod)
	{
		lint k = (n[0] - '0') % mod;
		for (size_t i = 1; i < n.length(); i++)
		{
			k *= 10;
			k += (n[i] - '0');
			k %= mod;
		}
		return k;
	}

#define vec(name, n)			vector<lint> name(n)
#define vec_(name, n, init)		vector<lint> name(n, init)

#define vecs(name, n)			vector<string> name(n)
#define vect(t, name, n)		vector<t> name(n)

#define vec2(name, n, m)		vector<vector<lint>> name(n, vector<lint>(m))
#define vec2_(name, n, m, init)	vector<vector<lint>> name(n, vector<lint>(m, init))

#define rep(i,n)	for(lint i = 0; i < n; i++)
#define repi(i,n,z)	for(lint i = z; i < n; i++)
#define mmax(a,b)	max((lint)a, (lint)b)
#define mmin(a,b)	min((lint)a, (lint)b)

	template<typename T>
	void vsort(vector<T>& v)
	{
		sort(v.begin(), v.end());
	}

	template<typename T>
	void vsortr(vector<T>& v)
	{
		sort(v.rbegin(), v.rend());
	}

	lint div2(lint p, lint q)
	{
		return (p + q - 1) / q;
	}

	struct xy
	{
		lint x, y;
		xy() :x(0), y(0) {}
		xy(lint _x, lint _y) : x(_x), y(_y) {}
	};

	template<class It, class T>
	bool exist(It begin, It end, const T& val)
	{
		return find(begin, end, val) != end;
	}

	template<class It, class Pr>
	bool exist_if(It begin, It end, Pr pred)
	{
		return find_if(begin, end, pred) != end;
	}

	lint n_dig(lint n)
	{
		lint ans = 0;
		while (n > 0)
		{
			n /= 10;
			ans++;
		}
		return ans;
	}

	template<class T, class T2>
	T2 ler(T val1, T val2, T2 l, T2 e, T2 r)
	{
		if (val1 < val2)
			return r;
		if (val1 > val2)
			return l;
		return e;
	}

	const lint alpn = 'z' - 'a' + 1;

	template<class T>
	T sgn(T val)
	{
		if (val == T(0))
			return T(0);
		if (val < 0)
			return T(-1);
		if (val > 0)
			return T(1);
	}

	template<class T>
	bool between(T val, T l, T r)
	{
		return (val >= l) && (val <= r);
	}

#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()

	template<class It>
	vector<lint> carr(It begin, It end) {
		vec(c, 0);
		c.push_back(1);
		auto before = *begin;
		for (auto it = begin + 1; it != end; it++) {
			if (before != *it) {
				c.push_back(0);
				before = *it;
			}
			c.back()++;
		}
		return c;
	}

	template<class T>
	struct nval {
		lint n;
		T val;
		nval() : n(0) {};
		nval(lint _n, T _val) : n(_n), val(_val) {};
	};

	template<class It>
	auto carr2(It begin, It end) {
		using T = nval<remove_reference_t<decltype(*begin)>>;

		vect(T, c, 0);
		c.push_back(T(1, *begin));
		auto before = *begin;
		for (auto it = begin + 1; it != end; it++) {
			if (before != *it) {
				c.push_back(T(0, *it));
				before = *it;
			}
			c.back().n++;
		}
		return c;
	}

	lint sumdig(lint n) {
		lint ans = 0;
		while (n > 0) {
			ans += n % 10;
			n /= 10;
		}
		return ans;
	}

	lint getdig(lint n, lint d) {
		return (n / powInt(10, d)) % 10;
	}

	template<typename It, typename T>
	void sort2(It begin, It end, T It::value_type::* p)
	{
		using val_t = remove_reference_t<decltype(*begin)>;

		sort(begin, end, [p](val_t a, val_t b) {return a.*p < b.*p; });
	}

	template<typename It, typename T, typename T2>
	void sort3(It begin, It end, T It::value_type::* p, T2 It::value_type::* p2)
	{
		using val_t = remove_reference_t<decltype(*begin)>;

		sort(begin, end, [p, p2](val_t a, val_t b) {
			if (a.*p != b.*p) { return  a.*p < b.*p; }
			else { return a.*p2 > b.*p2; }
			});
	}

}

int main()
{
	lint a, b;
	cin >> a >> b;

	lint ans = 0, k = 1;
	while (k < b) {
		k--;
		k += a;
		ans++;
	}
	cout << ans << endl;
	return 0;
}