Cod sursa(job #2393294)
| Utilizator | Data | 31 martie 2019 11:56:56 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <cstdio>
using namespace std;
int euclid(int a, int b)
{
if(b == 0)
{
return a;
}
int rest = a % b;
while (rest != 0)
{
a = b;
b = rest;
rest = a % b;
}
return b;
}
int main()
{
int a, b, t;
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
scanf("%d", &t);
for(int i = 1; i <= t; i++)
{
scanf("%d %d", &a, &b);
printf("%d\n", euclid(a, b));
}
fclose(stdin);
fclose(stdout);
return 0;
}
