Pagini recente » Cod sursa (job #1756584) | Cod sursa (job #2631363) | Cod sursa (job #1349953) | Cod sursa (job #1937656) | Cod sursa (job #2781189)
#include <fstream>
#define ll unsigned long long
using namespace std;
ifstream cin("fractii.in");
ofstream cout("fractii.out");
const int N = 1e6;
int phi[N + 1];
int n;
void ciur(){
for(int i = 2; i <= N; i++)
phi[i] = i;
for(int i = 2; i <= N; i++){
if(phi[i] == i){
phi[i]++;
for(int j = i; j <= N; j += i)
phi[j] = phi[j] / i * (i - 1);
}
}
}
int main(){
ciur();
cin >> n;
ll s = 1;
if(n == 1)
cout << n;
else for(int i = 2; i <= n; i++)
s += (2LL * phi[i]);
cout << s;
/*
n = 4
i = 1 : 1, 1/2, 1/3, 1/4
i: 2 2/3, 2/1 1/2
i: 3 1/3, 3/2, 3/4 1/3
i: 4 1/4, 3/4 4/1, 4/2, 4/3
*/
}