Pagini recente » Cod sursa (job #2978980) | Cod sursa (job #1636907) | Cod sursa (job #2406634) | Cod sursa (job #361960) | Cod sursa (job #2065531)
#include<iostream>
#include<fstream>
#include<cmath>
#include<vector>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
long long n, i, j, num, nr;
int main(){
while ( fin>>n ){
nr=0;
vector<int> phi(n+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[j] - phi[i];
for( i=1; i<=n; i++)
nr+=phi[i];
fout<<2*nr+1<<'\n';
}
return 0;
}