Cod sursa(job #529828)
| Utilizator | Data | 6 februarie 2011 10:23:16 | |
|---|---|---|---|
| Problema | Sum | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.38 kb |
#include<fstream.h>
#include<stdio.h>
#define ll long long
#define max 100003
ifstream f("sum.in");
ofstream g("sum.out");
int phi[100009],n;
int main(){
int i,j,x;
f>>n;
for (i = 1; i <= max; ++i)
phi[i] = i-1;
for (i = 2; i <= max; ++i)
for (j= i+i; j <= max; j += i)
phi[j] -= phi[i];
for(i=1;i<=n;i++){
f>>x;
g<<2*((ll)x*phi[x])<<"\n";
}
return 0;
}