Cod sursa(job #1356105)

Utilizator alexandra_udristoiuUdristoiu Alexandra Maria alexandra_udristoiu Data 23 februarie 2015 10:41:32
Problema Factoriale Scor 100
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.09 kb
#include<fstream>
using namespace std;
int n, k, i, j, nrp, x, ii;
int v[101], c[101], p[50], f[101], sol[10000];
ifstream fin("factoriale.in");
ofstream fout("factoriale.out");
void mult(int x){
	int t = 0;
	for(int i = 1; i <= sol[0]; i++){
		sol[i] = sol[i] * x + t;
		t = sol[i] / 10;
		sol[i] %= 10;
	}
	while(t != 0){
		sol[++sol[0]] = t % 10;
		t /= 10;
	}
}
int main(){
	fin>> n >> k;
	for(i = 1; i <= n; i++){
		fin>> v[i];
	}
	for(i = 2; i <= 100; i++){
		if(c[i] == 0){
			for(j = i + i; j <= 100; j+= i){
				c[j] = 1;
			}
		}
	}
	for(i = 2; i <= 100; i++){
		if(c[i] == 0){
			p[++nrp] = i;
		}
	}
	for(i = 1; i <= n; i++){
		for(ii = 2; ii <= v[i]; ii++){
			x = ii;
			for(j = 1; j <= nrp && p[j] * p[j] <= ii; j++){
				while(x % p[j] == 0){
					x /= p[j];
					f[p[j]]++;
				}
			}
			if(x != 1){
				f[x]++;
			}
		}
	}
	sol[0] = sol[1] = 1;
	for(i = 2; i <= 100; i++){
		if(f[i] != 0 && f[i] % k != 0){
			for(j = 1; j <= k - f[i] % k; j++){
				mult(i);
			}
		}
	}
	for(i = sol[0]; i >= 1; i--){
		fout<< sol[i];
	}
	return 0;
}