Cod sursa(job #2254288)
Utilizator | Data | 4 octombrie 2018 22:49:31 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream fin ("euclid2.in");
ofstream fout ("euclid2.out");
int cmmdc(int a, int b) {
if(!b) {
return a;
}
return cmmdc(b, a % b);
}
int main()
{
int a, b, n;
fin >> n;
for(int i=1; i<=n; i++) {
fin >> a >> b;
fout << cmmdc(a, b) << endl;
}
return 0;
}