Pagini recente » Cod sursa (job #2585858) | Cod sursa (job #34496) | Cod sursa (job #226599) | Cod sursa (job #2398332) | Cod sursa (job #2373866)
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int v[1000001];
bool a[1000001];
int n,k;
void ciur()
{
int i,j;
for(i=2;i*i<=n;i++)
if(a[i]==0) for(j=i*i;j<=n;j=j+i) a[j]=1;
for (i=2;i<=n;i++) if (a[i]==0)v[++k]=i;
}
int main()
{
int i,sol=0,nr,x,j;
f>>n;
ciur();
for (i=2;i<=n;i++)
{
nr=i;
x=i;
j=1;
while (v[j]*v[j]<=x && x>1)
{
if (x%v[j]==0)
{
while (x%v[j]==0) x/=v[j];
nr=nr*(v[j]-1)/v[j];
}
j++;
}
if (x>1) nr=nr*(x-1)/x;
sol+=2*nr;
}
g<<sol+1;
return 0;
}