Cod sursa(job #1049745)
Utilizator | Data | 7 decembrie 2013 19:14:32 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
using namespace std;
int gcd(int a, int b) {
if (!b)
return a;
return gcd(b, a % b);
}
int main() {
ifstream cin("euclid2.in");
ofstream cout("euclid2.out");
int testCases;
for (cin >> testCases; testCases; testCases--) {
int a, b;
cin >> a >> b;
cout << gcd(a, b);
}
return 0;
}