Pagini recente » Cod sursa (job #318583) | Cod sursa (job #2139209) | Cod sursa (job #580398) | Cod sursa (job #1064013) | Cod sursa (job #1977407)
#include <iostream>
#include <fstream>
using namespace std;
ifstream si("fractii.in");
ofstream so("fractii.out");
int phi[1000005];
int main()
{
int n;
si>>n;
for(int i=2;i<=n;++i)
phi[i]=i;
phi[2]=1;
for(int i=4;i<=n;i+=2)
phi[i]/=2;
for(int i=3;i<=n;i+=2)
{
if(phi[i]==i)
{
--phi[i];
for(int j=i*2;j<=n;j+=i)
{
phi[j]=phi[j]/i*(i-1);
}
}
}
long long sum=0;
for(int j=2;j<=n;++j)
{
sum+=phi[j];
//cout<<phi[j]<<' ';
}
//cout<<'\n';
so<<sum*2+1;
return 0;
}