Pagini recente » Cod sursa (job #180423) | Cod sursa (job #2689615) | Cod sursa (job #1355334) | Cod sursa (job #27685) | Cod sursa (job #338895)
Cod sursa(job #338895)
#include <fstream>
using namespace std;
ifstream f1 ("factoriale.in");
ofstream f2 ("factoriale.out");
int main()
{
int n,k,t,v[101]={0},i,j,l,rez,z;
f1>>n>>k;
for (i=1; i<=n; i++)
{
f1>>z;
while (z>=2)
{
t=z;
for (j=2; j*j<=t; j++) while (t%j==0) {t/=j; v[j]++;}
if (t!=1) v[t]++;
z--;
}
}
rez=1;
for (i=2; i<=100; i++)
{
if (v[i]!=0 && v[i]%k!=0) {l=k-v[i]%k; for (j=1; j<=l; j++) rez*=i;}
}
f2<<rez;
return 0;
}