stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include<iostream>

#include<math.h>

#define pi 2*acos(0)

int main()

{

    int a,b,c;

    int x=0;

    std::cin>>a>>b>>c;



    x = c/a;

    if(a*x>= b){

        std::cout<<"OK"<<std::endl;

    }

    else{

        

        std::cout<<"NG"<<std::endl;

    }

    return 0;

}

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

int main() {

    int k, a, b, flag = 0;

    scanf("%d", &k);

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

    for (int i = 1; i <= b; i++) {

        int test = k * i;

        if (test >= a && test <= b) {

            flag = 1;

            break;

        }

    }

    if (flag) {

        printf("OK");

    } else {

        printf("NG");

    }

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

using namespace std;



typedef long long ll;



main()

{

    int a, b, k, i;

    cin >> k >> a >> b;

    for(i = a; i <=b; i++){

        if(i % k == 0){

            cout << "OK";

            break;

        }

    }

    if(i == b+1){

        cout << "NG";

    }







}











///promy_pompom

//hello world


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

int main() {

    int k, a, b, flag = 0;

    scanf("%d", &k);

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

    for (int i = 1; i <= b; i++) {

        int test = k * i;

        if (test >= a && test <= b) {

            flag = 1;

            break;

        }

    }

    if (flag) {

        printf("OK");

    } else {

        printf("NG");

    }

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

using namespace std;

int main()

{

	int k,a,b;

	cin>>k>>a>>b;

	if(b/k-a/k!=0||a%k==0)

		puts("OK");

	else

		puts("NG");

}

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



int main() {

  int K, A, B, objective = 0;

  scanf("%d %d %d", &K, &A, &B);

  

  for(int i = A; i <= B; i++) {

    if(i % K == 0) {

      objective = 1;

      break;

    }

  }



  (objective) ? puts("OK") : puts("NG");

  return 0;

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

using namespace std;



#define fi first

#define se second

#define mp make_pair

#define pb push_back

#define pop_b pop_back

#define pf push_front

#define pop_f pop_front



typedef long long ll;

typedef pair<ll,ll> ii;

typedef long double ld; 

typedef vector<int> vi;



#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }

void err(istream_iterator<string> it) {}

template<typename T, typename... Args>

void err(istream_iterator<string> it, T a, Args... args) {

	cerr << *it << " = " << a << endl;

	err(++it, args...);

}



#define rep(i, n) for (ll i = 0; i < (n); i++)

#define repr(i, n) for (ll i = (n) - 1; i >= 0; i--)

#define rep2(i, l, r) for (ll i = (l); i < (r); i++)

#define rep2r(i, l, r) for (ll i = (r) - 1; i >= (l); i--)



int main()

{

	int k, a, b;

	cin>>k>>a>>b;

	int p = (a)/k;

	cout<<(k*(p + (a%k ? 1 : 0)) <= b ? "OK" : "NG")<<endl;

}

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



int main() {

  int K, A, B, objective = 0;

  scanf("%d %d %d", &K, &A, &B);

  

  for(int i = A; i <= B; i++) {

    if(i % K == 0) {

      objective = 1;

      break;

    }

  }



  (objective) ? puts("OK") : puts("NG");

  return 0;

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

using namespace std;

int main()

{

    int a, b, k, i;

    cin>>k>>a>>b;

    for(i=a; i<=b; i++)

    {

        if(i%k==0)

        {

             cout<<"OK";

           return 0;

        }

    }

     cout<< "NG"<<endl;

     return 0;

}


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



int main() {

  int K, A, B, objective = 0;

  scanf("%d %d %d", &K, &A, &B);

  

  for(int i = A; i <= B; i++) {

    if(i % K == 0) {

      objective = 1;

      break;

    }

  }



  (objective) ? puts("OK") : puts("NG");

  return 0;

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

#include<math.h>

#define pi 2*acos(0)

int main()

{

    int a,b,c;

    int x=0;

    std::cin>>a>>b>>c;



    x = c/a;

    if(a*x>= b){

        std::cout<<"OK"<<std::endl;

    }

    else{

        

        std::cout<<"NG"<<std::endl;

    }

    return 0;

}

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



int main() {

  int K, A, B, objective = 0;

  scanf("%d %d %d", &K, &A, &B);

  

  for(int i = A; i <= B; i++) {

    if(i % K == 0) {

      objective = 1;

      break;

    }

  }



  (objective) ? puts("OK") : puts("NG");

  return 0;

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

using namespace std;



typedef long long ll;



main()

{

    int a, b, k, i;

    cin >> k >> a >> b;

    for(i = a; i <=b; i++){

        if(i % k == 0){

            cout << "OK";

            break;

        }

    }

    if(i == b+1){

        cout << "NG";

    }







}











///promy_pompom

//hello world


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



int main() {

  int K, A, B, objective = 0;

  scanf("%d %d %d", &K, &A, &B);

  

  for(int i = A; i <= B; i++) {

    if(i % K == 0) {

      objective = 1;

      break;

    }

  }



  (objective) ? puts("OK") : puts("NG");

  return 0;

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

using namespace std;

int main()

{

	int k,a,b;

	cin>>k>>a>>b;

	if(b/k-a/k!=0||a%k==0)

		puts("OK");

	else

		puts("NG");

}

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



int main(){

    

    int k, a, b;

    scanf("%d", &k);

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

    

    for(int i = 1 ; i < 1000 ; i++){

    	int temp = k;

    	temp*=i;

		// printf("Temp number: %d\n", temp);

		if(temp >= a && temp <= b){

    		printf("OK\n");

    		// printf("%d\n", i);

			break;

		}

		else if(temp > b){

			printf("NG\n");

			// printf("%d\n", i);

			break;

		}

	}

    

	

	return 0;

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

using namespace std;



#define fi first

#define se second

#define mp make_pair

#define pb push_back

#define pop_b pop_back

#define pf push_front

#define pop_f pop_front



typedef long long ll;

typedef pair<ll,ll> ii;

typedef long double ld; 

typedef vector<int> vi;



#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }

void err(istream_iterator<string> it) {}

template<typename T, typename... Args>

void err(istream_iterator<string> it, T a, Args... args) {

	cerr << *it << " = " << a << endl;

	err(++it, args...);

}



#define rep(i, n) for (ll i = 0; i < (n); i++)

#define repr(i, n) for (ll i = (n) - 1; i >= 0; i--)

#define rep2(i, l, r) for (ll i = (l); i < (r); i++)

#define rep2r(i, l, r) for (ll i = (r) - 1; i >= (l); i--)



int main()

{

	int k, a, b;

	cin>>k>>a>>b;

	int p = (a)/k;

	cout<<(k*(p + (a%k ? 1 : 0)) <= b ? "OK" : "NG")<<endl;

}

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



int main(){

    

    int k, a, b;

    scanf("%d", &k);

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

    

    for(int i = 1 ; i < 1000 ; i++){

    	int temp = k;

    	temp*=i;

		// printf("Temp number: %d\n", temp);

		if(temp >= a && temp <= b){

    		printf("OK\n");

    		// printf("%d\n", i);

			break;

		}

		else if(temp > b){

			printf("NG\n");

			// printf("%d\n", i);

			break;

		}

	}

    

	

	return 0;

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

using namespace std;

int main()

{

    int a, b, k, i;

    cin>>k>>a>>b;

    for(i=a; i<=b; i++)

    {

        if(i%k==0)

        {

             cout<<"OK";

           return 0;

        }

    }

     cout<< "NG"<<endl;

     return 0;

}


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



int main(){

    

    int k, a, b;

    scanf("%d", &k);

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

    

    for(int i = 1 ; i < 1000 ; i++){

    	int temp = k;

    	temp*=i;

		// printf("Temp number: %d\n", temp);

		if(temp >= a && temp <= b){

    		printf("OK\n");

    		// printf("%d\n", i);

			break;

		}

		else if(temp > b){

			printf("NG\n");

			// printf("%d\n", i);

			break;

		}

	}

    

	

	return 0;

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

#include<math.h>

#define pi 2*acos(0)

int main()

{

    int a,b,c;

    int x=0;

    std::cin>>a>>b>>c;



    x = c/a;

    if(a*x>= b){

        std::cout<<"OK"<<std::endl;

    }

    else{

        

        std::cout<<"NG"<<std::endl;

    }

    return 0;

}

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



int main(){

    

    int k, a, b;

    scanf("%d", &k);

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

    

    for(int i = 1 ; i < 1000 ; i++){

    	int temp = k;

    	temp*=i;

		// printf("Temp number: %d\n", temp);

		if(temp >= a && temp <= b){

    		printf("OK\n");

    		// printf("%d\n", i);

			break;

		}

		else if(temp > b){

			printf("NG\n");

			// printf("%d\n", i);

			break;

		}

	}

    

	

	return 0;

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

using namespace std;



typedef long long ll;



main()

{

    int a, b, k, i;

    cin >> k >> a >> b;

    for(i = a; i <=b; i++){

        if(i % k == 0){

            cout << "OK";

            break;

        }

    }

    if(i == b+1){

        cout << "NG";

    }







}











///promy_pompom

//hello world


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



int main(){

    

    int k, a, b;

    scanf("%d", &k);

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

    

    for(int i = 1 ; i < 1000 ; i++){

    	int temp = k;

    	temp*=i;

		// printf("Temp number: %d\n", temp);

		if(temp >= a && temp <= b){

    		printf("OK\n");

    		// printf("%d\n", i);

			break;

		}

		else if(temp > b){

			printf("NG\n");

			// printf("%d\n", i);

			break;

		}

	}

    

	

	return 0;

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

using namespace std;

int main()

{

	int k,a,b;

	cin>>k>>a>>b;

	if(b/k-a/k!=0||a%k==0)

		puts("OK");

	else

		puts("NG");

}

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



int main(){

	int n;

	scanf("%d", &n);

	int T, K;

	scanf ("%d %d", &T, &K);

	

	for (int i = T; i <= K; i++){

		if (i % n == 0){

			puts("OK");

			return 0;

		}

		else continue;

	}

	puts("NG");

	return 0;

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

using namespace std;



#define fi first

#define se second

#define mp make_pair

#define pb push_back

#define pop_b pop_back

#define pf push_front

#define pop_f pop_front



typedef long long ll;

typedef pair<ll,ll> ii;

typedef long double ld; 

typedef vector<int> vi;



#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }

void err(istream_iterator<string> it) {}

template<typename T, typename... Args>

void err(istream_iterator<string> it, T a, Args... args) {

	cerr << *it << " = " << a << endl;

	err(++it, args...);

}



#define rep(i, n) for (ll i = 0; i < (n); i++)

#define repr(i, n) for (ll i = (n) - 1; i >= 0; i--)

#define rep2(i, l, r) for (ll i = (l); i < (r); i++)

#define rep2r(i, l, r) for (ll i = (r) - 1; i >= (l); i--)



int main()

{

	int k, a, b;

	cin>>k>>a>>b;

	int p = (a)/k;

	cout<<(k*(p + (a%k ? 1 : 0)) <= b ? "OK" : "NG")<<endl;

}

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



int main(){

	int n;

	scanf("%d", &n);

	int T, K;

	scanf ("%d %d", &T, &K);

	

	for (int i = T; i <= K; i++){

		if (i % n == 0){

			puts("OK");

			return 0;

		}

		else continue;

	}

	puts("NG");

	return 0;

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

using namespace std;

int main()

{

    int a, b, k, i;

    cin>>k>>a>>b;

    for(i=a; i<=b; i++)

    {

        if(i%k==0)

        {

             cout<<"OK";

           return 0;

        }

    }

     cout<< "NG"<<endl;

     return 0;

}


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



int main(){

	int n;

	scanf("%d", &n);

	int T, K;

	scanf ("%d %d", &T, &K);

	

	for (int i = T; i <= K; i++){

		if (i % n == 0){

			puts("OK");

			return 0;

		}

		else continue;

	}

	puts("NG");

	return 0;

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

#include<math.h>

#define pi 2*acos(0)

int main()

{

    int a,b,c;

    int x=0;

    std::cin>>a>>b>>c;



    x = c/a;

    if(a*x>= b){

        std::cout<<"OK"<<std::endl;

    }

    else{

        

        std::cout<<"NG"<<std::endl;

    }

    return 0;

}

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



int main(){

	int n;

	scanf("%d", &n);

	int T, K;

	scanf ("%d %d", &T, &K);

	

	for (int i = T; i <= K; i++){

		if (i % n == 0){

			puts("OK");

			return 0;

		}

		else continue;

	}

	puts("NG");

	return 0;

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

using namespace std;



typedef long long ll;



main()

{

    int a, b, k, i;

    cin >> k >> a >> b;

    for(i = a; i <=b; i++){

        if(i % k == 0){

            cout << "OK";

            break;

        }

    }

    if(i == b+1){

        cout << "NG";

    }







}











///promy_pompom

//hello world


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



int main(){

	int n;

	scanf("%d", &n);

	int T, K;

	scanf ("%d %d", &T, &K);

	

	for (int i = T; i <= K; i++){

		if (i % n == 0){

			puts("OK");

			return 0;

		}

		else continue;

	}

	puts("NG");

	return 0;

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

using namespace std;

int main()

{

	int k,a,b;

	cin>>k>>a>>b;

	if(b/k-a/k!=0||a%k==0)

		puts("OK");

	else

		puts("NG");

}

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



int main(){

	

int k,a,b;

int ctr = 0;

scanf("%d",&k);

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



  for (int i=a;i<=b;i++){

	if(i%k==0){

		ctr = 1; 

	}

  }  

	if(ctr==1){

		printf("OK\n");

	}

	else{

		printf("NG\n");

	}	

		return 0;

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

using namespace std;



#define fi first

#define se second

#define mp make_pair

#define pb push_back

#define pop_b pop_back

#define pf push_front

#define pop_f pop_front



typedef long long ll;

typedef pair<ll,ll> ii;

typedef long double ld; 

typedef vector<int> vi;



#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }

void err(istream_iterator<string> it) {}

template<typename T, typename... Args>

void err(istream_iterator<string> it, T a, Args... args) {

	cerr << *it << " = " << a << endl;

	err(++it, args...);

}



#define rep(i, n) for (ll i = 0; i < (n); i++)

#define repr(i, n) for (ll i = (n) - 1; i >= 0; i--)

#define rep2(i, l, r) for (ll i = (l); i < (r); i++)

#define rep2r(i, l, r) for (ll i = (r) - 1; i >= (l); i--)



int main()

{

	int k, a, b;

	cin>>k>>a>>b;

	int p = (a)/k;

	cout<<(k*(p + (a%k ? 1 : 0)) <= b ? "OK" : "NG")<<endl;

}

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



int main(){

	

int k,a,b;

int ctr = 0;

scanf("%d",&k);

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



  for (int i=a;i<=b;i++){

	if(i%k==0){

		ctr = 1; 

	}

  }  

	if(ctr==1){

		printf("OK\n");

	}

	else{

		printf("NG\n");

	}	

		return 0;

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

using namespace std;

int main()

{

    int a, b, k, i;

    cin>>k>>a>>b;

    for(i=a; i<=b; i++)

    {

        if(i%k==0)

        {

             cout<<"OK";

           return 0;

        }

    }

     cout<< "NG"<<endl;

     return 0;

}


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



int main(){

	

int k,a,b;

int ctr = 0;

scanf("%d",&k);

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



  for (int i=a;i<=b;i++){

	if(i%k==0){

		ctr = 1; 

	}

  }  

	if(ctr==1){

		printf("OK\n");

	}

	else{

		printf("NG\n");

	}	

		return 0;

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

#include<math.h>

#define pi 2*acos(0)

int main()

{

    int a,b,c;

    int x=0;

    std::cin>>a>>b>>c;



    x = c/a;

    if(a*x>= b){

        std::cout<<"OK"<<std::endl;

    }

    else{

        

        std::cout<<"NG"<<std::endl;

    }

    return 0;

}

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



int main(){

	

int k,a,b;

int ctr = 0;

scanf("%d",&k);

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



  for (int i=a;i<=b;i++){

	if(i%k==0){

		ctr = 1; 

	}

  }  

	if(ctr==1){

		printf("OK\n");

	}

	else{

		printf("NG\n");

	}	

		return 0;

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

using namespace std;



typedef long long ll;



main()

{

    int a, b, k, i;

    cin >> k >> a >> b;

    for(i = a; i <=b; i++){

        if(i % k == 0){

            cout << "OK";

            break;

        }

    }

    if(i == b+1){

        cout << "NG";

    }







}











///promy_pompom

//hello world


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



int main(){

	

int k,a,b;

int ctr = 0;

scanf("%d",&k);

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



  for (int i=a;i<=b;i++){

	if(i%k==0){

		ctr = 1; 

	}

  }  

	if(ctr==1){

		printf("OK\n");

	}

	else{

		printf("NG\n");

	}	

		return 0;

}
// Slower C++ solution:
			

#include <iostream>

#include <cstdio>

#include <cctype>

using namespace std;

 

int main()

{

  char ch;

  while(1){

    scanf("%c",&ch); //scanf???' '???????????????

    if(ch=='\n') break;

    if(islower(ch)!=0){ //?°???????????????°true

      ch=toupper(ch); //?°?????????? ??§??????

      cout << ch;

    }else if(isupper(ch)!=0){ //??§??????????????°true

      ch=tolower(ch); //??§????????? ?°???????

      cout << ch;

    }else{

      cout << ch;

    }

  }

  cout << endl;

  return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.208353280028827x):
#include<cstdio>

#include<cctype>

int main()

{

    char ch;

    while(1)

    {

        scanf("%c", &ch);

        if( isalpha(ch) )

        {

            if( islower(ch) ) printf("%c", toupper(ch));

            else printf("%c", tolower(ch));

        }

        else printf("%c", ch);

    if ( ch == '\n' )break;

    }

    return 0;

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

#include <cctype>

#include <cstdio>

using namespace std;



int main()

{

	char ch;//ch:?????????

	

	while(1){

		scanf("%c",&ch);

		if(ch == '\n') break;

		

		if(islower(ch) != 0){ //ch????°???????????????\????°????????????????

			ch = toupper(ch); //?°????????????§??????

			cout << ch;

		}else if(isupper(ch) != 0){ //??§???????????????????????\?????§???????????????

			ch = tolower(ch); //o??????????°???????

			cout << ch;

		}else{ //??±????????\???

			cout << ch;

		}

	}

	cout << endl;

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.208018091340616x):
#include<cstdio>

#include<cctype>

int main()

{

    char ch;

    while(1)

    {

        scanf("%c", &ch);

        if( isalpha(ch) )

        {

            if( islower(ch) ) printf("%c", toupper(ch));

            else printf("%c", tolower(ch));

        }

        else printf("%c", ch);

    if ( ch == '\n' )break;

    }

    return 0;

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

using namespace std;

int main(){

	

		double h,b;

		cin>>h>>b;

		cout<<ceil(h/b);

	return 0;

}

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



int main () {

	int H, A ;

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

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

	

	return 0;

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

using namespace std;

int main(){

	

		double h,b;

		cin>>h>>b;

		cout<<ceil(h/b);

	return 0;

}

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

int main()

{

	int h,a;

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

	if(h%a==0) printf("%d\n",h/a);

	else printf("%d",h/a+1);

	return 0;

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

using namespace std;

int main(){

	

		double h,b;

		cin>>h>>b;

		cout<<ceil(h/b);

	return 0;

}

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



int main() 

{

	int H;

	int A;

	int F;

	

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

	

	F = H/A;

	

	H%A>0 ? printf("%d", F+1) : printf("%d", F);

	

	return 0;

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

using namespace std;

int main(){

	

		double h,b;

		cin>>h>>b;

		cout<<ceil(h/b);

	return 0;

}

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



int main(){

	int health,attack;

	scanf("%d%d",&health,&attack);

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





	return 0;

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

using namespace std;

int main(){

	

		double h,b;

		cin>>h>>b;

		cout<<ceil(h/b);

	return 0;

}

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



int main()

{

    int monster;

    int attack;



    scanf("%d %d", &monster, &attack);



    (monster % attack > 0) ? printf("%d", (monster / attack) + 1) : printf("%d", (monster / attack));



    return 0;

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

using namespace std;

int main(){

	

		double h,b;

		cin>>h>>b;

		cout<<ceil(h/b);

	return 0;

}

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

int main ()

{

	int health, damage;

	scanf ("%d %d", &health, &damage);

    health%damage == 0 ? printf ("%d", health/damage) : printf("%d",(health/damage)+1 );

return (0);

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

using namespace std;

int main(){

	

		double h,b;

		cin>>h>>b;

		cout<<ceil(h/b);

	return 0;

}

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



int main() {

    int h, a;

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

    int divide = h/a;

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

     

    return 0;

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

using namespace std;

int main(){

	

		double h,b;

		cin>>h>>b;

		cout<<ceil(h/b);

	return 0;

}

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



int main(){

	

	int health, attack, result;

	

	scanf("%d %d", &health, &attack);

	

	result = health % attack <= 0 ? printf("%d", health / attack) : printf("%d", health / attack + 1);



return 0;



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

using namespace std;

int main(){

	

		double h,b;

		cin>>h>>b;

		cout<<ceil(h/b);

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.373540505240906x):




#include<stdio.h>





int main(){

     

    int H;

    int A;

    

    

    

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

    int Damage = H%A;

    Damage == 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 h,b;

		cin>>h>>b;

		cout<<ceil(h/b);

	return 0;

}

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

int main() {

 int h,a;

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

 int x = h/a;

 int z = h%a;

 if (z==0)

 		printf("%d",x);

	else 

		printf("%d", ++x);

return 0;

}