Cod sursa(job #3156941)
Utilizator | Data | 13 octombrie 2023 20:52:07 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int gcd(int a, int b){
if(b == 0) return a;
return gcd(b, a % b);
}
int main()
{
int n,i,a,b;
fin >> n;
for(i = 1; i <= n; i++){
fin >> a >> b;
if(b > a) swap(a,b);
fout << gcd(a,b) << "\n";
}
return 0;
}