Cod sursa(job #1206849)
Utilizator | Data | 11 iulie 2014 13:01:33 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#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);
}
int main()
{
fin>>T;
while(T--)
{
int A,B;
fin>>A>>B;
fout<<GCD(A,B)<<"\n";
}
return 0;
}