Solution to the problem number 1066A of Codeforces - 1066A.

Any questions do not hesitate to contact.

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

int main()
{
    int cases,L,l,v,r; cin>>cases;
    while(cases--)
    {
        scanf("%d%d%d%d",&L,&v,&l,&r);
        int res = (l-1)/v;
        res+=(L-r)/v;
        int resto = (L-r)%v;
        int aux = 0;
        if(r%v!=0)  {
            aux=((r/v)+1)*v;
            if(r+resto>=aux) res++;
        }
        printf("%d\n",res);
    }
    return 0;
}

Don't miss anything.

Keep in touch with Isaac Lozano Osorio!