Pagini recente » Cod sursa (job #83155) | Cod sursa (job #5123) | Cod sursa (job #1859146) | Cod sursa (job #2240361) | Cod sursa (job #1973570)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
long long int p,n,a[1000000],i,j,k;
int main()
{
fin>>n;
for(i=2;i<=n/2;i++)
{
a[i]=a[i]+1;
if(a[i]==1)
for(j=i+i;j<=n;j=j+i)
{
if(a[j]>1)
{
for(k=2*j;k<=n;k=k+j)
a[k]=a[k]-((k-j)/j)*2;
}
a[j]=a[j]+((j-i)/i)*2;
}
}
for(j=n/2+1;j<=n;j++)
a[j]=a[j]+1;
p=2*2-1;
for(int i=3;i<=n;i++)
p=p+i-a[i]+i-1;
fout<<p;
return 0;
}