Cod sursa(job #1597177)
Utilizator | Chiurtu Alexandru und3rsrl | Data | 11 februarie 2016 19:15:39 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
int gcd(int a, int b) {
if(b==0) return a;
else return gcd(b, a % b);
}
int main() {
int a,b,n;
ifstream in ("euclid2.in");
ofstream out ("euclid2.out");
in >> n;
for(int i=0; i < n; i++) {
in >> a >> b;
out << gcd(a,b) << endl;
}
in.close();
out.close();
return 0;
}