Cod sursa(job #2299967)
Utilizator | Data | 10 decembrie 2018 17:36:12 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int cmmdc(int,int);
int n,a,b;
int main()
{
fin>>n;
while (n!=0)
{
n--;
fin>>a>>b;
fout<<cmmdc(a,b)<<"\n";
}
return 0;
}
int cmmdc(int x,int y)
{
if (y==0)
return x;
else
return cmmdc(y,x%y);
}