Cod sursa(job #737471)
Utilizator | Robert Bugiros | Data | 19 aprilie 2012 15:02:27 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <cstdio>
using namespace std;
int cmmdc(int a,int b)
{
int aux;
while (b != 0)
{
aux = a % b;
a = b;
b = aux;
}
return a;
}
void citire()
{
int n,a,b;
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
scanf ("%d",&n);
for (int i = 1;i <= n;++i)
{
scanf ("%d%d",&a,&b);
printf ("%d\n",cmmdc(a,b));
}
}
int main()
{
citire();
return 0;
}