Cod sursa(job #1605293)
Utilizator | Data | 18 februarie 2016 21:38:15 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <stdio.h>
using namespace std;
long a,b;
long T;
long i;
long cmmdc(long a, long b)
{
int r;
while(b)
{
r=a%b;
a=b;
b=r;
}
return a;
}
int main()
{
freopen("euclid2.in","r", stdin);
freopen("euclid2.out", "w", stdout);
scanf("%d", &T);
for(i=1; i<=T; ++i)
{
scanf("%d %d", &a, &b);
printf("%d\n", cmmdc(a,b));
}
return 0;
}