Cod sursa(job #1929361)
Utilizator | Data | 17 martie 2017 15:46:04 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int gcd(int x, int y)
{
if (y == 0) return x;
return gcd(y, x % y);
}
int main()
{
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int n, x, y;
in >> n;
for (int i = 0; i < n; i++) {
in >> x >> y;
out << gcd(x, y) << "\n";
}
return 0;
}