Cod sursa(job #901998)
Utilizator | Data | 1 martie 2013 12:30:47 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
long CMMDC(long a, long b);
int main (int argc, char *argv[]){
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";
}
return 0;
}
long CMMDC(long a, long b){
if (b == 0)
return a;
else
return CMMDC(b,a%b);
}