Cod sursa(job #1777569)
Utilizator | Data | 12 octombrie 2016 17:29:32 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.21 kb |
#include <iostream>
#include <math.h>
#include <algorithm>
using namespace std;
int main()
{
int n;
int a;
int b;
cin >> n;
while (n)
{
cin >> a >> b;
cout << __gcd(a,b) << endl;
n--;
}
return 0;
}