Cod sursa(job #1989824)
Utilizator | Data | 9 iunie 2017 00:24:56 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<stdio.h>
#include<iostream>
#include<cstdlib>
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 = 0; i < t; i++) {
scanf("%d%d", &a, &b);
printf("%d\n", gcd(a, b));
}
//system("Pause");
return 0;
}