Pagini recente » Cod sursa (job #234598) | Cod sursa (job #2543068) | Cod sursa (job #2675779) | Cod sursa (job #159677) | Cod sursa (job #2740526)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
typedef long long ll;
ll n,phi[1000005];
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
phi[i]=i;
for(int i=2;i<=n;i++)
if(phi[i]==i)
{
for(int j=i;j<=n;j+=i)
{
phi[j]/=i;
phi[j]*=(i-1);
}
}
ll ans=0;
for(int i=1;i<=n;i++)
ans+=phi[i];
ans*=2;
ans--;
fout<<ans;
return 0;
}