Pagini recente » Cod sursa (job #1446619) | Istoria paginii utilizator/pestcontrol133 | Cod sursa (job #743844) | Cod sursa (job #2172389) | Cod sursa (job #162366)
Cod sursa(job #162366)
#include <fstream.h>
#include <math.h>
long int cmmdc(long int a, long int b)
{ long int aux=0;
while (a!=b && aux!=1)
if (a<b) { aux=b-a;
b=b-a;
}
else { aux=a-b;
a=a-b;
}
return aux;
}
long int prim(long int n)
{
long int p=0;
int prm=1;
for(p=2;p<=sqrt(n);p++)
if(n%p==0) {prm=0; break;}
return prm;
}
int main(void)
{
long int n,i,j,count=0,c=0;
ifstream date_intrare("fractii.in");
ofstream date_iesire("fractii.out");
date_intrare>>n;
count=n+n-1;
for(i=2;i<=n;i++)
for(j=2;j<i;j++)
{
if(prim(i)==1) {c=c+i-2; i++;}
else
{
if(cmmdc(i,j)==1)c++;
}
}
count=count+ 2*c;
date_iesire<<count;
date_intrare.close();
date_iesire.close();
return 0;
}