Pagini recente » Cod sursa (job #3173690) | Cod sursa (job #1895985) | Cod sursa (job #1352012) | Cod sursa (job #2776362) | Cod sursa (job #356900)
Cod sursa(job #356900)
Utilizator |
Marian S eu93 |
Data |
17 octombrie 2009 13:38:34 |
Problema |
GFact |
Scor |
45 |
Compilator |
cpp |
Status |
done |
Runda |
CNRV #2 |
Marime |
0.63 kb |
#include <fstream.h>
#include <iostream.h>
int v[45000],w[45000];
int main()
{ int p,k=0,d=2,i,ok,ok2,y;
long x;
ifstream f ("gfact.in");
ofstream g ("gfact.out");
f>>x>>p;
for (d=2;d*d<=x;d++){
k=0;
while (x%d==0) { k++; x/=d;}
if (k>0) v[d]=k*p;
}
if (x>1) v[x]=1*p;
y=2; d=2; ok=0;
while (ok==0) {x=y;
for (d=2;d*d<=x;d++){
k=0;
while (x%d==0) { k++; x/=d;}
if (k>0) w[d]+=k;
}
if (x>1) w[x]+=1;
ok2=1; i=2;
if (v[i]>0 && v[i]>w[i]) ok2=0;
else {
for (i=3;i<=44999;i+=2)
if (v[i]>0 && v[i]>w[i]) ok2=0;
}
if (ok2==1) ok=1;
else y++;
}
g<<y;
f.close();
g.close();
return 0;
}