Cod sursa(job #2850007)
Utilizator | Hordoan Roberto Sergiu XRoberto | Data | 16 februarie 2022 09:29:02 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("euclid2.in"); ofstream fout("euclid2.out");
int n;
int a, b;
void euclid() {
if(b > a)
swap(a, b);
while(b > 0) {
a %= b;
if(b > a)
swap(a, b);
}
fout << a << "\n";
}
void solve() {
fin >> n;
for(int i = 1; i <= n; i++)
fin >> a >> b, euclid();
}
void fclose() {
fin.close(), fout.close();
}
int main()
{
solve();
fclose();
return 0;
}