Cod sursa(job #1456424)
| Utilizator | Data | 30 iunie 2015 17:57:01 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
#define fin "euclid2.in"
#define fou "euclid2.out"
using namespace std;
ifstream t1(fin);
ofstream t2(fou);
int cmmdc(int a, int b)
{
if (a != b)
{
if(a<b) cmmdc(a, b - a);
else cmmdc(b,a-b);
}
else return a;
}
int main()
{
int n, i,a,b;
t1 >> n;
for (i = 1; i <= n;i++)
{
t1 >> a>> b;
t2 << cmmdc(b, a)<<'\n'; ;
}
t1.close();
t2.close();
return 0;
}
