【Codeforces Round #538 (Div. 2)】A B C D E F

最新推荐文章于 2021-03-03 19:08:34 发布

原创最新推荐文章于 2021-03-03 19:08:34 发布 · 423 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

ACM 同时被 2 个专栏收录

455 篇文章

订阅专栏

Codeforces

71 篇文章

订阅专栏

本文详细解析了Codeforces Round #538 (Div. 2)的六道题目，包括：A题通过特判解决葡萄分配问题；B题通过排序和标记法求解最大和及分组策略；C题讨论进制转换中的质因数问题；D题利用区间DP解决颜色块变换问题；E题结合二分查找和GCD计算最大差值；F题实现区间操作和计算欧拉函数，采用质因数分解和快速幂优化算法。

题意有三个人 A 只吃绿葡萄 B 只吃绿葡萄和紫葡萄 C什么葡萄都吃

A B C 三人分别要吃 x y z个葡萄然后给你 a b c代表绿紫黑葡萄数问你能不能满足

做法满足的情况很少所以初始化不满足特判满足即可

#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}

int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    bool flag = false;
    int sum = 0,x,y,z,a,b,c;
    scanf("%d%d%d%d%d%d",&x,&y,&z,&a,&b,&c);
    sum = a+ b+c;
    if(a>=x)
    {
        if(b+(a-x)>=y)
        {
            if(sum - x- y >= z)
            {
                flag = true;
            }
        }
    }
    if(flag) printf("YES\n");
    else printf("NO\n");
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}

题意给你n个数分成k组每组选出m个最大的问你和最大以及怎么分组

做法我们将原数组排个序把前m*k大的都标记上然后扫一遍你只要取到m个就可以分一组了

#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
const int MAX_N = 200025;
struct node{
    int a,id;
    bool operator< (const node other) const
    {
        return a > other.a;
    }
}arr[MAX_N];
bool cmp(node a,node b)
{
    return a.id <b.id;
}
bool flag[MAX_N];
int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int n,m,k;
    long long sum = 0;
    scanf("%d%d%d",&n,&m,&k);
    for(int i = 1;i<=n;++i) scanf("%d",&arr[i].a),arr[i].id = i;
    sort(arr+1,arr+1+n);
    for(int i = 1;i<=m*k;i++) sum+=arr[i].a,flag[arr[i].id] = true;
    sort(arr+1,arr+1+n,cmp);
    int cnt = 0,tmp = 1;
    printf("%lld\n",sum);
    for(int i = 1;i<=n;++i)
    {
        if(flag[i])
        {
            cnt++;
        }
        //dbg2(i,cnt);
        if(cnt!=0&&cnt%m==0&&tmp<k)
        {
            printf("%d ",i);
            cnt = 0;
            tmp++;
        }
    }
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}

这道题的十进制版本在校赛上遇到过

做法我们知道十进制的时候是找 min(2数目，5数目)

就是找这个进制质因数然后可以通过这个函数实现

long long ans(long long x,long long y)
{
    if(x<y) return 0;
    return x/y + ans(x/y,y);
}

注意找到你要除以k[i] 因为质因数为 p[i]^k[i] 取个min 就是满足的0条件了

#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
const int MAX_N = 6e5;
int cnt;
long long k[MAX_N],p[MAX_N];
void divide(long long x)
{
    for(long long i = 2;i*i<=x;i++)
    {
        if(x%i==0)
        {
            p[++cnt] = i;
            while(x%i==0)
            {
                k[cnt]++;
                x/=i;
            }
        }
    }
    if(x>1)
        {
            p[++cnt] = x;
            k[cnt]++;
        }
}
long long ans(long long x,long long y)
{
    if(x<y) return 0;
    return x/y + ans(x/y,y);
}
long long solve(long long a,long long b)
{
    divide(b);
    long long minn = 0x7f7f7f7f7f7f7f7f;
    for(int i = 1;i<=cnt;++i)
    {
        //dbg3(i,p[i],k[i]);
       // dbg3(ans(a,p[i]),minn,1ll*ans(a,p[i])/(1ll*k[i]));
        minn = min(minn,1ll*ans(a,p[i])/(1ll*k[i]));
    }
    return minn;
}
int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    long long a,b;
    scanf("%lld%lld",&a,&b);
    printf("%lld\n",solve(a,b));
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}

