Pagini recente » Cod sursa (job #2019103) | carantinanuneopresteagmbiruieste | Cod sursa (job #458966) | Cod sursa (job #1844406) | Cod sursa (job #2742544)
#include <stdio.h>
#define MAX_N 1000000
int phi[MAX_N + 1];
int main() {
FILE *fin, *fout;
int n, i, j;
long long fractii;
fin = fopen( "fractii.in", "r" );
fscanf( fin, "%d", &n );
fclose( fin );
fractii = 0;
for ( i = 2; i <= n; i++ ) {
phi[i] += i - 1;
for ( j = 2 * i; j <= n; j += i )
phi[j] -= phi[i];
fractii += phi[i];
}
fout = fopen( "fractii.out", "w" );
fprintf( fout, "%lld", fractii * 2 + 1 );
fclose( fout );
return 0;
}