题目
刚看以为是傻逼题,找了两个小时bug我是傻逼
记住取模找质因数最后有可能有剩的,哎
代码
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<cctype>
#include<ctime>
#include<iostream>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<vector>
#include<iomanip>
#include<list>
#include<bitset>
#include<sstream>
#include<fstream>
#include<complex>
#include<algorithm>
#if __cplusplus >= 201103L
#include <unordered_map>
#include <unordered_set>
#endif
#define int long long
using namespace std;
const int INF = 0x3f3f3f3f;
const int N = 1010;
int prime[5000];
bool vis[500010];int cnt=0;
int sum=1;
void getprime(int n){
for(int i=2;i<=n;i++){
if(!vis[i]) prime[++cnt]=i;
for(int j=1;j<=cnt&&prime[j]*i<=n;j++){
vis[i*prime[j]]=1;
if(i%prime[j]==0) break;
}
}
}
int a0,a1,b0,b1;
void work(int p){
int na0=0,na1=0,nb0=0,nb1=0;
while(a0%p==0) na0++,a0/=p;
while(a1%p==0) na1++,a1/=p;
while(b0%p==0) nb0++,b0/=p;
while(b1%p==0) nb1++,b1/=p;
int ansa=0,ansb=0;
bool flag=0;
ansa=na1;
ansb=nb1;
if(na0>na1){//gcd
flag=1;
}
else if(na0<na1){
sum=0;
}
if(nb1>nb0){//lcm
if(flag&&ansb!=ansa) sum=0;
flag=1;
}
else if(nb1<nb0){
sum=0;
}
// cout<<na0<<" "<<na1<<" "<<nb0<<" "<<nb1<<endl;
// cout<<ansa<<" "<<ansb<<" "<<prime[i]<<" "<<sum<<" "<<flag<<endl;
if(na1==na0&&nb0==nb1){
//if(nb1>0) cout<<na1<<" "<<nb1<<endl;
if(ansa<=ansb) sum*=(ansb-ansa)+1;
else sum=0;
}
if(ansa>ansb) sum=0;
}
signed main(){
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int t;
cin>>t;
getprime(100000);
while(t--){
cin>>a0>>a1>>b0>>b1;
int ta=a0,tb=b1;
sum=1;
for(int i=1;i<=4000;i++){
work(prime[i]);
}
if(a0>1)
work(a0);
else
if((b1>1)&&(b1!=a0))
work(b1);
cout<<sum<<endl;
}
return 0;
}