Pagini recente » Cod sursa (job #177706) | Cod sursa (job #2168725) | Cod sursa (job #1604832) | Cod sursa (job #2776300) | Cod sursa (job #358121)
Cod sursa(job #358121)
#include<fstream.h>
#include<math.h>
int main()
{int n,i,k=0,j,a,b;
ifstream f("fractii.in");
ofstream g("fractii.out");
f>>n;
if(n>=1)k=2*n-1;
for(i=2;i<=n;i++)
{
if(i%2!=0)
for(j=2;j<=n;j++)
{
if(i-j==1||j-i==1)k++;
else {a=i;b=j;
while(a!=b){if(a>b)a=a-b;
else b=b-a;}
if(b==1)k++;}}
else for(j=3;j<=n;j+=2)
{
if(i-j==1||j-i==1)k++;
else {a=i;b=j;
while(a!=b){if(a>b)a=a-b;
else b=b-a;}
if(b==1)k++;}}}
g<<k;
f.close();
g.close();
return 0;
}