题意给你n个颜色块相同颜色的视为一个联通快你每次可以改变一个联通快颜色问你把所有块都变成一个颜色(但是要包含第一个改变的值

做法区间dp dp[l][r][0/1] 其中 0代表 l到r 区间换左边的贡献 1代表 l 到 r 区间换右边的贡献然后特判一下C[l] 与C[r] 是否相等即可

#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
const int MAX_N = 5025;
int arr[MAX_N],C[MAX_N];
int dp[MAX_N][MAX_N][2];

int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int n,cnt = 0;
    scanf("%d",&n);
    for(int i = 1;i<=n;++i) scanf("%d",&arr[i]);
    C[++cnt] = arr[1];
    for(int i = 2;i<=n;++i)
    {
       if(arr[i]==arr[i-1]) continue;
       else C[++cnt] = arr[i];
    }
    n = cnt;
    for(int i = 1;i<=n;++i)
        for(int  j = 1;j<=n;++j)
            dp[i][j][0] = dp[i][j][1] = inf;
    for(int i = 1;i<=n;++i) dp[i][i][0] =dp[i][i][1]= 0;
    for(int i = 2;i<=n;i++)
    {
        for(int j = 1;j<=n-i+1;j++)
        {
            int l = j,r = j + i - 1;
            dp[l][r][0] = min(dp[l][r][0],min(dp[l+1][r][1]+((C[l]==C[r])?0:1),dp[l+1][r][0] + 1));
            dp[l][r][1] = min(dp[l][r][1],min(dp[l][r-1][0]+((C[l]==C[r])?0:1),dp[l][r-1][1]+1));
        }
    }
    printf("%d\n",min(dp[1][n][0],dp[1][n][1]));
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}

题意给你n个数然后你可以两种操作 > 问大于一个数是否存在 ?问坐标第i个的数是什么

那么1e9 你可以30以内二分出最大值然后剩下的去随机取数然后做差再用这些差取gcd 就是d

答案就是最大值 -(n-1) * d

#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
#include <random>
#include <ctime>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
map<int ,int > mp;
int tim;
bool check(int x)
{
    tim--;
    cout << "> " << x << endl;
    int ans ;
    cin >> ans;
    if(ans) return 1;
    else return 0;
}
long long arr[100];

int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    mt19937 mt_rand(time(0));
    mp.clear();
    tim = 60;
    int n,ans;
    cin >> n;
    int l = 0,r = 1000000000;
    while(l<=r)
    {
        int mid = (l+r)>>1;
        if(check(mid)) ans = mid ,l = mid + 1;
        else r = mid - 1;
    }
    int maxx = ans + 1;
    int cnt = 0;
    while(tim--)
    {
        int p = mt_rand()%n + 1;
        int tt = 0;
        while(mp[p]&&tt<1000000)
        {
            tt++;
            p = mt_rand()%n+1;
        }
        mp[p] = 1;
        cout << "? " << p << endl;
        cin >> arr[++cnt];
        if(cnt>=n) break;//防止询问超过数组长度
    }
    sort(arr+1,arr+cnt+1);
    for(int i = 1;i<cnt;i++)
        arr[i] = arr[i+1] - arr[i];
    long long tmp = arr[1];
    for(int i = 1;i<cnt;++i)
        tmp = gcd(1ll*arr[i],tmp);
    cout << "! " << maxx-(n-1)*tmp << " "<< tmp <<endl;
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}

给定长为nn的序列AiAi，要求支持两种操作：

1 l,r,v 区间l 到 r 内乘上v

2 求l 到r所有数成绩的欧拉函数 .

我们知道欧拉函数等于质因数分解后 n * 所有(质因数 -1)/质因数

