题目:给你初始为1,2,3,..,n的n个数,有m个操作,一共有2中类型的操作,1,x,y,p,询问区间[x,y]与p互质的数的和,2,x,y将第x个数变成y
1<=n<=400000
1<=m<=1000
思路:由于m不大,我们可以用容斥定理先把区间[x,y]里与p互质的数的和算出来,将每次的改变操作用map存下来,暴力枚举map里的数
代码:
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<iostream>
#include<algorithm>
#include<ctime>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<list>
#include<numeric>
using namespace std;
#define LL long long
#define ULL unsigned long long
#define INF 0x3f3f3f3f3f3f3f3f
#define mm(a,b) memset(a,b,sizeof(a))
#define PP puts("*********************");
template<class T> T f_abs(T a){ return a > 0 ? a : -a; }
template<class T> T gcd(T a, T b){ return b ? gcd(b, a%b) : a; }
template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
// 0x3f3f3f3f3f3f3f3f
const int maxn=4e5+50;
bool isprime[maxn];
int prime[maxn],tol;
void make_prime(int n){
for(int i=0;i<=n;i++)
isprime[i]=true;
isprime[0]=isprime[1]=false;
tol=0;
for(int i=2;i<=n;i++){
if(isprime[i])
prime[tol++]=i;
for(int j=0;j<tol;j++){
if(i*prime[j]<=n)
isprime[i*prime[j]]=false;
else
break;
if(i%prime[j]==0)
break;
}
}
}
int fac[20],cnt;
void getfac(int n){
cnt=0;
int x=n;
for(int i=0;i<tol&&prime[i]*prime[i]<=n;i++){
if(x%prime[i]==0){
fac[cnt++]=prime[i];
while(x%prime[i]==0)
x/=prime[i];
}
}
if(x>1)
fac[cnt++]=x;
}
LL ans;
void dfs(int i,int x,int num,int lim,int n){
if(num==lim){
int k=n/x;
if(num%2==1) ans-=(LL)x*k*(k+1)/2;
else ans+=(LL)x*k*(k+1)/2;
return;
}
if(i==cnt) return;
if(x>n) return;
dfs(i+1,x*fac[i],num+1,lim,n);
dfs(i+1,x,num,lim,n);
}
LL solve(int n,int p){
if(n<=0) return 0;
getfac(p);
ans=(LL)n*(n+1)/2;
for(int i=1;i<=cnt;i++){
dfs(0,1,0,i,n);
}
return ans;
}
map<int,int> mp;
map<int,int>::iterator it;
int main(){
int T,n,m,op,x,y,p;
make_prime(maxn-5);
scanf("%d",&T);
while(T--){
mp.clear();
scanf("%d%d",&n,&m);
while(m--){
scanf("%d%d%d",&op,&x,&y);
if(op==1){
scanf("%d",&p);
LL res=0;
res=solve(y,p)-solve(x-1,p);
for(it=mp.begin();it!=mp.end();it++){
if(it->first>=x&&it->first<=y){
if(gcd(it->first,p)==1) res-=it->first;
if(gcd(it->second,p)==1) res+=it->second;
}
}
printf("%lld\n",res);
}
else{
mp[x]=y;
}
}
}
return 0;
}