Cod sursa(job #2360453)
| Utilizator | Data | 1 martie 2019 20:44:23 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;
ifstream in("euclid.in");
ofstream out("euclid.out");
int f(int a, int b)
{
return (!b) ? a : f(b, a%b);
}
int main()
{
int n;
in >> n;
for (int x, y, i = 0; i < n; ++i)
{
in >> x >> y;
out << f(x, y) << '\n';
}
system("pause");
}
