Cod sursa(job #2467321)
| Utilizator | Data | 3 octombrie 2019 23:02:04 | |
|---|---|---|---|
| Problema | Fractii | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.5 kb |
#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;
}
