Cod sursa(job #1415955)
Utilizator | Data | 6 aprilie 2015 22:50:56 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
int cmmdc(int a, int b) {
if (!b) return a;
return cmmdc(b, a % b);
}
int main() {
FILE *input, *output;
int n, a, b, result;
input = fopen("euclid2.in", "r");
output = fopen("euclid2.out", "w");
fscanf(input, "%d", &n);
for(int i = 0; i < n; i++) {
fscanf(input, "%d %d", &a, &b);
result = cmmdc(a,b);
fprintf(output, "%d\n", result);
}
return 0;
}