Pagini recente » Cod sursa (job #2014638) | Cod sursa (job #3290714) | Cod sursa (job #1994417) | Cod sursa (job #1174530) | Cod sursa (job #217439)
Cod sursa(job #217439)
#include <iostream.h>
#include <fstream.h>
#include <math.h>
#include <values.h>
int v[100];
int factorial(int a)
{
int i;
int f=1;
for(i=1;i<=a;i++)
f=f*i;
return f;
}
int produs(int n)
{
int p=1;
int i;
for(i=1;i<=n;i++)
p=p*factorial(v[i]);
return p;
}
int putere(int n,int k)
{
int i,p=1;
for(i=1;i<=k;i++)
p=p*n;
return p;
}
int find(int n,int k)
{
int a,nr;
int pr=produs(n),pu;
for(a=1;a<=32000;a++)
{
pu=putere(a,k);
if(pu%pr==0)
{
nr=pu/pr;
break;
}
}
return nr;
}
int main()
{
int t,i,k;
int n;
ifstream f("factorial.in");
ofstream g("factorial.out");
f>>n>>k;
for(i=1;i<=n;i++)
f>>v[i];
g<<find(n,k)<<"\n";
f.close();
g.close();
}