Pagini recente » Cod sursa (job #3030639) | Cod sursa (job #3137506) | Cod sursa (job #1878600) | Cod sursa (job #2124117) | Cod sursa (job #2216049)
#include <stdio.h>
int e[100001];
void euler(int n)
{
for(int i=2; i<=n; i++)
e[i]=i;
for(int i=2; i<=n; i++)
if(e[i]==i)
for(int j=i;j<=n;j+=i)
{
e[j]=e[j]/i*(i-1);
}
}
int main()
{
int n;
FILE *f=fopen("sum.in","r");
FILE *g=fopen("sum.out","w");
fscanf(f,"%d",&n);
euler(100001);
for(int i=1;i<=n;i++)
{
int nr;
fscanf(f,"%d",&nr);
fprintf(g,"%d\n",nr*2*e[nr]);
}
return 0;
}