Cod sursa(job #1207259)
| Utilizator | Data | 12 iulie 2014 17:17:40 | |
|---|---|---|---|
| Problema | Sum | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.56 kb |
#include <stdio.h>
#define MAXN 100005
int phi[MAXN];
void vvvvvv(int n){
int i, j;
for(i = 0; i <= n; i++) phi[i] = i;
for(i = 2; i <= n; i++){
if(phi[i] == i){
for(j = i; j <= n; j += i){
phi[j] /= i; phi[j] *= i - 1;
}
}
}
return ;
}
int main(){
FILE *in = fopen("sum.in", "r");
FILE *out = fopen("sum.out", "w");
int n;
fscanf(in, "%d", &n);
vvvvvv(MAXN);
int i, x;
for(i = 0; i < n; i++){
fscanf(in, "%d", &x);
fprintf(out, "%lld\n", 2LL * phi[x] * x);
}
fclose(in);
fclose(out);
return 0;
}
