Cod sursa(job #958446)
Utilizator | Data | 7 iunie 2013 17:13:50 | |
---|---|---|---|
Problema | Sum | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.35 kb |
#include<fstream>
#define N 100001
using namespace std;
int i,n,x,j,phi[100005];
ifstream f("sum.in");
ofstream g("sum.out");
int main()
{ f>>n;
for (i = 1; i <= N; i++)
phi[i] = i-1;
for (i = 2; i <= N; i++)
for (int j = 2*i; j <= N; j += i)
phi[j] -= phi[i];
while(n--)
{f>>x;
g<<1LL*x*2*phi[x]<<'\n';
}
return 0;
}