Cod sursa(job #1202649)
Utilizator | Data | 28 iunie 2014 19:57:23 | |
---|---|---|---|
Problema | Sum | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include<fstream>
using namespace std;
long totient[100001];
int main()
{
ifstream f("sum.in");
ofstream g("sum.out");
long i,j,n,x,rezultat;
for(i=1;i<=100001;++i) totient[i]=i;
for(i=2;i<=100001;++i)
if(totient[i]==i)
{
for(j=i;j<=100001;j=j+i)
{
totient[j]=totient[j]/i;
totient[j]=totient[j]*(i-1);
}
}
f>>n;
for(i=1;i<=n;++i)
{
f>>x;
rezultat=2*x*totient[x];
g<<rezultat<<"\n";
}
f.close();
g.close();
return 0;
}