因为300 以内质数只有62个所以我们可以开long long 状压然后这个区间乘有幂所以写了个快速幂所以复杂度为

q*(log*log + 62)

val代表原始值 col代表区间乘懒惰标记还得传一个父亲的 colf

#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
#include <random>
#include <ctime>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define MOD 1000000007

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
const int MAX_N = 4e5+5,M = 301,Lim = 62;
//inv[1]=1;
//for(int i=2; i<M; ++i) inv[i]=1ll*(mod-mod/i)*inv[mod%i]%mod;
//for(int i=0; i<LIM; ++i) coef[i]=1ll*(P[i]-1)*inv[P[i]]%mod;
//2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293
//0,0,0,1,0,2,0,3,0,0,0,4,0,5,0,0,0,6,0,7,0,0,0,8,0,0,0,0,0,9,0,10,0,0,0,0,0,11,0,0,0,12,0,13,0,0,0,14,0,0,0,0,0,15,0,0,0,0,0,16,0,17,0,0,0,0,0,18,0,0,0,19,0,20,0,0,0,0,0,21,0,0,0,22,0,0,0,0,0,23,0,0,0,0,0,0,0,24,0,0,0,25,0,26,0,0,0,27,0,28,0,0,0,29,0,0,0,0,0,0,0,0,0,0,0,0,0,30,0,0,0,31,0,0,0,0,0,32,0,33,0,0,0,0,0,0,0,0,0,34,0,35,0,0,0,0,0,36,0,0,0,0,0,37,0,0,0,38,0,0,0,0,0,39,0,0,0,0,0,40,0,41,0,0,0,0,0,0,0,0,0,42,0,43,0,0,0,44,0,45,0,0,0,0,0,0,0,0,0,0,0,46,0,0,0,0,0,0,0,0,0,0,0,47,0,0,0,48,0,49,0,0,0,50,0,0,0,0,0,51,0,52,0,0,0,0,0,0,0,0,0,53,0,0,0,0,0,54,0,0,0,0,0,55,0,0,0,0,0,56,0,57,0,0,0,0,0,58,0,0,0,59,0,60,0,0,0,0,0,0,0,0,0,61,0,0,0,0,0,0,0
int P[Lim] = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293};
int rev[M] ={0,0,0,1,0,2,0,3,0,0,0,4,0,5,0,0,0,6,0,7,0,0,0,8,0,0,0,0,0,9,0,10,0,0,0,0,0,11,0,0,0,12,0,13,0,0,0,14,0,0,0,0,0,15,0,0,0,0,0,16,0,17,0,0,0,0,0,18,0,0,0,19,0,20,0,0,0,0,0,21,0,0,0,22,0,0,0,0,0,23,0,0,0,0,0,0,0,24,0,0,0,25,0,26,0,0,0,27,0,28,0,0,0,29,0,0,0,0,0,0,0,0,0,0,0,0,0,30,0,0,0,31,0,0,0,0,0,32,0,33,0,0,0,0,0,0,0,0,0,34,0,35,0,0,0,0,0,36,0,0,0,0,0,37,0,0,0,38,0,0,0,0,0,39,0,0,0,0,0,40,0,41,0,0,0,0,0,0,0,0,0,42,0,43,0,0,0,44,0,45,0,0,0,0,0,0,0,0,0,0,0,46,0,0,0,0,0,0,0,0,0,0,0,47,0,0,0,48,0,49,0,0,0,50,0,0,0,0,0,51,0,52,0,0,0,0,0,0,0,0,0,53,0,0,0,0,0,54,0,0,0,0,0,55,0,0,0,0,0,56,0,57,0,0,0,0,0,58,0,0,0,59,0,60,0,0,0,0,0,0,0,0,0,61,0,0,0,0,0,0,0};
long long val[MAX_N<<2],col[MAX_N<<2];
long long now,Ans,s[MAX_N<<2],colf[MAX_N<<2];
void up(int rt,int l,int r)
{
    s[rt] = s[rt<<1]|s[rt<<1|1];
    val[rt] = 1ll*val[rt<<1]*val[rt<<1|1]%MOD;
}
long long FP(int x,int k)
{
    long long t = 1;
    for(;k;k>>=1,x=1ll*x*x%MOD)
        if(k&1) t = 1ll*t *x %MOD;
    return t;
}
void update(int rt,int l,int r,long long v,long long vf)
{
    val[rt] = 1ll*val[rt] *FP(v,r-l+1)%MOD;
    col[rt] = 1ll*col[rt]*v%MOD;
    s[rt]|=vf;
    colf[rt]|=vf;
}

