Pagini recente » Cod sursa (job #961560) | Cod sursa (job #2488491) | Cod sursa (job #1378321) | Cod sursa (job #2069281) | Cod sursa (job #1517418)
#include <fstream>
using namespace std;
ifstream in ("fractii.in");
ofstream out ("fractii.out");
int e[1000001];
int main()
{
long long n, i, j, k, s=1;
in >> n;
for ( i=1; i<=n; i++)
{
for (i=1; i<=n; i++)
e[i]=i;
for (i=2; i<=n; i++)
if ( e[i] == i)
for (j=i; j<=n; j+=i)
{
e[j]=e[j]/i*(i-1);
}
}
for ( i=2; i<=n; i++)
{
s+=2*e[i];
}
out << s;
return 0;
}