Cod sursa(job #2044055)
Utilizator | Data | 20 octombrie 2017 21:03:23 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
int divi2(int a, int b)
{
if(!b) return a;
return divi2(b , a % b);
}
int main()
{
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int T;
fin>>T;
int a,b;
for(int i = 0;i < T;i++)
{
fin>>a>>b;
fout<<divi2(a,b)<<'\n';
}
return 0;
}