Pagini recente » Cod sursa (job #620048) | Cod sursa (job #3241654) | Cod sursa (job #3209195) | Cod sursa (job #2965461) | Cod sursa (job #1150218)
#include<fstream>
#include<iostream>
using namespace std;
int phi[1000020];
void euler(int n)
{
int i,j;
for( i = 1 ; i<=n ; i++)
phi[i] = i-1;
for(i = 2 ; i<= n ; i++)
for( j = 2*i ; j <=n ; j+=i)
phi[j]-=phi[i];
}
int calculeaza(int n)
{
int sol = 0;
for(int i = 2 ; i<=n ; i++)
sol+=phi[i];
return sol;
}
int main()
{
ifstream in("fractii.in");
ofstream out("fractii.out");
int n,k;
in>>n;
euler(n);
k = calculeaza(n);
out<<2*k+1;
in.close();
out.close();
return 0;
}