Cod sursa(job #2884459)
Utilizator | Data | 3 aprilie 2022 17:49:26 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | c-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <stdio.h>
#include <stdlib.h>
int cmmdc(int a, int b)
{
while(b != 0)
{
int r = a % b;
a = b;
b = r;
}
return a;
}
int main()
{
int t,x,y,v[100001];
scanf("%d", &t);
for(int i = 1; i <= t; i++)
{
scanf("%d %d", &x, &y);
v[i] = cmmdc(x,y);
}
for(int i = 1; i <= t; i++)
{
printf("%d\n", v[i]);
}
return 0;
}