Pagini recente » Cod sursa (job #2818690) | Cod sursa (job #2919388) | Cod sursa (job #1504110) | Cod sursa (job #2442286) | Cod sursa (job #2616711)
#include <fstream>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int n,phi[1000001];
long long s=0;
int main()
{
fin>>n;
for(int i=0; i<=n; i++)
phi[i]=i;
for(int i=2; i<=n; i++)
if(phi[i]==i)
{
phi[i]=i-1;
for(int j=2; j<=n/i; j++)
phi[j*i] = phi[j*i] / i * (i-1);
}
for(int i = 2; i <= n; i++)
s+=phi[i];
s=2*s+1;
fout<<s;
fin.close()
fout.close();
return 0;
}