Cod sursa(job #759700)
Utilizator | Data | 18 iunie 2012 23:26:12 | |
---|---|---|---|
Problema | Sum | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include<fstream>
#define MAX 100005
using namespace std;
long long n,i,x;
int v[MAX];
void phi()
{
int i,j;
for(i=1;i<=MAX;i++)
v[i]=i-1;
for(i=2;i<=MAX;i++)
for(j=i+i;j<=MAX;j+=i)
v[j]-=v[i];
}
int main()
{
ifstream f("sum.in");
ofstream g("sum.out");
f>>n;
phi();
for(i=1;i<=n;i++)
{
f>>x;
g<<(long long)2*v[x]*x<<"\n";
}
}