Cod sursa(job #660062)
Utilizator | heghedus razvan raazvvann | Data | 11 ianuarie 2012 17:48:34 |
---|---|---|---|
Problema | Sum | Scor | 55 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
// sum
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("sum.in");
ofstream g("sum.out");
#define X 100001
int phi[X];
void p()
{
for (int i = 1; i <= X; i++)
phi[i] = i-1;
for (int i = 2; i <= X; i++)
for (int j = 2*i; j <=X; j += i)
phi[j] -= phi[i];
}
int main()
{
p();
long int n,t,i;
f>>t;
for(i=1;i<=t;i++)
{
f>>n;
g<<n*phi[n]*2<<endl;
}
f.close();
g.close();
return 0;
}