Cod sursa(job #1129940)
| Utilizator | Data | 28 februarie 2014 10:23:57 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
FILE* f = fopen("euclid2.in", "r");
FILE* g = fopen("euclid2.out", "w");
int cmmdc(int a, int b)
{
while (b != 0) {
int aux = b;
b = a % b;
a = aux;
}
return a;
}
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;
}
