Cod sursa(job #3203263)
Utilizator | Data | 13 februarie 2024 13:29:25 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main() {
ifstream fin("euclib2.in");
ofstream fout("euclid2.out");
int T;
fin>>T;
for(int i=1; i<=T; i++){
int a, b;
fin>>a>>b;
int mn=min(a,b);
int mx=max(a,b);
while(mn!=0){
int r=mx%mn;
mx=mn;
mn=r;
}
fout<<mx<<endl;
}
return 0;
}