Pagini recente » Cod sursa (job #556147) | Cod sursa (job #1104175) | Cod sursa (job #371470) | Cod sursa (job #2986471) | Cod sursa (job #1386)
Cod sursa(job #1386)
#include <fstream>
#include <math.h>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int main()
{
long n,i,prim[1000010],j,tot[1000010];
long long s=0;
f>>n;
for (i=2;i<=n;i++)
prim[i]=1;
tot[1]=1;
for (i=2;i<=n;i++)
{
for (j=2;j<=n/i;j++)
prim[i*j]=0;
if (prim[i])
tot[i]=i-1;
else
{
int ok=1;
for (j=2;j<i&&ok;j++)
if (prim[j]&&(i%j==0))
{
int aux=i;
while (aux%j==0&&aux>0)
aux/=j;
if (aux==1)
tot[i]=(j-1)*(i/j);
tot[i]=tot[i/aux]*tot[aux];
ok=0;
}
}
}
for (i=1;i<=n;i++)
s+=tot[i];
g<<((2*s)-1)<<"\n";
return 0;
}