Pagini recente » Cod sursa (job #2839760) | Cod sursa (job #581328) | Cod sursa (job #1880526) | Cod sursa (job #1493035) | Cod sursa (job #1437039)
#include <iostream>
#include <fstream>
using namespace std;
int gcd(long a, long b){
int temp;
while(b){
temp = a;
a = b;
b = temp % b;
}
return (a < 0) ? -a : a;
}
long a, b, n;
int main()
{
ifstream in("euclid2.in");
ofstream out("euclid2.out");
in >> n ;
for(int i = 0; i < n; i++){
in >> a >> b;
if(a > b){
out << gcd(a,b) << endl;
}
else out << gcd(b,a) << endl;
}
}