Cod sursa(job #525238)
Utilizator | Data | 24 ianuarie 2011 17:44:25 | |
---|---|---|---|
Problema | Sum | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.34 kb |
#include <fstream.h>
ifstream f("sum.in");
ofstream g("sum.out");
long max=100005;
int main(){
long phi[100009];
long i,j,x,n,z;
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;
z=phi[x];
g<<2*z*x<<endl;
}
return 0;
}