Cod sursa(job #2172701)
Utilizator | Data | 15 martie 2018 17:34:23 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
int n, a, b;
int gcd(int a, int b)
{
return b ? gcd(b, a % b) : a;
}
int main()
{
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
fin >> n;
for (int i = 1;i <= n;++i)
{
fin >> a >> b;
fout << gcd(a, b) << "\n";
}
fin.close();
fout.close();
return 0;
}