Pagini recente » Cod sursa (job #13420) | Cod sursa (job #2176956) | Cod sursa (job #2899202) | Cod sursa (job #2565184) | Cod sursa (job #1416938)
#include<fstream>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int f[1000001],i,n,j;
long long s;
void euler()
{
int i, j;
f[1]=1;
for(i=2;i<=n;i++)
if(f[i]==0)
{
f[i]=i-1;
for(j=2*i;j<=n;j+=i)
if (f[j]==0) f[j]=j/i*(i-1);
else f[j]=f[j]/i*(i-1);
}
}
int main()
{
fin>>n;
euler();
for(i=2;i<=n;i++)
{
s+=f[i];
}
s*=2;
s++;
fout<<s;
return 0;
}