Pagini recente » Cod sursa (job #1979188) | Cod sursa (job #325153) | Cod sursa (job #295343) | Cod sursa (job #824819) | Cod sursa (job #1240591)
#include <fstream>
#include <cmath>
using namespace std;
bool prim(int x)
{
int i,lim;
if(x==1) return 0;
if(x%2==0 && x!=2) return 0;
lim=(int)sqrt((double)x);
for(i=3; i<=lim; i=i+2)
if(x%i==0) return 0;
return 1;
}
int main()
{
ifstream in("fractii.in");
ofstream out("fractii.out");
int n,i,cnt=0,j;
in>>n;
cnt=n;
for(i=2; i<=n;i++)
{
cnt=cnt+n;
if((i&1)==0) cnt=cnt-(i>>1);
for(j=3;j<=i;j=j+2)
{
if(prim(j)) cnt=cnt-(i/j);
}
}
out<<cnt<<'\n';
return 0;
}