牛客练习赛33 tokitsukaze and Counting

题目链接

这个题应该是最简单的一个

右端点/x-左端点/x的值就行了。。不过要注意左端点值是否为x的倍数 

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<string.h>
#include<queue>
#include<stack>
#include<list>
#include<map>
#include<set>
#include<vector>
using namespace std;
typedef long long int ll;
const int maxn =1e5+5;
const int maxm=10000;
const int mod =1e9+7;
const int INF=0x3f3f3f3f;
const double eps=1e-8;
int a[maxn];
int ans,sum;
int main()
{
	int t;scanf("%d",&t);
	while(t--)
	{
		ll l,r,x;scanf("%lld%lld%lld",&l,&r,&x);
		printf("%lld\n",r/x-(l%x==0?l/x-1:l/x));
	}
    return 0;
}