Pagini recente » Cod sursa (job #2458176) | Atasamentele paginii Clasament infostar | Cod sursa (job #185780) | Cod sursa (job #2057894) | Cod sursa (job #1067614)
#include <fstream>
#include <vector>
#define maxn 1000001
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
vector<int> pr;
int f,phi[maxn],lp[maxn],n;
int main ()
{
fin>>n;
phi[1] = 1;
for (int i=2; i<=n; ++i)
{
if (lp[i] == 0)
{
lp[i] = i;
phi[i] = i-1;
pr.push_back (i);
}
else
{
if (lp[i/lp[i]] == lp[i])
phi[i] = phi[i/lp[i]]*lp[i];
else
phi[i] = phi[i/lp[i]]*(lp[i]-1);
}
for (int j=0; j<pr.size() && pr[j] <= lp[i] && pr[j]*i <= n; ++j)
lp[pr[j]*i] = pr[j];
f += phi[i];
}
fout<<f*2+1;
}