Educational Codeforces Round 103 (Rated for Div. 2)A. K-divisible Sum

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<map>
using namespace std;
const int maxn  = 3e5+50;
const int inf=99999999;
typedef long long ll;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n ,k ;
        cin>>n>>k;
        if(n==k)
            cout<<"1"<<endl;
        else if(n>k)
        {
            if(n%k!=0)
                cout<<"2"<<endl;
            else
                cout<<"1"<<endl;
        }
        else
        {
            if(k%n==0)
                cout<<k/n<<endl;
            else
                cout<<k/n+1<<endl;
        }
    }
}
//9
//1 4 1 1 4 1 4 1 4