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