Cod sursa(job #2745015)
Utilizator | Data | 25 aprilie 2021 18:46:17 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int div(int a, int b)
{
if(a==b) return a;
if(a>b) return div(a-b,b);
else if(a<b) return div(a,b-a);
}
int main()
{
int t,a,b;
fin>>t;
for(int i=1;i<=t;++i)
{
fin>>a>>b;
fout<<div(a,b)<<"\n";
}
return 0;
}