Pagini recente » Cod sursa (job #1674087) | Cod sursa (job #1130688) | Cod sursa (job #1565628) | Cod sursa (job #2372302) | Cod sursa (job #120531)
Cod sursa(job #120531)
#include <fstream.h>
long long u[100001],tot[100001];
void totient()
{
long i,j;
for (i=2;i<=100001;i++)
tot[i]=i;
for (i=2;i<=100001;i++)
{
if (u[i]==0)
{
j=2;
while(i*j<=100001)
{
u[i*j]=1;
tot[i*j]=tot[i*j]-(tot[i*j]/i);
j++;
} }
}
}
int main()
{ long long n,sol,x,i;
totient();
ifstream f1("sum.in");
ofstream f2("sum.out");
f1>>n;
for (i=1;i<=n;i++)
{
f1>>x;
sol=2*x*tot[x];
f2<<sol<<"\n";
}
return 0;
}