Pagini recente » Borderou de evaluare (job #409579) | Cod sursa (job #447772) | Cod sursa (job #447763)
Cod sursa(job #447763)
#include <cstdio>
#include <iostream>
using namespace std;
long long m,n=100000,d=-1,phi[1000001];
inline void euler() {
int rezultat=0,i,j;
for (i = 1; i <= n; ++i)
phi[i] = i-1;
for (i = 2; i <= n; ++i) {
for (j = 2*i; j <= n; j += i)
phi[j] -= phi[i];
}
}
int main()
{
int i,x;
FILE *f=fopen("sum.in","r");
FILE *g=fopen("sum.out","w");
fscanf(f,"%lld",&m);
euler();
for(i=0; i<m; i++) {
fscanf(f,"%d",&x);
fprintf(g,"%lld\n",2*phi[x]*x);
}
fclose(f);
fclose(g);
return 0;
}