Cod sursa(job #138425)
Utilizator | Data | 18 februarie 2008 17:09:25 | |
---|---|---|---|
Problema | Factoriale | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include<fstream.h>
#include<math.h>
ifstream f("factoriale.in");
ofstream g("factoriale.out");
int factori[100],n,k,o,i;
void creste(int o)
{
for(int aux=2;aux<=o;aux++)
{
int l=aux,d=2;
while(l!=1)
{ while(l%d==0)
{factori[d]=k-(factori[d]%k);l/=d;}
d++;}}}
int main()
{
f>>n>>k;
for(i=1;i<=n;f>>o,creste(o),i++);
long long sol=1;
for(i=1;i<100;i++)
sol*=pow(i,factori[i]);
g<<sol;
f.close();
g.close();
return 0;
}