Cod sursa(job #1491779)
Utilizator | Data | 26 septembrie 2015 09:00:26 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("euclid2.in");
int cmmdc (int a, int b)
{
if (a==b) return a;
if (a>b) return cmmdc(a-b,b);
return cmmdc (a,b-a);
}
int main()
{
int n,a,b;
fin>>n;
for (int i=1;i<=n;i++)
{
fin>>a>>b;
cout<<cmmdc(a,b)<<"\n";
}
return 0;
}