Cod sursa(job #1524434)
Utilizator | Data | 14 noiembrie 2015 03:49:04 | |
---|---|---|---|
Problema | Sum | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ofstream g("sum.out");
long long x,fi[100010],i,n,j;
int main()
{
freopen("sum.in","r",stdin);
for(i=1;i<=100000;i++)
fi[i]=i-1;
for(i=2;i<=100000;i++)
{
for(j=i*2;j<=100000;j+=i)
fi[j]-=fi[i];
}
scanf("%lld",&n);
for(i=1;i<=n;i++)
{
scanf("%lld",&x);
g<<2*x*fi[x]<<'\n';
}
return 0;
}