Pagini recente » Cod sursa (job #3146339) | Cod sursa (job #119595) | Cod sursa (job #3278019) | Cod sursa (job #668582) | Cod sursa (job #3265599)
#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;
}