Cod sursa(job #716280)
Utilizator | Data | 18 martie 2012 15:40:06 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <iostream>
#include <fstream>
using namespace std;
int cmmdc(int a, int b) {
if(b==0) return a;
return cmmdc(b, a%b);
}
int main() {
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int t, i, a, b;
f>>t;
for(i=1; i<=t; i++) {
f>>a>>b;
g<<cmmdc(a,b)<<"\n";
}
f.close();
g.close();
return 0;
}