Pagini recente » Cod sursa (job #1119525) | Cod sursa (job #185170) | Cod sursa (job #2251176) | Cod sursa (job #827755) | Cod sursa (job #2101638)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int v[1000002],n;
long long sum;
bool neprim[1000002];
int main()
{
fin>>n;
for (int i=2;i<=n;++i)
v[i]=i;
for(int i=2;i<=n;++i)
{
if(!neprim[i])
for(int j=i;j<=n; j+=i)
{
neprim[j]=true;
v[j]-= v[j]/i;
}
sum+=v[i];
}
fout<<2*sum+1<<'\n';
return 0;
}