Cod sursa(job #1105156)
Utilizator | Data | 11 februarie 2014 15:32:00 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <stdio.h>
#include <stdlib.h>
int main()
{
int i,j,n,m,aux,a[100][100];
FILE *in, *out;
in = fopen("euclid2.in", "r");
out = fopen("euclid2.out", "w");
fscanf(in,"%d",&n);
for (m=0;m<n;m++)
{
fscanf(in,"%d%d",&i,&j);
if (i<j)
{
aux=i%j;
i=j;
j=aux;
}
while (i%j)
{
aux=i%j;
i=j;
j=aux;
}
fprintf(out,"%d\n",j);
}
return 0;
}