Cod sursa(job #1500505)
| Utilizator | Data | 12 octombrie 2015 02:24:36 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 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");
ofstream cout("euclid2.out");
int n, a, b;
for (cin >> n; n; n--) {
cin >> a >> b;
printf("%d\n", gcd(a, b));
}
return 0;
}
