Cod sursa(job #2081146)
| Utilizator | Data | 4 decembrie 2017 08:50:35 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int t, a, b;
FILE *f, *g;
f = fopen("euclid2.in", "r");
g = fopen("euclid2.out", "w");
fscanf(f, "%d" ,&t);
for (int i = 0; i < t; ++i) {
fscanf(f, "%d %d", &a, &b);
while(a && b) {
if (a > b)
a %= b;
else
b %= a;
}
fprintf(g, "%d\n", a + b);
}
fclose(f);
fclose(g);
return 0;
}
