Pagini recente » Cod sursa (job #2408783) | Cod sursa (job #2194683) | Cod sursa (job #3268851) | Cod sursa (job #468995) | Cod sursa (job #2200823)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("euclid2.in");
ofstream fout ("euclid2.out");
int euclid(int a, int b)
{
int c;
while (b) {
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;
}