Cod sursa(job #810763)
| Utilizator | Data | 10 noiembrie 2012 22:46:51 | |
|---|---|---|---|
| Problema | Sum | Scor | 85 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.36 kb |
#include<fstream>
#define max 100000
using namespace std;
main(){
long long phi[max+1];
int i,j,n, t;
for (int i = 1; i <=max; ++i)
phi[i] = i;
for (int i = 2; i <= max; ++i)
if(phi[i]==i)
for (int j = i; j <= max; j += i)
{phi[j]/=i; phi[j]*=(i-1);}
ifstream f("sum.in");
ofstream g("sum.out");
f>>n;
for(i=1; i<=n; i++){
f>>t;
g<<2*phi[t]*t<<"\n";
}
}
