Cod sursa(job #717777)
Utilizator | Data | 20 martie 2012 10:57:04 | |
---|---|---|---|
Problema | Factoriale | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#include<fstream>
using namespace std;
ifstream f("factoriale.in");
ofstream g("factoriale.out");
int s,x,p,i,n,j,k,d[100],v[50]={0,2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97};
long long nr=1;
int main()
{f>>n>>k;
for(i=1;i<=n;++i)
{f>>x;
for(j=1;j<=x;++j)
{s=0;
p=v[j];
while(p<=x)
{s=s+x/p;
p=p*v[j];
}
d[v[j]]=d[v[j]]+s;
}
}
for(i=1;i<=100;++i)
if(d[i]!=0&&d[i]%k!=0)
for(j=1;j<=k-d[i]%k;++j)
nr*=i;
g<<nr<<'\n';
f.close();
g.close();
return 0;
}