Cod sursa(job #1568431)
| Utilizator | Data | 14 ianuarie 2016 11:15:29 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | c | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <stdio.h>
#include <stdlib.h>
int cmmdc(int a, int b)
{
// if(b==0) return a;
// return cmmdc(b, a%b);
while(b)
{
int r = a%b;
a = b;
b = r;
}
return a;
}
int main(void)
{
FILE *in = fopen("euclid2.in", "rt");
if(!in) return 1;
FILE *out = fopen("euclid2.out", "wt");
int a,b,n,i;
fscanf(in, "%d", &n);
for (i = 0; i < n; ++i) {
fscanf(in, "%d%d", &a, &b);
fprintf(out, "%d\n", cmmdc(a,b));
}
fclose(in);
fclose(out);
return 0;
}
