Pagini recente » Cod sursa (job #2525876) | Cod sursa (job #222130) | Cod sursa (job #1246385) | Cod sursa (job #1292664) | Cod sursa (job #2194614)
#include <fstream>
using namespace std;
const int MAX = 1e6+1;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
void fractii();
int n,v[MAX];
int main()
{
fin >> n;
fractii();
long long l=-1;
for(int i=1; i<=n; i++)
l=l+2*v[i];
fout <<l;
return 0;
}
void fractii()
{
int i;
for (int i=1; i <= n; i++)
{
v[i]=i;
}
for(i=2; i<=n; i++)
{
if(v[i]==i)
{
for(int j=i; j<=n; j+=i)
v[j]=v[j]/i*(i-1);
}
}
}