Pagini recente » Cod sursa (job #2693360) | Cod sursa (job #1960700) | Cod sursa (job #2360850) | Cod sursa (job #541522) | Cod sursa (job #119999)
Cod sursa(job #119999)
#include <stdio.h>
int phi[100000],x,n,nmax,a[100000];
long long int rasp;
int phii(int N) {
int i;
for (int i = 1; i <= N; ++i)
phi[i] = i-1;
for (int i = 2; i <= N; ++i)
for (int j = 2*i; j <= N; j += i)
phi[j] -= phi[i];
}
int main() {
int i;
freopen("sum.in","r",stdin);
freopen("sum.out","w",stdout);
scanf("%d",&n);
for (i=1 ; i <= n;i++) {
scanf("%d",&a[i]);
if (a[i]>nmax)
nmax = a[i];
}
phii(nmax);
for (i=1; i<=n; i++)
if (a[i]) {
rasp = 2*phi[a[i]]*a[i];
printf("%lld\n",rasp);
}
}