Cod sursa(job #710597)
| Utilizator | Data | 10 martie 2012 10:54:21 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int euclid (int a, int b)
{
if (!b)
return a;
return euclid(b, a % b);
}
int main (int argc, char const *argv[])
{
ifstream in ("euclid2.in");
ofstream out ("euclid2.out");
int n; in >> n;
for (; n; --n)
{
int x, y; in >> x >> y;
out << euclid(x, y) << '\n';
}
in.close();
out.close();
return 0;
}
