Pagini recente » Cod sursa (job #2731068) | Cod sursa (job #2246463) | Cod sursa (job #1029977) | Cod sursa (job #2334280) | Cod sursa (job #66719)
Cod sursa(job #66719)
#include<fstream.h>
long a[10000],b[10000],P,Q;
void factor(int P,long a[10000]){
while (P%2==0){
a[2]++;
P/=2;}
for (long d=3;d<=P/d;d+=2)
while (P/d==0){
a[d]++;
P/d;}
}
int comparare(int N){
for (long i=0;i<=N;i++)
if (a[i]!=0&&b[i]%a[i]!=0)
return 0;
return 1;
}
void imn(long P){
for (long i=0;i<=P;i++)
a[i]*=Q;
}
int main(){
ifstream fin("gfact.in");
fin>>P>>Q;
fin.close();
factor(P,a);
imn(P);
ofstream fout("gfact.out");
for (int i=2;i<31000;i++){
factor(i,b);
if (comparare(P)==1) {
fout<<i;
break; } }
fout<<"\n";
fout.close();
return 0;
}