Pagini recente » Cod sursa (job #611764) | Cod sursa (job #1437656) | Cod sursa (job #2543691) | Cod sursa (job #1316675) | Cod sursa (job #856625)
Cod sursa(job #856625)
#include<cstdio>
using namespace std;
long long phi [1000010];
int main(){
freopen("fractii.in","r",stdin);
freopen("fractii.out","w",stdout);
int N , i ,j , sol = 1 ;
scanf("%d" , &N);
for (i = 2; i <= N; i ++)
phi[i] = i;
for (i = 2; i <= N; i ++)
if (phi[i] == i)
for (j = i; j <= N; j += i)
phi[j] = (long long) phi[j] * (i - 1) / i;
for (i = 2; i <= N; i ++)
sol += (long long) phi[i] << 1;
printf ( "%d" , sol );
return 0;
}