Cod sursa(job #1524435)
Utilizator | Data | 14 noiembrie 2015 03:51:02 | |
---|---|---|---|
Problema | Sum | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream f("sum.in");
long long x,fi[100010],i,n,j;
int main()
{
freopen("sum.out","w",stdout);
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];
}
f>>n;
for(i=1;i<=n;i++)
{
f>>x;
printf("%lld\n",2*x*fi[x]);
}
return 0;
}