Cod sursa(job #2973333)
Utilizator | Data | 31 ianuarie 2023 19:14:30 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.33 kb |
#include <bits/stdc++.h>
using namespace std;
int n, cnt;
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1 ; j <= n; j++)
if (gcd(i, j) == 1) cnt++;
cout << cnt << endl;
return 0;
}