Cod sursa(job #2576943)
Utilizator | Data | 7 martie 2020 16:48:33 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | c-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <stdio.h>
int main()
{
FILE *f = fopen("euclid2.in","r");
FILE *g = fopen("euclid2.out","w");
int t,x,y;
fscanf(f,"%d",&t);
for(int i=0;i<t;i++)
{
fscanf(f,"%d",&x);
fscanf(f,"%d",&y);
while(x!=y)
{
if(x>y)
x=x-y;
else
y=y-x;
}
fprintf(g,"%d",x);
}
return 0;
}