Cod sursa(job #1925791)
| Utilizator | Data | 13 martie 2017 18:13:10 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <cstdio>
using namespace std;
int n,a,b,z;
inline int cmmdc(int a, int b){
while (b != 0) {
z = a;
a = b;
b = z % b;
}
return a;
};
int main()
{
freopen("euclid2.in", "rb", stdin);
freopen("euclid2.out", "wb", stdout);
scanf("%d",&n);
for(int index = 0; index < n; index++){
scanf("%d %d", &a,&b);
printf("%d\n", cmmdc(a,b));
}
fclose(stdin);
return 0;
}
