Cod sursa(job #1768251)
Utilizator | Data | 30 septembrie 2016 16:26:45 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
int gcd(int a, int b) {
if(!b) return a;
else return gcd(a%b, 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;
}