Pagini recente » Cod sursa (job #2180128) | Cod sursa (job #436508) | Cod sursa (job #1618734) | Cod sursa (job #1163628) | Cod sursa (job #3201559)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("euclid2.in");
ofstream fout ("euclid2.out");
int euclid (int a, int b) {
while (a != b) {
if (a > b) {
a -= b;
} else {
b -= a;
}
}
return a;
}
int main() {
int n, a[100001], b[100001];
fin >> n;
for (int i = 1; i <= n; ++i){
fin >> a[i] >> b[i];
}
for (int i = 1; i <= n ; ++i) {
fout << euclid(a[i], b[i]) << "\n";
}
return 0;
}