CDQZ Day7

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
//#include<vector>
//#include<stack>
#include<map>
#define R(a,b,c) for(register int (a)=(b);(a)<=(c);++(a))
#define nR(a,b,c) for(register int (a)=(b);(a)>=(c);--(a))
#define Ii inline int
#define Iv inline void
#define Il inline long long
#define Ib inline bool
#define INF 0x7ffffff
#define re register
#define ll long long
#define Max(a,b) ((a)>(b)?(a):(b))
#define Min(a,b) ((a)<(b)?(a):(b))
#define Cmin(a,b) ((a)=(a)<(b)?(a):(b))
#define Cmax(a,b) ((a)=(a)>(b)?(a):(b))
#define Fill(a,b) memset((a),(b),sizeof((a)))
#define D_e_Line printf("\n-------------\n");
#define D_e(x) printf("\n______%d_______\n",x)
#define Pause() system("pause")
using namespace std;
const int N=;
Il read(){
    ll s=,f=;char c;
    for(c=getchar();c>''||c<'';c=getchar())if(c=='-')f=-;
    while(c>=''&&c<='')s=s*+(c^''),c=getchar();
    return s*f;
}
template<class Tp>Iv print(Tp x){
    if(x<)putchar('-'),x=-x;
    if(x>)print(x/);
    putchar(x%^'');
}
ll x,y,d,a,b,c;
Iv Exgcd(ll a,ll b,ll &x,ll &y,ll &d){
    if(!b)
        x=,y=,d=a;
    else
        Exgcd(b,a%b,y,x,d),y-=x*a/b;
}
#define ON_JUD
int main(){
#ifdef ON_JUD
    freopen("exgcd.in","r",stdin),freopen("exgcd.out","w",stdout);
#endif
    int T=read();
    while(T--){
        a=read(),b=read(),c=read(),
        Exgcd(a,b,x,y,d);
        b/=d;
        if(c%d!=){
            printf("no\n");continue;
        }
        int ans=(x*c/d%b+b)%b;
        if(ans==)ans+=b;
        printf("%d\n",ans);
    }
    return ;
}
/*
9
7 9 6
1 2 1
2 6 5
2 3 2
4 5 4
2 3 2
1 5 2
4 5 3
2 4 2

6
1
no
1
1
1
2
2
1
*/

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
//#include<vector>
#include<stack>
//#include<map>
#define R(a,b,c) for(register int (a)=(b);(a)<=(c);++(a))
#define nR(a,b,c) for(register int (a)=(b);(a)>=(c);--(a))
#define Ii inline int
#define Iv inline void
#define Il inline long long
#define Ib inline bool
#define INF 0x7ffffff
#define re register
#define ll long long
#define Max(a,b) ((a)>(b)?(a):(b))
#define Min(a,b) ((a)<(b)?(a):(b))
#define Cmin(a,b) ((a)=(a)<(b)?(a):(b))
#define Cmax(a,b) ((a)=(a)>(b)?(a):(b))
#define Fill(a,b) memset((a),(b),sizeof((a)))
#define D_e_Line printf("\n-------------\n");
#define D_e(x) printf("\n______%d_______\n",x)
#define Pause system("pause")
using namespace std;
const int N=;
Ii read(){
    int s=,f=;char c;
    for(c=getchar();c>''||c<'';c=getchar())if(c=='-')f=-;
    while(c>=''&&c<='')s=s*+(c^''),c=getchar();
    return s*f;
}
template<class Tp>Iv print(Tp x){
    if(x<)putchar('-'),x=-x;
    if(x>)print(x/);
    putchar(x%^'');
}
int n,m,a[];ll ans;
Ii gcd(int a,int b){
    while(b^=a^=b^=a%=b);return a;
    //return !b?a:gcd(b,a%b);
}
Iv dfs(int x,int cnt,int tot){
    if(cnt&)ans+=m/tot;
    else ans-=m/tot;
    R(i,x+,n)
        dfs(i,cnt+,tot*a[i]/gcd(tot,a[i]));
}
#define ON_JUD
int main(){
#ifdef ON_JUD
    freopen("not.in","r",stdin),freopen("not.out","w",stdout);
#endif
    n=read(),m=read();
    R(i,,n)
        a[i]=read();
    R(i,,n)
        dfs(i,,a[i]);
    print(m-ans);
    return ;
}
/*
3 20
2 3 5
*/

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
//#include<vector>
//#include<stack>
#include<map>
#define R(a,b,c) for(register int (a)=(b);(a)<=(c);++(a))
#define nR(a,b,c) for(register int (a)=(b);(a)>=(c);--(a))
#define Ii inline int
#define Iv inline void
#define Il inline long long
#define Ib inline bool
#define INF 0x7ffffff
#define re register
#define ll long long
#define Max(a,b) ((a)>(b)?(a):(b))
#define Min(a,b) ((a)<(b)?(a):(b))
#define Cmin(a,b) ((a)=(a)<(b)?(a):(b))
#define Cmax(a,b) ((a)=(a)>(b)?(a):(b))
#define Fill(a,b) memset((a),(b),sizeof((a)))
#define D_e_Line printf("\n-------------\n");
#define D_e(x) printf("\n______%d_______\n",x)
#define Pause system("pause")
using namespace std;
const int N=;
Il read(){
    ll s=,f=;char c;
    for(c=getchar();c>''||c<'';c=getchar())if(c=='-')f=-;
    while(c>=''&&c<='')s=s*+(c^''),c=getchar();
    return s*f;
}
template<class Tp>Iv print(Tp x){
    if(x<)putchar('-'),x=-x;
    if(x>)print(x/);
    putchar(x%^'');
}
Il Pow(ll a,ll b,ll mod){
    a%=mod,b%=mod;
    ll s=;
    while(b){
        if(b&)s=s*a%mod;
        a=a*a%mod,b>>=;
    }
    return s;
}
Il G(ll x,ll mod){
    ll sum=;
    R(i,,INF)
        if(x%i==){
            sum+=i,
            x/=i;
            if(x==)
                return sum;
        }
}
Il F(ll x,ll mod){
    return Pow(,Pow(,G(x,mod),mod),mod)%mod;
}
#define ON_JUD
int main(){
#ifdef ON_JUD
    freopen("func.in","r",stdin),freopen("func.out","w",stdout);
#endif
    ll l=read(),r=read(),mod=read();
    if(l==r){
        printf("0\n");return ;
    }
    ll ans=F(l,mod);
    R(i,l+,r)
        ans^=F(i,mod);
    print(ans);
    return ;
}