Cod sursa(job #2858919)
Utilizator | Data | 28 februarie 2022 16:53:20 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int divizor(int a,int b){
if(a%b==0) return b;
else if(b%a==0) return a;
else if(a>=b) divizor(a%b,b);
else divizor(a,b%a);
}
int main()
{
int n,a,b;
fin>>n;
for(int i=0;i<n;i++){
fin>>a>>b;
fout<<divizor(a,b)<<endl;
}
return 0;
}