Pagini recente » Cod sursa (job #441833) | Cod sursa (job #2377525) | Cod sursa (job #1540118) | Cod sursa (job #399654) | Cod sursa (job #555515)
Cod sursa(job #555515)
#include<fstream.h>
ifstream f("fractii.in");
ofstream g("fractii.out");
int a,b,i,j,n;
long long nr;
int euclid(int aa, int bb)
{ int a,b;
a=aa;
b=bb;
if(a==b) return 0;
else while(a!=b) { if(a>b) a-=b;
else b-=a;
}
if(a==1) return 1;
return 0;
}
int main()
{ f>>n;
for(i=2;i<=n;i++)
for(j=2;j<=n;j++) if(euclid(i,j)) nr++;
nr+=n;
nr+=n-1;
g<<nr;
f.close();
g.close();
return 0;
}