Cod sursa(job #1042121)
Utilizator | Data | 26 noiembrie 2013 16:45:34 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
int GCD(int a, int b)
{
if(!b) return a;
return GCD(b, a % b);
}
int main(void)
{
int T, A, B;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
fin >> T;
for(int i = 0; i < T; i++) {
fin >> A >> B;
fout << GCD(A, B) << "\n";
}
fin.close();
fout.close();
return 0;
}