Cod sursa(job #3265938)
| Utilizator |  Botorogeanu Andrei andrei_botorogeanu |
Data | 4 ianuarie 2025 12:47:21 |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.35 kb |
#include <iostream>
using namespace std;
int gcd(int a, int b) {
while(a != b ) {
if(a > b) a = a-b;
else b = b-a;
}
return a;
}
int main(int argc, char const *argv[])
{
int n; cin >> n;
int cnt = 0;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++) {
if(gcd(i, j) == 1) cnt++;
}
cout << cnt;
return 0;
}