Cod sursa(job #858976)
Utilizator | Data | 19 ianuarie 2013 16:22:00 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.25 kb |
#include <iostream>
using namespace std;
int n,a,b,i;
int cmmdc(int a, int b)
{
if (!b) return a;
return cmmdc(b, a % b);
}
int main()
{
cin>>n;
for (i=1;i<=n;i++)
{
cin>>a>>b;
cout<<cmmdc(a,b)<<"\n";
}
return 0;}