Cod sursa(job #527389)
| Utilizator | Data | 31 ianuarie 2011 13:39:21 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
const char iname[] = "euclid.in";
const char oname[] = "euclid.out";
ifstream fin(iname);
ofstream fout(oname);
int t, i, x, y;
inline int euclid(int a, int b)
{
if(!b)
return a;
else
return euclid(b, a % b);
}
int main()
{
fin >> t;
for(i = 1; i <= t; i ++)
{
fin >> x >> y;
fout << euclid(x, y) << "\n";
}
return 0;
}