Pagini recente » Cod sursa (job #978079) | Cod sursa (job #140140) | Clasament simulare_oji_13_03_2023 | Profil ilincaS | Cod sursa (job #697984)
Cod sursa(job #697984)
#include <cstdio>
#include <bitset>
using namespace std;
bitset <105> a;
int c[105],puteri[105];
int main () {
int n,i,k,j;
long long af=1;
freopen("factoriale.in","r",stdin);
freopen("factoriale.out","w",stdout);
scanf("%d %d",&n,&k);
for(i=1;i<=n;++i)scanf("%d",&c[i]);
for(i=2;i*i<=100;++i){
if (a[i]==0)for(j=i+i;j<=100;j+=i)a[j]=1;
}
a[1]=1;
//for(i=1;i<=100;++i)if(a[i]==0)printf("%d ",i);
for(i=1;i<=n;++i){
for(j=1;j<=100&&c[i]>=j;++j){
if(a[j]==0)++puteri[j];
}
}
for(i=1;i<=100;++i){
if(puteri[i]%k!=0){
af*=(puteri[i]%k)*i;
}
}
printf("%lld",af);
return 0;
}