Cod sursa(job #2156711)
Utilizator | Data | 8 martie 2018 22:33:54 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
int gcd(int a, int b)
{
if (!a)
return b;
return gcd(b%a, a);
}
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int main()
{
int n, a, b;
fin >> n;
for (int i = 0; i < n; i++) {
fin >> a >> b;
fout << gcd(a, b) << "\n";
}
return 0;
}