Pagini recente » Cod sursa (job #1244429) | Cod sursa (job #1013882) | Cod sursa (job #2513883) | Cod sursa (job #1746460) | Cod sursa (job #270057)
Cod sursa(job #270057)
#include<stdio.h>
#include<math.h>
#define N 1000003
int n;
int v[N]={0};
void phi(){
for(int i=2; i<n;++i)
v[i]=i;
for(int i=2; i<n;++i){
if(v[i]==i){
for(int j=i; j<n ; j+=i){
v[j]/=i;
v[j]*=i-1;
}
}
}
}
int main(){
freopen("fractii.in", "r", stdin);
freopen("fractii.out", "w", stdout);
long long s=0;
scanf("%d", &n);
phi();
v[1]=1;
for(int i=1; i<=n;++i){
s+=2;
if(n%i!=0&&(n-1)%i!=0)
s+=v[i];
}
printf("%lld", s+s-5);
return 0;
}