Pagini recente » Cod sursa (job #446547) | Cod sursa (job #1512168) | Cod sursa (job #1856276) | Cod sursa (job #1083804) | Cod sursa (job #586324)
Cod sursa(job #586324)
#include <iostream>
#include <cstdio>
using namespace std;
int n;
const int NMAX = 1000004;
int v[NMAX];
void read_problem(){
freopen("fractii.in","r",stdin);
freopen("fractii.out","w",stdout);
scanf("%d",&n);
}
void eratosthene(){
for(int i=1; i<=n; ++i)
v[i]=i-1;
for (int i=2; i<=n; ++i){
for (int j=i*2; j<=n; j+=i)
v[j]-=v[i];
}
}
void solution(){
unsigned long long sol=0;
for (int i=1; i<=n; ++i)
sol+=v[i];
cout<<2*sol+1;
}
int main()
{
read_problem();
eratosthene();
solution();
return 0;
}