Cod sursa(job #2219584)
| Utilizator | Data | 9 iulie 2018 13:30:38 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int CMMDC(int a, int b);
int a, b, n;
int main()
{
fin >> n;
for ( int i = 1; i <= n; ++i )
{
fin >> a >> b;
fout << CMMDC(a, b) << '\n';
}
fin.close();
fout.close();
return 0;
}
int CMMDC(int a, int b)
{
if ( b == 0 ) return a;
return CMMDC(b, a % b);
}