Cod sursa(job #1548312)
Utilizator | Data | 10 decembrie 2015 19:25:43 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int cmmdc(int a , int b){
if(!b) return a;
else cmmdc(b , a % b);
}
int main()
{
long long a , b;
int n;
fin >> n;
for(int i = 1 ; i <= n ; i++)
{
fin >> a >> b;
fout << cmmdc(a , b) << '\n';
}
fout.close();
return 0;
}