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