Pagini recente » Cod sursa (job #2222463) | Cod sursa (job #522584) | Cod sursa (job #2687697) | Cod sursa (job #1365799) | Cod sursa (job #1205005)
#include<fstream>
using namespace std;
ifstream cin("fractii.in");
ofstream cout("fractii.out");
int N,phi[1000001],s;
int main(){
cin>>N;
if(N==1){
cout<<"0";
return 0;
}
//daca i e prim phi[i]=phi=i-1
for (int i = 1; i <= N; ++i)
phi[i] = i-1;
for (int i = 2; i <= N; ++i)
for (int j = 2*i; j <= N; j += i)
phi[j] -= phi[i];
for(int i=1;i<=N;i++)
s+=phi[i];
s=s*2+1;
cout<<s;
cin.close();
cout.close();
return 0;
}