Pagini recente » Cod sursa (job #3234933) | Istoria paginii problema/plicuri | Atasamentele paginii Solutii .com 2009, Runda 1 | Cod sursa (job #114258) | Cod sursa (job #1042095)
#include <iostream>
#include <fstream>
using namespace std;
int T, A, B;
int GCD(int a, int b)
{
if(b == 0) return a;
return GCD(b, a % b);
}
int main(void)
{
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
fin >> T;
for(int i = 1; i <= T; i++) {
fin >> A >> B;
auto r = GCD(A, B);
fout << r << endl;
}
fclose(fin);
fclose(fout);
}