Cod sursa(job #2640337)
| Utilizator | Data | 6 august 2020 08:37:45 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int n, v[17];
int gcd(int a, int b) {
if (a < b)
swap(a, b);
while (b != 0) {
int rest = a % b;
a = b;
b = rest;
}
return a;
}
int main() {
int n, x, y;
fin >> n;
for (int i = 1; i <= n; i++) {
fin >> x >> y;
fout << gcd(x, y) << "\n";
}
return 0;
}