Cod sursa(job #629863)
| Utilizator | Data | 4 noiembrie 2011 04:53:14 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
using namespace std;
int gcd(int a, int b) {
if (a < b) {
int c = a;
a = b;
b = c;
}
int d = b;
b = a % b;
a = d;
if (b == 0) {
return a;
} else {
return gcd(a, b);
}
}
int main(int argc, char* argv[], char* envp[]) {
int n;
int a, b;
ifstream in;
in.open("euclid2.in");
ofstream out;
out.open("euclid2.out");
in >> n;
for (int i = 0; i < n; ++i) {
in >> a >> b;
out << gcd(a, b) << endl;
}
in.close();
out.close();
return 0;
}