Cod sursa(job #345698)
Utilizator | UAIC-Padurariu-Cristian federer | Data | 4 septembrie 2009 11:57:09 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include<stdio.h>
#define CRY 32000
int main()
{
FILE *in, *out;
int n, v[CRY], i, j, min;
in = fopen("euclid2.in", "rt");
out = fopen("euclid2.out", "wt");
fscanf(in, "%d", &n);
for(i=1;i<=n*2;i++)
fscanf(in, "%d", &v[i]);
for(i=1;i<n*2;i++)
{
if (v[i] > v[i+1])
min = v[i+1];
else
min = v[i];
for(j=min;j>=1;j--)
if((v[i]%j==0) && (v[i+1]%j==0))
{
fprintf(out, "%d ", j);
i++;
break;
}
}
fcloseall();
return 0;
}