Pagini recente » Cod sursa (job #2678325) | Cod sursa (job #1014697) | Cod sursa (job #2117177) | Cod sursa (job #2426026) | Cod sursa (job #1527228)
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
int gcd(int a, int b)
{
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int main()
{
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int n;
fin >> n;
//cin >> n;
long long k=0;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
{
if (i >= j)
if (gcd(i, j) == 1){
//cout << gcd(i, j) << " ";
k++;
}
if (i < j)
if (gcd(j, i) == 1)
{
//cout << gcd (j, i) << " ";
k++;
}
}
fout << k;
//cout << gcd(1,1) << gcd(2,1) << gcd(3,1) << gcd(2,1) << gcd(2,2) << gcd(3,2) << gcd(3,3);
}