Cod sursa(job #1205400)
Utilizator | Data | 6 iulie 2014 13:54:06 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
long long cmmdc(long long a, long long b){
long long c;
while (b){
c = a % b;
a = b;
b = c;
}
return a;
}
int main()
{
ifstream in("euclid2.in");
ofstream out("euclid2.out");
long long a, b, n;
in >> n;
for (int i = 0; i < n; i++){
in >> a >> b;
out << cmmdc(a, b) << endl;
}
in.close();
out.close();
return 0;
}