Cod sursa(job #729632)
| Utilizator | Data | 29 martie 2012 19:33:23 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <cstdio>
#include <cmath>
#include <cstdlib>
using namespace std;
FILE *f1, *f2;
long unsigned t,a,b;
long unsigned cmmdc(long unsigned nr1,long unsigned nr2)
{
long unsigned r=nr1%nr2;
while(r)
{
nr1=nr2;nr2=r;r=nr1%nr2;
}
return nr2;
}
int main()
{
f1 = freopen("euclid2.in", "r", stdin);
f2 = freopen("euclid2.out", "w", stdout);
scanf("%lu", &t);
for(;0<t;t--)
{
scanf("%lu %lu", &a,&b);
printf("%lu\n", cmmdc(a,b));
}
fclose(f1);
fclose(f2);
return 0;
}
