Cod sursa(job #1223399)
Utilizator | Data | 28 august 2014 06:20:41 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
int gcd(int a, int b){
if (!b)
return a;
else
return gcd(b, a%b);
}
int main(){
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int n, a, b, cmmdc;
in >> n;
for (int i = 0; i < n; i++){
in >> a;
in >> b;
cmmdc = gcd(a, b);
out << cmmdc << endl;
}
in.close();
out.close();
return 0;
}