Cod sursa(job #1442186)
Utilizator | Data | 24 mai 2015 16:37:53 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
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 a, b, n;
int cmmdc(int x, int y){
if (!y)
return x;
else
return cmmdc(y, x%y);
}
int main(){
fin >> n;
for (int i = 1; i <= n; i++){
fin >> a >> b;
fout << cmmdc(a, b);
}
return 0;
}