Pagini recente » Cod sursa (job #2241237) | Cod sursa (job #254544) | Cod sursa (job #3205876) | Cod sursa (job #1664928) | Cod sursa (job #355354)
Cod sursa(job #355354)
#include<fstream.h>
char a[1000002];
void ciur(long long n)
{
long long i,k,nr;
a[1]=0;
for(i=2;i<=n;i++)
a[i]=1;
for(i=2;i<=n/2;i++)
{
if(a[i]==1)
{
k=2*i;
while(k<=n)
{
a[k]=0;
k+=i;
}
}
}
}
int main()
{
long long n,i,j,s;
ifstream f("fractii.in");
ofstream g("fractii.out");
f>>n;
ciur(n);
s=2*n-1;
for(i=2;i<=n-1;i++)
if(a[i]==1)
s+=2*(n+1-i-n/i);
g<<s;
f.close();
g.close();
return 0;
}