Cod sursa(job #1928351)
Utilizator | Data | 16 martie 2017 03:25:24 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
int fa(int a, int b) {
if(!b) return a;
else return fa(b, a%b);
}
int main() {
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int n, a, b;
fin >> n;
for(int i = 1; i<= n;++i) {
fin >> a >> b;
fout << fa(a, b) << '\n';
}
return 0;
}