Cod sursa(job #1681782)
Utilizator | Data | 9 aprilie 2016 18:30:56 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int T;
int GCD(int A, int B)
{
if(!B)
return A;
return GCD(B, A%B);
}
void Read()
{
fin >> T;
for(int i = 1; i <= T; i++)
{
int a, b;
fin >> a >> b;
fout << GCD(a,b) << "\n";
}
}
int main()
{
Read();
return 0;
}