Cod sursa(job #786996)
Utilizator | Data | 12 septembrie 2012 14:51:15 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
long CMMDC(long a, long b);
int main()
{
long numA, numB;
int T;
ifstream inFILE("euclid2.in");
ofstream outFILE("euclid2.out");
inFILE >> T;
for (int i = 1; i <= T; i++)
{
inFILE >> numA >> numB;
outFILE << CMMDC(numA,numB) << "\n";
}
system("pause");
return 0;
}
long CMMDC(long a, long b)
{
if (b == 0)
return a;
else
return CMMDC(b,a%b);
}