Pagini recente » Cod sursa (job #1015855) | Cod sursa (job #1703660) | Cod sursa (job #165216) | Cod sursa (job #599535) | Cod sursa (job #2373159)
#include <iostream>
#include <fstream>
#define NMAX 1000005
#define ll long long
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
ll n;
int v[NMAX];
int fractii(int n)
{
ll cnt = 0;
for(int i = 2; i <= n; i++)
v[i] = i-1;
for(int i = 2; i <= n/2; i++)
for(int j = 2*i; j <= n; j+=i)
v[j] -= v[i];
for(int i = 2; i <= n; i++)
cnt+=v[i];
return (2*cnt+1);
}
int main()
{
fin >> n;
fout << fractii(n);
return 0;
}