Pagini recente » Cod sursa (job #1100134) | Cod sursa (job #3004911) | Cod sursa (job #151159) | Cod sursa (job #1725459) | Cod sursa (job #261182)
Cod sursa(job #261182)
#include<fstream.h>
#include<conio.h>
#include<math.h>
int prime(int x)
{
int ok=1,i;
for(i=2;ok==1&&i<=sqrt(x);i++)
if(x%i==0)ok=0;
return ok;
}
int main(){
clrscr();
int nr,i,j,n,r,y,x;
cin>>n;
nr=2*n-1;
for(i=2;i<=n;i++)
for(j=2;j<=n;j++)
if(!(i%2==0&&j%2==0))
{
if((prime(i)==1&&j%i!=0)||(prime(j)==1&&i%j!=0))nr++;
else{x=i;y=j;while(y!=0){r=x%y;x=y;y=r;}
if(y==1)nr++;}
}
cout<<nr;
return 0;}