Cod sursa(job #1506218)
| Utilizator | Data | 20 octombrie 2015 10:47:28 | |
|---|---|---|---|
| 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 == 0)
return a;
return gcd(b, a % b);
}
int gcdNonRecursive(int a, int b) {
int r = 0;
while(a % b != 0) {
r = a % b;
a = b;
b = r;
}
return b;
}
int main() {
ifstream fin("input.in");
ofstream fout("output.out");
int t;
fin >> t;
while(t --) {
int a, b;
fin >> a >> b;
fout << gcdNonRecursive(a, b) << '\n';
}
}
