stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
//----------------------Shanu Garg here---------------------

//-------------Search on youtube : Shanu Garg---------------

//-Studying at National Institute of Technology Delhi(NITD)-

//---------------------From Delhi, India--------------------



#include<bits/stdc++.h>

#include<algorithm>

using namespace std;



#define f(i,n) for(auto i=0;i<n;i++)

#define fr(i,n) for(auto i=n-1;i>=0;i--)

#define fs(i,a,b,c) for(auto i=a;i!=b;i+=c)

#define fl(i,x) for(auto i : x)

#define nl cout<<"\n";

#define ll long long int

#define vi vector<int>

#define pr pair<ll, ll>

#define vll vector<pr>

#define vl vector<ll>

#define mid(a,b) ((a+b)/2)

#define pb push_back

#define LCM(a,b) ((a*b)/__gcd(a, b))

const int INF = 0x3f3f3f3f, mod = 1e9 + 7;



class triplet{ll f, s, t;};



vl in(ll n){vl v;ll x;

    f(i,n)

    cin>>x, v.pb(x%mod);

    return v;}

void out(vl v){fl(i,v)cout<<i;}

void out(vl v, char ch){

    fl(i,v)

    cout<<i<<ch;}



void solve(){

    ll n, a;

    cin>>n>>a;

    ll ans=0;

    ans += (n%a) ? 1 : 0;

    cout<<(n/a)+ans;

}



int main(){

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    solve();

   return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.360743607965605x):
#include <stdio.h>



int main(){

    int h, a;

    int hit = 0;

    scanf("%d %d", &h, &a);

    hit = h/a;

    if(h%a != 0){

        hit++;

    }

    printf("%d\n", hit);

    

    return 0;

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

    int H,A;

    cin>>H>>A;

    cout<<((H%A==0)?(H/A):((H/A)+1));

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.257081727570007x):
#include <stdio.h>

int main()

