Pagini recente » Cod sursa (job #3235901) | Borderou de evaluare (job #702921) | Cod sursa (job #1334505) | Cod sursa (job #1827471) | Cod sursa (job #806351)
Cod sursa(job #806351)
#include <fstream>
#include <iostream>
using namespace std;
long n;
long phi[1000000];
void cit()
{
ifstream f;
f.open("fractii.in");
f>>n;
f.close();
}
long sum()
{
long s=0;
for (int i=1;i<=n;i++)
s+=phi[i];
return s;
}
int main()
{
cit();
for (long i=1;i<=n;i++)
phi[i]=i-1;
for (long i=1;i<=n;i++)
for (long j=2*i;j<=n;j+=i)
phi[j]-=phi[i];
ofstream g;
g.open("fractii.out");
g<<2*sum()+1;
g.close();
return 0;
}