void build(int rt,int l,int r)
{
    col[rt] = 1;
    if(l==r)
    {
        int v;
        scanf("%d",&v);
        val[rt] = v;
        for(int i = 0;i<Lim&&P[i]*P[i]<=v;++i)
        {
            if(v%P[i]==0)
            {
                s[rt] |= 1ll<<i,v/=P[i];
                while(v%P[i]==0) v/=P[i];
            }
        }
        if(v!=1) s[rt]|=1ll<<rev[v];
        return ;
    }
    int mid = (l+r)>>1;
    build(rt<<1,l,mid),build(rt<<1|1,mid+1,r);
    up(rt,l,r);
}
void down(int rt,int l,int r)
{
    int mid =  (l+r)>>1;
    update(rt<<1,l,mid,col[rt],colf[rt]);
    update(rt<<1|1,mid+1,r,col[rt],colf[rt]);
    col[rt] = 1;
    colf[rt] = 0;
}
void modify(int rt,int l,int r,int x,int y,long long v)
{
    if(x<=l&&r<=y)
    {
        update(rt,l,r,v,now);
        return ;
    }
    if(col[rt]!=1) down(rt,l,r);
    int mid = (l+r)>>1;
    if(x<=mid) modify(rt<<1,l,mid,x,y,v);
    if(mid<y) modify(rt<<1|1,mid+1,r,x,y,v);
    up(rt,l,r);
}
long long query(int rt,int l,int r,int x,int y)
{
    if(x<=l&&r<=y) return Ans|=s[rt],val[rt];
    if(col[rt]!=1) down(rt,l,r);
    int mid = (l+r)>>1;
    if(x<=mid)
        if(mid<y) return 1ll*query(rt<<1,l,mid,x,y)*query(rt<<1|1,mid+1,r,x,y)%MOD;
        else return query(rt<<1,l,mid,x,y);
    return query(rt<<1|1,mid+1,r,x,y);
}
int inv[M],coef[M];
char str[15];
int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    inv[1] = 1;
    for(int i = 2;i<M;++i) inv[i] = 1ll*(MOD-MOD/i)*inv[MOD%i]%MOD;
    for(int i = 0;i<Lim;i++) coef[i] = 1ll*(P[i]-1)*inv[P[i]]%MOD;
    int n,q,x,y;
    scanf("%d%d",&n,&q);
    build(1,1,n);
    while(q--)
    {
        scanf("%s",str);
        if(str[0]=='T')
        {
            Ans = 0;
            scanf("%d%d",&x,&y);
            long long VAL = query(1,1,n,x,y);
            for(int i = 0;i<Lim;++i)
                if(Ans>>i&1) VAL = 1ll*VAL*coef[i]%MOD;
            printf("%lld\n",VAL);
        }
        else
        {
            int V,tmp;
            scanf("%d%d%d",&x,&y,&tmp);
            V=  tmp;
            now = 0;
            for(int i = 0;i<Lim&&P[i]*P[i]<=V;++i)
            {
                if(V%P[i]==0)
                {
                    now|=1<<i,V/=P[i];
                    while(V%P[i]==0) V/=P[i];
                }
            }
            if(V!=1) now|=1ll<<rev[V];
            //dbg(now);
            modify(1,1,n,x,y,tmp);
        }
    }
    //printf("\n\n%d\n",tmp);
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}