Cod sursa(job #810769)
Utilizator | Data | 10 noiembrie 2012 23:13:46 | |
---|---|---|---|
Problema | Sum | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.34 kb |
#include<fstream>
#define max 100001
using namespace std;
main(){
int phi[max],i,j,n, t;
for (int i = 1; i <= max; ++i)
phi[i] = i-1;
for (int i = 2; i <= max; ++i)
for (int 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<<(long long)2*phi[t]*t<<"\n";
}
}