Cod sursa(job #1316568)
Utilizator | Data | 13 ianuarie 2015 21:58:22 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int gasesteCMMDC(int a,int b){
if(a == 0){
return b;
}
if(b == 0){
return a;
}
if(a%b == 0)
{
return b;
}
return gasesteCMMDC(b,a%b);
}
int main()
{
int a,b,t;
fin>>t;
for(int i = 1 ; i <= t ; i++){
fin>>a>>b;
fout<<gasesteCMMDC(a,b)<<endl;
}
return 0;
}