Cod sursa(job #1129919)
| Utilizator | Data | 28 februarie 2014 10:16:48 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
FILE* f = fopen("euclid.in", "r");
FILE* g = fopen("euclid.out", "w");
int cmmdc(int a, int b){
if (b == 0) return a;
return cmmdc(b, a % b);
}
void do_test()
{
int n, m;
fscanf(f, "%d %d\n", &n, &m);
fprintf(g, "%d\n", cmmdc(n, m));
}
int main()
{
int t;
fscanf(f, "%d\n", &t);
for (int i = 1; i <= t; i++) {
do_test();
}
return 0;
}
