Pagini recente » Cod sursa (job #1862454) | Cod sursa (job #2347120) | Cod sursa (job #428650) | Cod sursa (job #2113501) | Cod sursa (job #1747910)
#include <iostream>
#include <fstream>
#include <algorithm>
#include <set>
#include <queue> // std::priority_queue
#include <vector> // std::vector
#include <functional> // std::greater
using namespace std;
//17:46
int gcd(int a, int b) {
if (b)
return gcd(b, a%b);
return a;
}
int main() {
ifstream cin("euclid2.in");
ofstream cout("euclid2.out");
int n, m, x, y;
cin>>n;
for (int i = 0; i < n; i++) {
cin>>x>>y;
cout<<gcd(x, y)<<"\n";
}
return 0;
}