Cod sursa(job #595633)
Utilizator | Popescu Alexandru alexmpopescu | Data | 13 iunie 2011 14:30:04 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
int gcd(int a, int b) {
if (!a) return b;
return gcd(b,a%b);
}
int main() {
int a,b,n;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
fin>>n;
for (int i=0;i<n;i++) {
fin>>a; fin>>b;
fout<<gcd(a,b)<<endl;
}
fin.close();
fout.close();
return 0;
}