Cod sursa(job #3164694)
Utilizator | Broscoi Mihai fortyfor | Data | 4 noiembrie 2023 09:05:25 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
std::ifstream fin("euclid2.in");
std::ofstream fout("euclid2.out");
int main()
{
unsigned int T;
fin >> T;
unsigned long long a,b;
for (unsigned int i=0;i<T;i++)
{
fin >> a >> b;
unsigned long long x=std::max(a,b),y=std::min(a,b);
while (x!=0 && y!=0) {
x%=y;
std::swap(x,y);
}
fout << std::max(x,y) << std::endl;
}
return 0;
}