Cod sursa(job #3265599)
| Utilizator | Data | 1 ianuarie 2025 14:06:30 | |
|---|---|---|---|
| Problema | Fractii | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
int gcd(int a, int b) {
while (b != 0) {
int t = b;
b = a % b;
a = t;
}
return a;
}
int main() {
ifstream in("fractii.in");
ofstream out("fractii.out");
int N;
in >> N;
int count = 0;
for (int P = 1; P <= N; P++) {
for (int Q = 1; Q <= N; Q++) {
if (gcd(P, Q) == 1) {
count++;
}
}
}
out << count << endl;
return 0;
}
