include[HTML_REMOVED]
using namespace std;
long long n,x;
vector[HTML_REMOVED]v,vv;
long long gcd(long long a,long long b){
if(a%b==0)return b;
return gcd(b,a%b);
}
struct Node{
long long fz,fm;
};
vector[HTML_REMOVED]now;
bool cmp(Node a,Node b){
double k=a.fz1.0/a.fm,d=1.0b.fz/b.fm;
return k[HTML_REMOVED]>n;
for(int i=0;i[HTML_REMOVED]>x;
v.push_back(x);
}
sort(v.begin(),v.end());
vv.push_back(v[0]);
int cnt=0;
for(int i=1;i<v.size();i){
if(v[i]!=v[i-1]){
vv.push_back(v[i]);
}
}
v=vv;
for(int i=1;i<v.size();i){
long long k=gcd(v[i],v[i-1]);
Node q;
q.fz=v[i]/k;
q.fm=v[i-1]/k;
now.push_back(q);
}
sort(now.begin(),now.end(),cmp);
for(int i=1;i<=now[0].fz;i){
long long k=round((pow(1.0*now[0].fz,1.0/i)));
int d=round(pow(now[0].fm,1.0/i));
if(pow(k,i)==now[0].fz&&pow(d,i)==now[0].fm){
int flag=1;
for(int j=1;j<now.size();j){
int Pow=getPow(now[j].fz,k);
if(Pow==0){
flag=0;
break;
}
if(pow(d,Pow)!=now[j].fm){
flag=0;
break;
}
}
if(flag){
cout<<k<<”/”<<d<<endl;
return 0;
}
}
}
}
兄弟有时间填个邀请码hhhhhhhhh(可以得AC币,邀请码在学生认证那填) 我的邀请码是:GUDFH