Pagini recente » Cod sursa (job #1399365) | Borderou de evaluare (job #528057) | Cod sursa (job #841542) | Cod sursa (job #307674) | Cod sursa (job #187457)
Cod sursa(job #187457)
#include <stdio.h>
int prime(int nr1,int nr2){
int div,j,min=nr2;
if(nr1>nr2)min=nr1;
for(div=3;div<=min;div+=2){
if((nr1%div==0)&&(nr2%div==0))return 0;
}
return 1;
}
int main(){
int i,j,N,numar=0,a;
freopen("fractii.in","r",stdin);
freopen("fractii.out","w",stdout);
scanf("%d",&N);
numar=N;
for(i=3;i<=N;i++){
for(j=2;j<i;j++)
{if((i&1)||(j&1))
if(prime(i,j)){
numar++;
}
}
}
printf("%d\n",2*numar-1);
return 0;
}