Pagini recente » Cod sursa (job #2649217) | Cod sursa (job #602671) | Cod sursa (job #2086965) | Cod sursa (job #657314) | Cod sursa (job #2267995)
#include <cstdio>
using namespace std;
int v[1000005];
int ciur(int n)
{
int i,j;
for(i=2;i<=n;i++)
v[i]=i;
for(i=2;i<=n;i++)
{
if(v[i]==i)
{
for(j=i;j<=n;j=j+i)
v[j]=v[j]/i*(i-1);
}
}
}
int main()
{
freopen("fractii.in","r",stdin);
freopen("fractii.out","w",stdout);
int n,i,s=1;
scanf("%d",&n);
ciur(n);
for(i=1;i<=n;i++)
s=s+2*v[i];
printf("%d",s);
return 0;
}