Pagini recente » Cod sursa (job #813741) | Cod sursa (job #2210596) | Cod sursa (job #2136919) | Cod sursa (job #28495) | Cod sursa (job #2857197)
#include <bits/stdc++.h>
using namespace std;
const int nmax = 1e6;
int phi[nmax+5];
int main (){
ifstream f("fractii.in");
ofstream g("fractii.out");
int n; f >> n;
for(int i=1; i<=n; i++) phi[i] = i;
for(int i=2; i<=n; i++) {
if(phi[i]==i) {
phi[i] = i - 1;
for(int j=i+i; j<=n; j+=i)
phi[j] = phi[j] / i * (i-1);
}
}
long long nr = 1;
for(int i=2; i<=n; i++)
nr = nr + 2LL * phi[i];
g << nr;
return 0;
}