Go: package main

import "fmt"

func main() {
	var a, b int
	_, err := fmt.Scanln(&a, &b)
	if err != nil {
		panic("error!")
	}
	freq := (b + a - 1) / a
	fmt.Println(freq)
}

C++: #include <bits/stdc++.h>
using LL = long long;
using namespace std;

int main(){
    int A,B;cin >> A >> B;
    cout<<(B%A == 0 ? 0 : 1)+B/A<<endl;
}
//2t+2

C++: #include <iostream>
using namespace std;
int main(void){
    
    int a,b,sho;
    cin>>a>>b;
    sho=b/a;
    if(b%a!=0) sho++;
    cout<<sho<<endl;
    
    
}

C++: #include<bits/stdc++.h>
using namespace std;

int main(){
    int A, B;
    cin >> B >> A;
    cout << A / B + !!(A % B) << endl;
}

C++: #include <iostream>
using namespace std;

int main() {
  int a, b;
  cin >> a >> b;
  cout << (b + a - 1) / a << endl;
  return 0;
}

C++: #include <iostream>
using namespace std;
int main(void){
    int a,b,i;
    cin>>a>>b;
    i=b/a;
    if(b%a){i=i+1;}
    if(b<=a){i=1;}
    cout<<i<<endl;
    
}

C++: #include "bits/stdc++.h"
using namespace std;

int main() {
	int A,B; cin>>A>>B;
	int ans=ceil((double)B/(double)A);
	cout<<ans<<endl;
}

C++: #include<iostream>
using namespace std;
int main(){
    int A,B,C;
    cin >> A >> B ;
    C = B/A+1;
    cout <<C << endl;
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

#define int long long

main() {
    int a, b; cin >> a >> b;
    if (b % a == 0) {
        cout << b / a << endl;
    } else {
        cout << b / a + 1 << endl;
    }
}

C++: #include <iostream>
#include <string>
#include <algorithm>
#include <vector>

using namespace std;


int main() {

	int a = 0;
	int b = 0;
	cin >> a >> b;
	if (b % a == 0) {
		cout << b / a << endl;
	}
	else {
		cout << b / a + 1 << endl;
	}
}

C++: #include <iostream>
using namespace std;
int main(void){
int a,n,o;
cin>>a>>n;
o = n/a;
if(n%a!=0){
cout<<o+1<<endl;
}if(n%a==0){
cout<<o<<endl;
}

}

C++: #include <iostream>
using namespace std;

int main() {
	int A, B;
	cin >> A >> B;
	cout << (A + B - 1) / A << endl;
}

C++: #include <iostream>
using namespace std;
int main(void){
    int a,b,c;
    cin>>a>>b;
    if(b%a==0){c=b/a;}else{c=b/a+1;}
    cout<<c<<endl;
}

C++: #include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<int,int> P;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int A,B; cin >> A >> B;

    if(B%A == 0) cout << B/A << endl;
    else cout << B/A + 1 << endl;

    return 0;

}

C++: #include <bits/stdc++.h>
using namespace std;
int main(){
 int a,b,ans;
cin>>a>>b;
ans=b/a;
if(b%a!=0){++ans;}
cout<<ans<<endl;
}

C++: #include <iostream>
using namespace std;
int main(void){
    int A,B;
    cin>>A>>B;
    if(A>=B){
        cout<<1<<endl;
    }
    else if(B%A){
        cout<<B/A+1<<endl;
    }
    else{
        cout<<B/A<<endl;
    }
}

C++: #include <bits/stdc++.h>
using namespace std;

int main() {
    int a, b;
    cin >> a >> b;
    cout << (b-1)/a+1 << endl;
    return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int a, b;
    cin >> a >> b;
    cout << (b + a - 1) / a << '\n';
    return 0;
}

C++: #include <iostream>
#include <fstream>
#include <stdio.h>
#include <math.h>
#include <time.h>
#include <string>
#include <tuple>
#include <vector>
#include <map>
#include <list>
#include <set>
#include <stack>
#include <queue>
#include <cstdlib>
#include <algorithm>
#include <random>
#include <cassert>
using namespace std;
#define LL long long
#define MP(a, b) make_pair(a, b)
#define MMP(a, b, c) make_pair(make_pair(a, b), c)
#define MAX 1000000000
#undef INT_MIN
#undef INT_MAX
#define INT_MIN -2147483648
#define INT_MAX 2147483647
#define LL_MIN -9223372036854775808
#define LL_MAX 9223372036854775807
#define PI 3.14159265359

