Cod sursa(job #1010724)
Utilizator | Data | 15 octombrie 2013 16:22:21 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<stdio.h>
int a,b,i,n ; FILE *f,*t ;
main() {
t=fopen("euclid.out","w") ;
f=fopen("euclid2.in","r") ; fscanf(f,"%d",&n) ;
for(i=1 ; i<=n ; i++) { fscanf(f,"%d%d",&a,&b) ;
while (a!=b)
if (a>b) a=a-b ; else b=b-a ; fprintf(t,"%d\n",a) ; }
fclose(f) ; fclose(t) ; return 0 ;
}