Cod sursa(job #532018)
Utilizator | popa camil popacamil | Data | 10 februarie 2011 18:15:09 |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.37 kb |
#include<cstdio>
using namespace std;
long long int s=1,n,i,j,phi[1000001];
int main(){
freopen("fractii.in","r",stdin);
freopen("fractii.out","w",stdout);
scanf("%lld",&n);
for(i=1;i<=n;++i){
phi[i]=i-1;
}
for(i=2;i<=n;++i){
for(j=2*i;j<=n;j+=i){
phi[j]-=phi[i];
}
}
for(i=n;i>0;--i){
s+=2*phi[i];
}
printf("%lld\n",s);
return 0;
}