Cod sursa(job #1443318)
Utilizator | Data | 27 mai 2015 17:10:41 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int GCD(int A, int B)
{
while(B)
{
int R = A % B;
A = B;
B = R;
}
return A;
}
int main()
{
int T;
fin>>T;
while(T--)
{
int A,B;
fin>>A>>B;
fout<<GCD(A,B)<<"\n";
}
return 0;
}