Cod sursa(job #2087396)
Utilizator | Data | 13 decembrie 2017 16:30:20 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream o("euclid2.out");
int cmmdc(int a, int b)
{
if(!b) return a;
if(a>b) return cmmdc(a-b,b);
else return cmmdc(a,b-a);
}
int main()
{
int i, t, a, b;
f >> t;
for(i=0; i<t;i++)
{
f >> a >> b;
o << cmmdc(a, b) << " ";
}
return 0;
}