Cod sursa(job #660065)
Utilizator | heghedus razvan raazvvann | Data | 11 ianuarie 2012 17:54:11 |
---|---|---|---|
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 phhi()
{
for (int i=1;i<=X;i++) phi[i]=i;
for (int i=2;i<=X;i++)
if (phi[i]==i)
for (int j=i;j<=X;j+=i) {phi[j] /=i; phi[j] *= (i-1);}
}
int main()
{
phhi();
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();
}