Cod sursa(job #864749)
| Utilizator | Data | 25 ianuarie 2013 18:26:36 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <stdio.h>
FILE *in,*out;
using namespace std;
long T,i,a[1001],b[1001],rest[1001],u;
int main()
{
in=fopen("euclid2.in","rt");
out=fopen("euclid2.out", "wt");
fscanf(in, "%l", &T);
for (i=1; i<=T; i++)
{
fscanf(in, "%l%l", &a[i], &b[i]);
while (b[i])
{
rest[i]=a[i]%b[i];
a[i]=b[i];
b[i]=rest[i];
}
fprintf(out, "%l\n", a[i]);
}
fclose(in);
fclose(out);
return 0;
}
