Cod sursa(job #2219097)
Utilizator | Data | 7 iulie 2018 11:54:02 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("euclid2.in");
ofstream fout ("euclid2.out");
int n,a,b;
int cmmdc(int a, int b)
{
if (!b) return a;
return cmmdc(b, a % b);
}
int main ()
{
fin >> n;
for (int i = 1; i <= n; i++)
{
fin >> a >> b;
fout << cmmdc(a,b) << endl;
}
return 0;
}