Pagini recente » Cod sursa (job #614470) | Istoria paginii runda/dinamica | Cod sursa (job #1641799) | Cod sursa (job #1629445) | Cod sursa (job #2467321)
#include <iostream>
#include <fstream>
using namespace std;
int euclid(int a, int b);
int main() {
ifstream in("fractii.in");
ofstream out("fractii.out");
int n, nr = 0;
in>>n;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
nr += (euclid(i, j) == 1 ? 1 : 0);
}
}
out<<nr;
return 0;
}
int euclid(int a, int b){
int c;
while(b){
c = a % b;
a = b;
b = c;
}
return a;
}