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 namespace std;

#define ASC(vec) vec.begin(), vec.end()		// 昇順ソート 例：sort(ASC(vec));
#define DESC(vec) vec.rbegin(), vec.rend()	// 降順ソート 例:sort(DESC(vec));
#define rep(i, n) for(int i = 0; i < n; i++)
#define Rep(i, n) for(int i = 1; i < n; i++)
#define In(vec) rep(i, n) cin>>vec[i];
#define ANS(s) cout << s << endl
#define inc(a, b) cin >> a >> b;

const int mod = 1000000007;
const int inf = (int)1e9 + 7;
const long long INF = 1LL << 60;

typedef long long ll;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<vector<int> > vvi;
typedef vector<pair<int, int> > vii;

template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }

ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
ll LCM(ll a, ll b) { return (a * b) / GCD(a, b); }
int round_int(int a, int b) { return (a + (b - 1)) / b; }


// 4,8方向に探索する際に用いる配列
//int dx[4] = { 0,  0, 1, -1 };
//int dy[4] = { 1, -1, 0,  0 };
//int dx[8] = { 1, 0, -1,  0, 1, -1, -1,  1 };
//int dy[8] = { 0, 1,  0, -1, 1,  1, -1, -1 };

// ────────────────────────────────────────────────────

int main() {
	int a, b;
	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,b;
 cin>>a>>b;
 if(a>b){
     cout<<"1"<<endl;
 }
else {
		if (b % a == 0){
		 cout << b / a << endl;
		}
		else if (b % a != 0){
		cout << (b / a) + 1 << endl;
		}
}

        return 0;
    
}

C++: #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <utility>
#include <cstring>
#include <iomanip>
#include <numeric>
#include <cmath>
#include <queue>
#include <map>
using namespace std;
typedef long long ll;
const int INF = 1<<30; 
const int MOD = 1e9 + 7;
const int dy[] = {1, 0, -1, 0};
const int dx[] = {0, 1, 0, -1};
int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    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,c,d;
   cin>>a>>b;
   c=b/a;
   d=b%a;
   if(a>=b){
       cout<<"1"<<endl;
   }
   else if(a<b&&d==0){
       cout<<c<<endl;
   }
   else{
       cout<<c+1<<endl;
   }
   }

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <map>
#include <string>
#include <queue>
#include <stack>
#include <math.h>
#include <cmath>
#include <numeric>
#include <iomanip>


#define log(x) cout<<x<<endl
#define pb push_back
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
typedef long long lint;
using namespace std;


// <<fixed<<setprecision(6)<<


int gcd(lint x, lint y){
  return y==0 ? x:gcd(y,x % y);
}


int combi(int n, int r){
  int num = 1;
  for(int i = 1; i <= r; i++){
    num = num * (n - i + 1) / i;
  }
  return num;
}


int main(){
  int a,b;
  cin>>a>>b;
  if(a>=b){
    cout<<'1'<<endl;
  }
  else{
    int count=1;
    for(int i=a;i<b;i+=a){
      count++;
    }
    cout<<count<<endl;
  }
}

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

int main()
{
    int a, b;

    cin >> a >> b;

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

    return 0;
}

C++: #include "bits/stdc++.h"

#pragma warning(disable:4996)
using namespace std;


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

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

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 - 1) / a + 1 << endl;
	
	return 0;
}

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

C++: #include<stdio.h>
int main(){
int dress,party,ans;
scanf(" %d %d",&dress,&party);
  ans = party / dress;
  if(party % dress != 0)ans++;
printf("%d\n",ans);
  return 0;
}

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

C++: #include <bits/stdc++.h>
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-1)/A << endl;
}

C++: #include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}

//INSERT ABOVE HERE
signed main(){
  Int a,b;
  cin>>a>>b;
  cout<<(b+a-1)/a<<endl;
  return 0;
}

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

using namespace std;

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

	return 0;
}

C++: #define _USE_MATH_DEFINES

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>

using namespace std;

typedef pair<long long int, long long int> P;

long long int INF = 1e18;
long long int MOD = 1e9 + 7;

int main(){
	
	int A, B;
	cin >> A >> B;
	
	int ans = 0;
	
	for(int i = 0; i < 200000; i++){
		B -= A;
		ans += 1;
		if(B <= 0){
			break;
		}
	}
	
	cout << ans << endl;
	
	return 0;
}

C++: #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>

#include <iostream>
#include <complex>
#include <string>
#include <algorithm>
#include <numeric>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>

#include <functional>
#include <cassert>

typedef long long ll;
using namespace std;

#define debug(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;

#define mod 1000000007 //1e9+7(prime number)
#define INF 1000000000 //1e9
#define LLINF 2000000000000000000LL //2e18
#define SIZE 100010


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,x;
cin>>a>>b;
x=b/a;
if(b%a !=0)x++;
cout<<x<<endl;
 


}

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

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

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