Pagini recente » Cod sursa (job #228379) | Cod sursa (job #139305) | Cod sursa (job #2405031) | Cod sursa (job #2206143) | Cod sursa (job #2200826)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("euclid2.in");
ofstream fout ("euclid2.out");
int euclid(int a, int b)
{
int c;
if (a<b)
{
c=a;
a=b;
b=c;
}
while (b!=0) {
c = a % b;
a = b;
b = c;
}
return a;
}
int main ()
{
int t;//T reprezinta numarul de perechi de numere
long int a,b;
fin >>t;
for (int i = 1;i <= t;i++)
{
fin >>a >>b;
fout << euclid(a,b)<<endl;
}
return 0;
}