Codeforces Function Height

#include<stdio.h>
#include<math.h>
#include<string.h>
#define LL long long

LL n, k, t, m;
int main()
{
    while(~scanf("%lld %lld", &n, &k)){
        t = k / n;
        if(k % n != 0){
            printf("%lld\n", t+1);
        }
        else{
            printf("%lld\n", t);
        }
    }
    return 0;
}

思路
一条长2n+1的坐标轴，可以在任意奇数点上加k次，输出加k次后该坐标轴的最小高度