Pagini recente » Clasament oni_clasa10_2022-2016 | Cod sursa (job #2483094) | Cod sursa (job #3184772) | Cod sursa (job #2294799) | Cod sursa (job #521266)
Cod sursa(job #521266)
#include<stdio.h>
FILE*f=fopen("sum.in","r");
FILE*g=fopen("sum.out","w");
int T,q,max,Query[100005],i,j,pr[100005];
long long R;
int main () {
fscanf(f,"%d",&T);
for ( i = 1 ; i <= T ; ++i ){
fscanf(f,"%d",&Query[++q]);
if ( Query[q] > max )
max = Query[q];
}
for ( i = 2 ; i <= max ; ++i ) pr[i] = i - 1;
for ( i = 2 ; i <= max ; ++i ){
for ( j = i + i ; j <= max ; j += i ){
pr[j] -= pr[i];
}
}
for ( i = 1 ; i <= T ; ++i ){
R = 1LL * pr[Query[i]] * 2 * Query[i] ;
fprintf(g,"%lld\n",R );
}
fclose(f);
fclose(g);
return 0;
}