Cod sursa(job #981683)
Utilizator | Data | 7 august 2013 18:29:30 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
//
// main.cpp
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int cmmdc(int a, int b){
if (b==0) return a;
return cmmdc(b, a%b);
}
int a,b,n;
int main()
{
in >> n;
for (int i=1; i<=n; i++){
in >> a >> b;
out << cmmdc(a,b) << "\n";
}
return 0;
}