Pagini recente » Cod sursa (job #2098215) | Cod sursa (job #1089547) | Cod sursa (job #2292018) | Cod sursa (job #756402) | Cod sursa (job #1334639)
#include<cstdio>
using namespace std;
int ciur[200041];
void genciur()
{
int i, j;
for(i=2; i<=200020; ++i)
ciur[i]=i;
for(i=2; i<=200020;++i)
{
if(ciur[i]==i)
{
for(j=i*2; j<=200020; j+=i)
ciur[j]=ciur[j]/i*(i-1);
ciur[i]=i-1;
}
}
}
int main()
{
FILE *in=fopen("sum.in", "r"),
*out=fopen("sum.out", "w");
int n, x, i;
genciur();
fscanf(in, "%d", &n);
for(i=1; i<=n; ++i)
{
fscanf(in, "%d",&x);
fprintf(out, "%lld\n",(long long)2*x*ciur[x]);
}
fclose(in);
fclose(out);
return 0;
}