Cod sursa(job #2416001)
Utilizator | Data | 26 aprilie 2019 18:29:19 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
int cmmdc (int a, int b){
if (b == 0)
return a;
else cmmdc(b, a%b);
}
int main()
{
int n, a, b;
ifstream fin("euclid2.in");
ofstream fout ("euclid2.out");
fin >> n;
for (int i = 0; i < n; i++){
fin >> a >> b;
fout << cmmdc(a, b) << endl;}
return 0;
}