Pagini recente » Cod sursa (job #1746578) | Cod sursa (job #2469307) | Cod sursa (job #2186675) | Cod sursa (job #2237118) | Cod sursa (job #744383)
Cod sursa(job #744383)
#include <cassert>
#include <cstdio>
typedef long long int64;
const int nmax=1000000;
int v[nmax+1];
int main(){
int n;
int64 sol;
assert(freopen("fractii.in", "r", stdin));
assert(scanf(" %d ", &n));
fclose(stdin);
sol=1;
for (int i=1; 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]=v[j]/i*(i-1);
}
}
sol+=2*v[i];
}
assert(freopen("fractii.out", "w", stdout));
printf("%lld\n", sol);
fclose(stdout);
return 0;
}