Cod sursa(job #2924219)
Utilizator | Data | 27 septembrie 2022 12:56:50 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <bits/stdc++.h>
#include <fstream>
using namespace std;
ifstream cin("euclid.in");
ofstream cout("euclid.out");
int gcd(int a, int b){
if(a == 0 or b == 0){
return max(a, b);
}
if(a < b){
swap(a, b);
}
return gcd(a % b, b);
}
void solve(){
int a, b;
cin >> a >> b;
cout << gcd(a, b) << '\n';
}
int main(){
int t = 1;
cin >> t;
while(t--){
solve();
}
}