Cod sursa(job #1500506)
Utilizator | Data | 12 octombrie 2015 02:25:48 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <algorithm>
#include <stdio.h>
#include <iostream>
#include <fstream>
using namespace std;
int gcd(int a, int b) {
if (b)
return gcd(b, a % b);
return a;
}
int main() {
ifstream cin("euclid2.in");
freopen("euclid2.out", "w", stdout);
int n, a, b;
for (cin >> n; n; n--) {
cin >> a >> b;
printf("%d\n", gcd(a, b));
}
return 0;
}