Pagini recente » Cod sursa (job #1032488) | Cod sursa (job #1665897) | Cod sursa (job #1544175) | Cod sursa (job #522974) | Cod sursa (job #1416914)
#include <fstream>
using namespace std;
ofstream out("fractii.out");
ifstream in("fractii.in");
bool q[1000001];
int Sieve(int p, int n){
int nr=0, i;
for(int i=2; i<=n;i++)
q[i]=false;
for(i=2;2*i<=p;i++)
if(q[i]==0 && p%i==0)
for(int j=2*i;j<=n;j+=i){
q[j]=true;
if(j>p)
nr++;
}
if(nr==0)
nr=(n-n%p)/p-1;
return n-p-nr;
}
int main(){
int n, p, nr;
in>>n;
nr=2*n-1;
for(int p=2; p<=n-1; p++)
nr+=2*Sieve(p, n);
out<<nr;
}