Cod sursa(job #823130)
Utilizator | Data | 24 noiembrie 2012 17:39:38 | |
---|---|---|---|
Problema | Fractii | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.44 kb |
#include<stdio.h>
int c[1000001];
void ciur(){
int i,j;
c[0]=c[1]=0;
for(i=2;i<=100001;i++){
c[i]=i;
}
for(i=2;i<=100001;i++){
if(c[i]==i){
for(j=i;j<=100001;j+=i){
c[j]=c[j]/i*(i-1);
}
}
}
}
int main(){
freopen("fractii.in","r",stdin);
freopen("fractii.out","w",stdout);
int n,i;
long long s=0;
ciur();
scanf("%d",&n);
for(i=1;i<=n;i++){
s+=c[i]*2;
}
++s;
printf("%lld\n",s);
return 0;
}