Pagini recente » Cod sursa (job #2739903) | Cod sursa (job #1403507) | Cod sursa (job #2809010) | Cod sursa (job #254623) | Cod sursa (job #2724243)
#include <fstream>
#define fq 1000002
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int n,i,j;
int phi[fq];
long long rez;
int main()
{
fin>>n;
for(i=1; i<=n; i++)
phi[i]=i;
for(i=2; i<=n; i++)
if(phi[i]==i)
for(j=i; j<=n; j+=i)
phi[j]/=i, phi[j]*=(i-1);
for(i=1; i<=n; i++)
rez+=phi[i];
fout<<2*rez-1<<'\n';
return 0;
}