Pagini recente » Cod sursa (job #2033483) | Cod sursa (job #2884517) | Cod sursa (job #2236516) | Cod sursa (job #2091919) | Cod sursa (job #2100626)
#include <bits/stdc++.h>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int v[1000002],n;
long long sum;
bool neprim[1000002];
int main()
{
f>>n;
for (int i=2;i<=n;++i)
{
v[i]=i;
}
for (int i=2;i<=n;++i)
{
if (!neprim[i])
for (int j=i;j<=n; j+=i)
{
neprim[j]=true;
v[j]-= v[j]/i;
}
sum+=v[i];
}
g<<'\n'<<2*sum+1;
return 0;
}