Cod sursa(job #2345510)
| Utilizator | Data | 16 februarie 2019 13:58:43 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
int t,a,b;
int gcd(int a, int b)
{
if (!b)
return a;
return gcd(b, a%b);
}
int main()
{
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", gcd(a,b));
}
}
