Cod sursa(job #1979487)
Utilizator | Data | 10 mai 2017 18:02:45 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
int CMMDC(int a, int b)
{
if(b == 0)
return a;
else
return CMMDC(b,a%b);
}
int main()
{
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int T,a,b;
in >> T;
for(int i = 0; i< T; i++)
{
in >> a >> b;
out<<CMMDC(a,b)<<endl;
}
return 0;
}