原题链接
题意:给你两个数a和b,q个询问,每个询问包括两个数l,r,对一个数x,l<=x<=r,x满足((x mod a) mod b)≠((x mod b)mod a),计算每一个询问
解法:我们可以假设x = k1 * a + c,x = k2 * b + d
那么如果((x mod a) mod b)=((x mod b)mod a)成立,c = d,那么x的表达式就可以表示为x = k*lcm(a,b) + e;其中e为max(a,b) - 1
# include <bits/stdc++.h>
# define sc scanf
# define pr printf
# define ll long long
using namespace std;
void solve ( ) {
int a, b, q;
sc ( "%d%d%d" , & a, & b, & q) ;
int e = max ( a, b) ;
ll lc = 1ll * a* b/ __gcd ( a, b) ;
while ( q-- ) {
ll l, r;
sc ( "%lld%lld" , & l, & r) ;
ll findl = ( l - 1 ) / lc* e;
ll temp = ( l- 1 ) % lc;
if ( temp >= e) {
findl += e;
} else {
findl += ( temp + 1 ) ;
}
ll findr = ( r) / lc* e;
temp = r % lc;
if ( temp >= e) {
findr += e;
} else {
findr += ( temp) + 1 ;
}
ll ans = r - l + 1 - findr + findl;
if ( q == 0 ) pr ( "%lld\n" , ans) ;
else pr ( "%lld " , ans) ;
}
}
int main ( ) {
int t;
sc ( "%d" , & t) ;
while ( t-- ) solve ( ) ;
}
另外用一种循环节的方法,更方便理解我只需要暴力枚举a*b里面所有不满足i%a%b != i%b%a的情况用前缀和记录下来
那么之后查询的时候就可以直接进行求解答案了(r/n-(l-1)/n) * cnt[n] + cnt[r%n]-cnt[(l-1)%n]
# include <bits/stdc++.h>
# define sc scanf
# define pr printf
# define ll long long
using namespace std;
const int maxn = 40000 + 100 ;
int cnt[ maxn] ;
void solve ( ) {
int a, b, q;
sc ( "%d%d%d" , & a, & b, & q) ;
int n = a* b;
for ( int i = 1 ; i <= n; i++ ) {
cnt[ i] = cnt[ i - 1 ] ;
if ( ( i% a% b) != ( i% b% a) ) cnt[ i] ++ ;
}
while ( q-- ) {
ll l, r;
sc ( "%lld%lld" , & l, & r) ;
ll ans = ( r/ n- ( l- 1 ) / n) * cnt[ n] + cnt[ r% n] - cnt[ ( l- 1 ) % n] ;
if ( q == 0 ) pr ( "%lld\n" , ans) ;
else pr ( "%lld " , ans) ;
}
}
int main ( ) {
int t;
sc ( "%d" , & t) ;
while ( t-- ) solve ( ) ;
}