Pagini recente » Cod sursa (job #1466148) | Cod sursa (job #616119) | Cod sursa (job #1215350) | Cod sursa (job #398760) | Cod sursa (job #1244750)
#include <iostream>
#include <fstream>
using namespace std;
int cmmdc (long i, long j){
long r=1;
while(r!=0){
r=i%j;
i=j;
j=r;
}
return i;
}
int main()
{
long n, k;
ifstream f("fractii.in");
ofstream g("fractii.out");
f>>n;
k=n+n-1;
for(long i=2; i<=n; i++)
for(long j=2;j<=n;j++)
if((i%2==0 && j%2!=0 || i%2!=0 && j%2==0 || i%2!=0 && j%2!=0) && cmmdc (i, j)==1)k++;
g<<k;
f.close();
g.close();
return 0;
}