Cod sursa(job #2641236)
Utilizator | Data | 10 august 2020 17:06:29 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <stdio.h>
#include <iostream>
#include <fstream>
using namespace std;
int main(void)
{
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
int k, n, m, a;
for (scanf("%d", &k); k > 0; k--)
{
scanf("%d %d", &n, &m);
while (m != 0) {
a = m;
m = n % m;
n = a;
}
printf("%d\n", a);
}
return 0;
}