#include <boost/multiprecision/cpp_int.hpp>
namespace boost_multiprecision = boost::multiprecision;
#define CINT boost_multiprecision::cpp_int

int main(){
    iostream::sync_with_stdio(false);
    
    int A,B;
    cin >> A >> B;
    cout << ceil((double)B/A) << endl;
    
    return 0;
}

C++: #include <iostream>
using namespace std;
int main(){
    int a,b;cin>>a>>b;
    cout << (b-1)/a+1 << endl;
}

C++: #include<iostream>
using namespace std;
int main() {
	int a, b; cin >> a >> b;
	cout << (b + a - 1) / a << endl;
	return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <string>
using namespace std;
#define int long long
signed main() {
	int a, b; cin >> a >> b;
	cout << (b + a - 1) / a << '\n';
}

C++: #include <bits/stdc++.h>

using namespace std;
using llong = long long;
using ldbl = long double;
using P = pair<llong, llong>;

#define BE(x) x.begin(), x.end()

const llong inf = llong(1e18)+7;
const llong mod = 1e9+7;

int main(){
	llong A, B;
	cin >> A >> B;

	cout << B/A + (B%A!=0) << endl;

	return 0;
}

C++: #include "bits/stdc++.h"
using namespace std;

int main() {
	long long A, B;
	cin >> A >> B;
	cout << (A + B - 1) / A << endl;
}

C++: #include <iostream>
using namespace std;

int main() {
	int A, B;
	cin >> A >> B;
	cout << (B + A - 1) / A << endl;
	return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
    int a,b;cin >>a >>b;
    cout << (b%a>0) + b/a<<endl;
}

C++: #include <iostream>
using namespace std;
int main(void){
   int a,b,c;
   cin >> a >> b;
   c = b/a;
   if(b%a !=0) c++;
   cout << c << endl;
  
}

C++: #include<iostream>
#include<vector>
#include<set>
#include<algorithm>
#include<queue>
#include<utility>
#define LL long long
using namespace std;



int main() {
	int a, b;
	cin >> a >> b;
	cout << (a + b - 1) / a << endl;

	return 0;
}

C++: #include<iostream>
#include<vector>
#include<algorithm>
#define REP(i,n) for(int i=0;i<n;i++)
#define FOR(i,s,e) for(int i=s;i<e;i++)

using namespace std;

int main(void) {
	int a, b;
	cin >> a >> b;
	if (b % a == 0)cout << b / a << endl;
	else cout << int(b / a) + 1 << endl;
	return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
using namespace std;

int main() {
  int A, B;
  cin >> A >> B;
  int cnt = 0;
  if(A >= B) cout << 1 << endl;
  else {
    while(A < B) {
      B -= A;
      ++cnt;
    }
    ++cnt;
    cout << cnt << endl;
  }
  
}

C++: #include <iostream>
using namespace std;
int main(void){
    // Your code here!
    int a,b,x,y;
    cin>>a>>b;
    x=b/a;
    y=b%a;
    if(y>=1){
        cout<<x+1<<endl;
    }
    else{
        cout<<x<<endl;
    }
}

C++: #include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
typedef pair<int, int> pii;
#define fore(i,a) for(auto &i:a)
#define REP(i,n) for(int i=0;i<n;i++)
#define eREP(i,n) for(int i=0;i<=n;i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define eFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define SORT(c) sort((c).begin(),(c).end())
#define rSORT(c) sort((c).rbegin(),(c).rend())
#define LB(x,a) lower_bound((x).begin(),(x).end(),(a))
#define UB(x,a) upper_bound((x).begin(),(x).end(),(a))
#define INF 1000000000
#define LLINF 9223372036854775807
#define mod 1000000007
//vector<vector<int> > dp;
//vector<vector<vector<int> > > vvvi;
//dp=vector<vector<int> >(N, vector<int>(M,0));
//vector<pair<int,int> > v;
//v.push_back(make_pair(x,y));
//priority_queue<int,vector<int>, greater<int> > q2;



signed main(){
cin.tie(0);
ios::sync_with_stdio(false);

	int A, B;
	cin >> A >> B;

	cout << (B - 1) / A +1<< endl;
	return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
    
    int A,B,sho;
    cin>>B>>A;
    
    sho=A/B;
    
    if(A % B != 0) sho++;
    
    cout<<sho<<endl;
    
}