Pagini recente » Cod sursa (job #338082) | Istoria paginii utilizator/imgelu | Cod sursa (job #153982) | Cod sursa (job #200148) | Cod sursa (job #2099745)
#include <iostream>
#include <fstream>
using namespace std;
long long phi[1000001];
int main()
{
ifstream f("fractii.in");
ofstream g("fractii.out");
int n;
f>>n;
for(int i=2; 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];
}
}
long long s=0;
for(int i=2; i<=n; i++) s+=phi[i];
g<<2*s+1;
return 0;
}