Cod sursa(job #1042086)
Utilizator | Data | 26 noiembrie 2013 16:19:58 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#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;
fout << GCD(A, B) << endl;
}
}