Cod sursa(job #1926277)
| Utilizator | Data | 14 martie 2017 11:11:48 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <stdio.h>
using namespace std;
int euclid (int a, int b)
{
int r;
while (b != 0)
{
r = a % b;
a = b;
b = r;
}
return a;
}
int main()
{
FILE *in, *out;
in = fopen ("euclid2.in", "r");
out = fopen ("euclid2.out", "w");
int n;
fscanf (in, "%d", &n);
int i;
int a, b;
for (i = 1; i <= n; i++)
{
fscanf (in, "%d%d", &a, &b);
fprintf (out, "%d\n", euclid (a, b));
}
return 0;
}