{

int H,A;

scanf("%d %d",&H,&A);

(H % A == 0) ? printf("%d",H/A) : printf("%d",H/A+1); 

    return 0;

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



using namespace std;



int main() {



    double a,b;

    cin>>a>>b;

    cout<<int(ceil(a/b));

    

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.307050521059061x):
#include <stdio.h>

int main()

{

int H,A;

scanf("%d %d",&H,&A);

(H % A == 0) ? printf("%d",H/A) : printf("%d",H/A+1); 

    return 0;

}
// Slower C++ solution:
//----------------------Shanu Garg here---------------------

//-------------Search on youtube : Shanu Garg---------------

//-Studying at National Institute of Technology Delhi(NITD)-

//---------------------From Delhi, India--------------------



#include<bits/stdc++.h>

#include<algorithm>

using namespace std;



#define f(i,n) for(auto i=0;i<n;i++)

#define fr(i,n) for(auto i=n-1;i>=0;i--)

#define fs(i,a,b,c) for(auto i=a;i!=b;i+=c)

#define fl(i,x) for(auto i : x)

#define nl cout<<"\n";

#define ll long long int

#define vi vector<int>

#define pr pair<ll, ll>

#define vll vector<pr>

#define vl vector<ll>

#define mid(a,b) ((a+b)/2)

#define pb push_back

#define LCM(a,b) ((a*b)/__gcd(a, b))

const int INF = 0x3f3f3f3f, mod = 1e9 + 7;



class triplet{ll f, s, t;};



vl in(ll n){vl v;ll x;

    f(i,n)

    cin>>x, v.pb(x%mod);

    return v;}

void out(vl v){fl(i,v)cout<<i;}

void out(vl v, char ch){

    fl(i,v)

    cout<<i<<ch;}



void solve(){

    ll n, a;

    cin>>n>>a;

    ll ans=0;

    ans += (n%a) ? 1 : 0;

    cout<<(n/a)+ans;

}



int main(){

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    solve();

   return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.36938560104471x):
#include <stdio.h>

int main()

{

int H,A;

scanf("%d %d",&H,&A);

(H % A == 0) ? printf("%d",H/A) : printf("%d",H/A+1); 

    return 0;

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

    int H,A;

    cin>>H>>A;

    cout<<((H%A==0)?(H/A):((H/A)+1));

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.257558617395982x):
#include <stdio.h>



int main () {

    int H ;

    int A ;

    int dead ;

    scanf("%d %d", &H, &A) ;

    dead=H%A==0? dead=H/A : dead=H/A+1 ;

    printf("%d", dead) ;



    return 0 ; 

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



using namespace std;



int main() {



    double a,b;

    cin>>a>>b;

    cout<<int(ceil(a/b));

    

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.3075319437438475x):
#include <stdio.h>



int main () {

    int H ;

    int A ;

    int dead ;

    scanf("%d %d", &H, &A) ;

    dead=H%A==0? dead=H/A : dead=H/A+1 ;

    printf("%d", dead) ;



    return 0 ; 

}
// Slower C++ solution:
//----------------------Shanu Garg here---------------------

//-------------Search on youtube : Shanu Garg---------------

//-Studying at National Institute of Technology Delhi(NITD)-

//---------------------From Delhi, India--------------------



#include<bits/stdc++.h>

#include<algorithm>

using namespace std;



#define f(i,n) for(auto i=0;i<n;i++)

#define fr(i,n) for(auto i=n-1;i>=0;i--)

#define fs(i,a,b,c) for(auto i=a;i!=b;i+=c)

#define fl(i,x) for(auto i : x)

#define nl cout<<"\n";

#define ll long long int

#define vi vector<int>

#define pr pair<ll, ll>

#define vll vector<pr>

#define vl vector<ll>

#define mid(a,b) ((a+b)/2)

#define pb push_back

#define LCM(a,b) ((a*b)/__gcd(a, b))

const int INF = 0x3f3f3f3f, mod = 1e9 + 7;



class triplet{ll f, s, t;};



vl in(ll n){vl v;ll x;

    f(i,n)

    cin>>x, v.pb(x%mod);

    return v;}

void out(vl v){fl(i,v)cout<<i;}

void out(vl v, char ch){

    fl(i,v)

    cout<<i<<ch;}



void solve(){

    ll n, a;

    cin>>n>>a;

    ll ans=0;

    ans += (n%a) ? 1 : 0;

    cout<<(n/a)+ans;

}



int main(){

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    solve();

   return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.369872678381067x):
#include <stdio.h>



int main () {

    int H ;

    int A ;

    int dead ;

    scanf("%d %d", &H, &A) ;

    dead=H%A==0? dead=H/A : dead=H/A+1 ;

    printf("%d", dead) ;



    return 0 ; 

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

    int H,A;

    cin>>H>>A;

    cout<<((H%A==0)?(H/A):((H/A)+1));

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.257081727570007x):
#include <stdio.h>





int main (){

    int x,y;

    scanf ("%d %d", &x, &y);

    x%y==0 ? printf("%d",x/y) : printf("%d",x/y+1);













    return 0;

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



using namespace std;



int main() {



    double a,b;

    cin>>a>>b;

    cout<<int(ceil(a/b));

    

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.307050521059061x):
#include <stdio.h>





int main (){

    int x,y;

    scanf ("%d %d", &x, &y);

    x%y==0 ? printf("%d",x/y) : printf("%d",x/y+1);













    return 0;

}
// Slower C++ solution:
//----------------------Shanu Garg here---------------------

//-------------Search on youtube : Shanu Garg---------------

//-Studying at National Institute of Technology Delhi(NITD)-

//---------------------From Delhi, India--------------------



#include<bits/stdc++.h>

#include<algorithm>

using namespace std;



#define f(i,n) for(auto i=0;i<n;i++)

#define fr(i,n) for(auto i=n-1;i>=0;i--)

#define fs(i,a,b,c) for(auto i=a;i!=b;i+=c)

#define fl(i,x) for(auto i : x)

#define nl cout<<"\n";

#define ll long long int

#define vi vector<int>

#define pr pair<ll, ll>

#define vll vector<pr>

#define vl vector<ll>

#define mid(a,b) ((a+b)/2)

#define pb push_back

#define LCM(a,b) ((a*b)/__gcd(a, b))

const int INF = 0x3f3f3f3f, mod = 1e9 + 7;



class triplet{ll f, s, t;};



vl in(ll n){vl v;ll x;

    f(i,n)

    cin>>x, v.pb(x%mod);

    return v;}

void out(vl v){fl(i,v)cout<<i;}

void out(vl v, char ch){

    fl(i,v)

    cout<<i<<ch;}



void solve(){

    ll n, a;

    cin>>n>>a;

    ll ans=0;

    ans += (n%a) ? 1 : 0;

    cout<<(n/a)+ans;

}



int main(){

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    solve();

   return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.36938560104471x):
#include <stdio.h>





int main (){

    int x,y;

    scanf ("%d %d", &x, &y);

    x%y==0 ? printf("%d",x/y) : printf("%d",x/y+1);













    return 0;

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

    int H,A;

    cin>>H>>A;

    cout<<((H%A==0)?(H/A):((H/A)+1));

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.257081727570007x):
#include <stdio.h>



int main(){

	int H,A, X;

	scanf("%d %d", &H, &A);

	

	(H%A == 0)?printf("%d", (H/A)):	printf("%d", (H/A)+1);

	return 0;

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



using namespace std;



int main() {



    double a,b;

    cin>>a>>b;

    cout<<int(ceil(a/b));

    

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.307050521059061x):
#include <stdio.h>



int main(){

	int H,A, X;

	scanf("%d %d", &H, &A);

	

	(H%A == 0)?printf("%d", (H/A)):	printf("%d", (H/A)+1);

	return 0;

}
// Slower C++ solution:
//----------------------Shanu Garg here---------------------

//-------------Search on youtube : Shanu Garg---------------

//-Studying at National Institute of Technology Delhi(NITD)-

//---------------------From Delhi, India--------------------



#include<bits/stdc++.h>

#include<algorithm>

using namespace std;



#define f(i,n) for(auto i=0;i<n;i++)

#define fr(i,n) for(auto i=n-1;i>=0;i--)

#define fs(i,a,b,c) for(auto i=a;i!=b;i+=c)

#define fl(i,x) for(auto i : x)

#define nl cout<<"\n";

#define ll long long int

#define vi vector<int>

#define pr pair<ll, ll>

#define vll vector<pr>

#define vl vector<ll>

#define mid(a,b) ((a+b)/2)

#define pb push_back

#define LCM(a,b) ((a*b)/__gcd(a, b))

const int INF = 0x3f3f3f3f, mod = 1e9 + 7;



class triplet{ll f, s, t;};



vl in(ll n){vl v;ll x;

    f(i,n)

    cin>>x, v.pb(x%mod);

    return v;}

void out(vl v){fl(i,v)cout<<i;}

void out(vl v, char ch){

    fl(i,v)

    cout<<i<<ch;}



void solve(){

    ll n, a;

    cin>>n>>a;

    ll ans=0;

    ans += (n%a) ? 1 : 0;

    cout<<(n/a)+ans;

}



int main(){

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    solve();

   return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.36938560104471x):
#include <stdio.h>



int main(){

	int H,A, X;

	scanf("%d %d", &H, &A);

	

	(H%A == 0)?printf("%d", (H/A)):	printf("%d", (H/A)+1);

	return 0;

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

    int H,A;

    cin>>H>>A;

    cout<<((H%A==0)?(H/A):((H/A)+1));

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.2475013686385035x):
#include <stdio.h>



int main(){

	

	int h, a;

	scanf("%d%d", &h, &a);

	getchar();

	

	int att = h % a;

	int num1 = h / a;

	int num2 = h / a+1; 

	

	(att == 0)? printf("%d\n", num1) : printf("%d\n", num2);

		

	return 0;

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



using namespace std;



int main() {



    double a,b;

    cin>>a>>b;

    cout<<int(ceil(a/b));

    

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.297379100393728x):
#include <stdio.h>



int main(){

	

	int h, a;

	scanf("%d%d", &h, &a);

	getchar();

	

	int att = h % a;

	int num1 = h / a;

	int num2 = h / a+1; 

	

	(att == 0)? printf("%d\n", num1) : printf("%d\n", num2);

		

	return 0;

}
// Slower C++ solution:
//----------------------Shanu Garg here---------------------

//-------------Search on youtube : Shanu Garg---------------

//-Studying at National Institute of Technology Delhi(NITD)-

//---------------------From Delhi, India--------------------



#include<bits/stdc++.h>

#include<algorithm>

using namespace std;



#define f(i,n) for(auto i=0;i<n;i++)

#define fr(i,n) for(auto i=n-1;i>=0;i--)

#define fs(i,a,b,c) for(auto i=a;i!=b;i+=c)

#define fl(i,x) for(auto i : x)

#define nl cout<<"\n";

#define ll long long int

#define vi vector<int>

#define pr pair<ll, ll>

#define vll vector<pr>

#define vl vector<ll>

#define mid(a,b) ((a+b)/2)

#define pb push_back

#define LCM(a,b) ((a*b)/__gcd(a, b))

const int INF = 0x3f3f3f3f, mod = 1e9 + 7;



class triplet{ll f, s, t;};



vl in(ll n){vl v;ll x;

    f(i,n)

    cin>>x, v.pb(x%mod);

    return v;}

void out(vl v){fl(i,v)cout<<i;}

void out(vl v, char ch){

    fl(i,v)

    cout<<i<<ch;}



void solve(){

    ll n, a;

    cin>>n>>a;

    ll ans=0;

    ans += (n%a) ? 1 : 0;

    cout<<(n/a)+ans;

}



int main(){

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    solve();

   return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.359600582670375x):
#include <stdio.h>



int main(){

	

	int h, a;

	scanf("%d%d", &h, &a);

	getchar();

	

	int att = h % a;

	int num1 = h / a;

	int num2 = h / a+1; 

	

	(att == 0)? printf("%d\n", num1) : printf("%d\n", num2);

		

	return 0;

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

    int H,A;

    cin>>H>>A;

    cout<<((H%A==0)?(H/A):((H/A)+1));

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.2486374120250066x):
#include<stdio.h>



int main()

{

	int n, m;

	

	scanf("%d %d", &n, &m);

	

	printf("%d\n", ((n - 1) + m) / m);

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



using namespace std;



int main() {



    double a,b;

    cin>>a>>b;

    cout<<int(ceil(a/b));

    

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.298525941922683x):
#include<stdio.h>



int main()

{

	int n, m;

	

	scanf("%d %d", &n, &m);

	

	printf("%d\n", ((n - 1) + m) / m);

}
// Slower C++ solution:
//----------------------Shanu Garg here---------------------

//-------------Search on youtube : Shanu Garg---------------

//-Studying at National Institute of Technology Delhi(NITD)-

//---------------------From Delhi, India--------------------



#include<bits/stdc++.h>

#include<algorithm>

using namespace std;



#define f(i,n) for(auto i=0;i<n;i++)

#define fr(i,n) for(auto i=n-1;i>=0;i--)

#define fs(i,a,b,c) for(auto i=a;i!=b;i+=c)

#define fl(i,x) for(auto i : x)

#define nl cout<<"\n";

#define ll long long int

#define vi vector<int>

#define pr pair<ll, ll>

#define vll vector<pr>

#define vl vector<ll>

#define mid(a,b) ((a+b)/2)

#define pb push_back

#define LCM(a,b) ((a*b)/__gcd(a, b))

const int INF = 0x3f3f3f3f, mod = 1e9 + 7;



class triplet{ll f, s, t;};



vl in(ll n){vl v;ll x;

    f(i,n)

    cin>>x, v.pb(x%mod);

    return v;}

void out(vl v){fl(i,v)cout<<i;}

void out(vl v, char ch){

    fl(i,v)

    cout<<i<<ch;}



void solve(){

    ll n, a;

    cin>>n>>a;

    ll ans=0;

    ans += (n%a) ? 1 : 0;

    cout<<(n/a)+ans;

}



int main(){

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    solve();

   return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.360760894668125x):
#include<stdio.h>



int main()

{

	int n, m;

	

	scanf("%d %d", &n, &m);

	

	printf("%d\n", ((n - 1) + m) / m);

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

    int H,A;

    cin>>H>>A;

    cout<<((H%A==0)?(H/A):((H/A)+1));

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.248684921775749x):
#include <stdio.h>



int main(void)

{

  int h, a;

  scanf("%d %d", &h, &a);

  int num = h / a + 1;

  printf("%d\n", num - ((h % a) == 0));

  return 0;

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



using namespace std;



int main() {



    double a,b;

    cin>>a>>b;

    cout<<int(ceil(a/b));

    

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.2985739032557x):
#include <stdio.h>



int main(void)

{

  int h, a;

  scanf("%d %d", &h, &a);

  int num = h / a + 1;

  printf("%d\n", num - ((h % a) == 0));

  return 0;

}
// Slower C++ solution:
//----------------------Shanu Garg here---------------------

//-------------Search on youtube : Shanu Garg---------------

//-Studying at National Institute of Technology Delhi(NITD)-

//---------------------From Delhi, India--------------------



#include<bits/stdc++.h>

#include<algorithm>

using namespace std;



#define f(i,n) for(auto i=0;i<n;i++)

#define fr(i,n) for(auto i=n-1;i>=0;i--)

#define fs(i,a,b,c) for(auto i=a;i!=b;i+=c)

#define fl(i,x) for(auto i : x)

#define nl cout<<"\n";

#define ll long long int

#define vi vector<int>

#define pr pair<ll, ll>

#define vll vector<pr>

#define vl vector<ll>

#define mid(a,b) ((a+b)/2)

#define pb push_back

#define LCM(a,b) ((a*b)/__gcd(a, b))

const int INF = 0x3f3f3f3f, mod = 1e9 + 7;



class triplet{ll f, s, t;};



vl in(ll n){vl v;ll x;

    f(i,n)

    cin>>x, v.pb(x%mod);

    return v;}

void out(vl v){fl(i,v)cout<<i;}

void out(vl v, char ch){

    fl(i,v)

    cout<<i<<ch;}



void solve(){

    ll n, a;

    cin>>n>>a;

    ll ans=0;

    ans += (n%a) ? 1 : 0;

    cout<<(n/a)+ans;

}



int main(){

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    solve();

   return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.360809419341084x):
#include <stdio.h>



int main(void)

{

  int h, a;

  scanf("%d %d", &h, &a);

  int num = h / a + 1;

  printf("%d\n", num - ((h % a) == 0));

  return 0;

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

    int H,A;

    cin>>H>>A;

    cout<<((H%A==0)?(H/A):((H/A)+1));

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.257578356228157x):
#include <stdio.h>



int main() {

  int H, A;

  scanf("%d %d", &H, &A);

  printf("%d", (H - 1) / A + 1);

  return 0;

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



using namespace std;



int main() {



    double a,b;

    cin>>a>>b;

    cout<<int(ceil(a/b));

    

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.307551870194492x):
#include <stdio.h>



int main() {

  int H, A;

  scanf("%d %d", &H, &A);

  printf("%d", (H - 1) / A + 1);

  return 0;

}
// Slower C++ solution:
//----------------------Shanu Garg here---------------------

//-------------Search on youtube : Shanu Garg---------------

//-Studying at National Institute of Technology Delhi(NITD)-

//---------------------From Delhi, India--------------------



#include<bits/stdc++.h>

#include<algorithm>

using namespace std;



#define f(i,n) for(auto i=0;i<n;i++)

#define fr(i,n) for(auto i=n-1;i>=0;i--)

#define fs(i,a,b,c) for(auto i=a;i!=b;i+=c)

#define fl(i,x) for(auto i : x)

#define nl cout<<"\n";

#define ll long long int

#define vi vector<int>

#define pr pair<ll, ll>

#define vll vector<pr>

#define vl vector<ll>

#define mid(a,b) ((a+b)/2)

#define pb push_back

#define LCM(a,b) ((a*b)/__gcd(a, b))

const int INF = 0x3f3f3f3f, mod = 1e9 + 7;



class triplet{ll f, s, t;};



vl in(ll n){vl v;ll x;

    f(i,n)

    cin>>x, v.pb(x%mod);

    return v;}

void out(vl v){fl(i,v)cout<<i;}

void out(vl v, char ch){

    fl(i,v)

    cout<<i<<ch;}



void solve(){

    ll n, a;

    cin>>n>>a;

    ll ans=0;

    ans += (n%a) ? 1 : 0;

    cout<<(n/a)+ans;

}



int main(){

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    solve();

   return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.369892838882036x):
#include <stdio.h>



int main() {

  int H, A;

  scanf("%d %d", &H, &A);

  printf("%d", (H - 1) / A + 1);

  return 0;

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

    int H,A;

    cin>>H>>A;

    cout<<((H%A==0)?(H/A):((H/A)+1));

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.257937777864678x):
#include <stdio.h>



int main() {

    int H,A;

    scanf("%d%d",&H,&A);

    H%A<=0?printf("%d",H/A):printf("%d",H/A +1);

    return 0;

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



using namespace std;



int main() {



    double a,b;

    cin>>a>>b;

    cout<<int(ceil(a/b));

    

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.307914708149507x):
#include <stdio.h>



int main() {

    int H,A;

    scanf("%d%d",&H,&A);

    H%A<=0?printf("%d",H/A):printf("%d",H/A +1);

    return 0;

}
// Slower C++ solution:
//----------------------Shanu Garg here---------------------

//-------------Search on youtube : Shanu Garg---------------

//-Studying at National Institute of Technology Delhi(NITD)-

//---------------------From Delhi, India--------------------



#include<bits/stdc++.h>

#include<algorithm>

using namespace std;



#define f(i,n) for(auto i=0;i<n;i++)

#define fr(i,n) for(auto i=n-1;i>=0;i--)

#define fs(i,a,b,c) for(auto i=a;i!=b;i+=c)

#define fl(i,x) for(auto i : x)

#define nl cout<<"\n";

#define ll long long int

#define vi vector<int>

#define pr pair<ll, ll>

#define vll vector<pr>

#define vl vector<ll>

#define mid(a,b) ((a+b)/2)

#define pb push_back

#define LCM(a,b) ((a*b)/__gcd(a, b))

const int INF = 0x3f3f3f3f, mod = 1e9 + 7;



class triplet{ll f, s, t;};



vl in(ll n){vl v;ll x;

    f(i,n)

    cin>>x, v.pb(x%mod);

    return v;}

void out(vl v){fl(i,v)cout<<i;}

void out(vl v, char ch){

    fl(i,v)

    cout<<i<<ch;}



void solve(){

    ll n, a;

    cin>>n>>a;

    ll ans=0;

    ans += (n%a) ? 1 : 0;

    cout<<(n/a)+ans;

}



int main(){

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    solve();

   return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.3702599386266945x):
#include <stdio.h>



int main() {

    int H,A;

    scanf("%d%d",&H,&A);

    H%A<=0?printf("%d",H/A):printf("%d",H/A +1);

    return 0;

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

    int H,A;

    cin>>H>>A;

    cout<<((H%A==0)?(H/A):((H/A)+1));

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.248718253348631x):
#include<stdio.h>



int main (){

	int a;

	int h;

	scanf("%d %d", &h, &a);

	printf("%d\n", h%a == 0? h/a : (h/a) + 1);



	return 0;

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



using namespace std;



int main() {



    double a,b;

    cin>>a>>b;

    cout<<int(ceil(a/b));

    

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.298607551646651x):
#include<stdio.h>



int main (){

	int a;

	int h;

	scanf("%d %d", &h, &a);

	printf("%d\n", h%a == 0? h/a : (h/a) + 1);



	return 0;

}
// Slower C++ solution:
//----------------------Shanu Garg here---------------------

//-------------Search on youtube : Shanu Garg---------------

//-Studying at National Institute of Technology Delhi(NITD)-

//---------------------From Delhi, India--------------------



#include<bits/stdc++.h>

#include<algorithm>

using namespace std;



#define f(i,n) for(auto i=0;i<n;i++)

#define fr(i,n) for(auto i=n-1;i>=0;i--)

#define fs(i,a,b,c) for(auto i=a;i!=b;i+=c)

#define fl(i,x) for(auto i : x)

#define nl cout<<"\n";

#define ll long long int

#define vi vector<int>

#define pr pair<ll, ll>

#define vll vector<pr>

#define vl vector<ll>

#define mid(a,b) ((a+b)/2)

#define pb push_back

#define LCM(a,b) ((a*b)/__gcd(a, b))

const int INF = 0x3f3f3f3f, mod = 1e9 + 7;



class triplet{ll f, s, t;};



vl in(ll n){vl v;ll x;

    f(i,n)

    cin>>x, v.pb(x%mod);

    return v;}

void out(vl v){fl(i,v)cout<<i;}

void out(vl v, char ch){

    fl(i,v)

    cout<<i<<ch;}



void solve(){

    ll n, a;

    cin>>n>>a;

    ll ans=0;

    ans += (n%a) ? 1 : 0;

    cout<<(n/a)+ans;

}



int main(){

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    solve();

   return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.3608434629563x):
#include<stdio.h>



int main (){

	int a;

	int h;

	scanf("%d %d", &h, &a);

	printf("%d\n", h%a == 0? h/a : (h/a) + 1);



	return 0;

}