7/25/2019 Codigo Hexa

http://slidepdf.com/reader/full/codigo-hexa 1/3

#include <practica 1.h>

void main(){

int8 Binario,siete;

while(1){port_B_pullups(true);Binario=input_B();for (i=0;i<4;++i)  shift_left(&Binario,1,0);for (i=0;i<4;++i)  shift_right(&Binario,1,0);

 SWITCH(Binario)

 {

 CASE (0000): OUTPUT_D (1111110); BREAK; CASE(0001):OUTPUT_D(0110000);BREAK;CASE(0010):OUTPUT_D(1101101);BREAK;CASE(0011): OUTPUT_D(1111001);BREAK;CASE(0100): OUTPUT_D(0110011);BREAK;CASE(0101): OUTPUT_D(1011101);BREAK;CASE(0110): OUTPUT_D(1000000);

BREAK;CASE(0111): OUTPUT_D(1110000);BREAK;CASE(1000): OUTPUT_D(1111111);BREAK;CASE(1001): OUTPUT_D(1111011);BREAK;CASE(1010): OUTPUT_D(1110111);BREAK;CASE(1011): OUTPUT_D(0011111);BREAK;CASE(1100): OUTPUT_D(1001110);

BREAK;CASE(1101): OUTPUT_D(0111101);BREAK;CASE(1110): OUTPUT_D(1001111);BREAK;CASE(1111): OUTPUT_D(1000111);DEFAULT: } output_D(siete); delay_ms(100); 

}

}

7/25/2019 Codigo Hexa

http://slidepdf.com/reader/full/codigo-hexa 2/3

PRACTICA 1 YA BIEN

#include <practica 1.h>

void main(){

int8 Binario,siete,i;while(1)

{port_B_pullups(true);Binario=input_B();for (i=0;i<4;++i)  shift_left(&Binario,1,0);for (i=0;i<4;++i)  shift_right(&Binario,1,0);

 SWITCH(Binario)

 { CASE 0:

siete=0b1111110;

 BREAK; CASE 1:  siete=0b0110000;BREAK;CASE 2:  siete=0b1101101;BREAK;CASE 3:

siete=0b1111001;BREAK;CASE 4:  siete=0b0110011;BREAK;CASE 5:siete=0b1011011;BREAK;CASE 6:siete=0b1011111;BREAK;CASE 7:siete=0b1110000;BREAK;CASE 8:siete=0b1111111;BREAK;

CASE 9:siete=0b1111011;BREAK;

7/25/2019 Codigo Hexa

http://slidepdf.com/reader/full/codigo-hexa 3/3

CASE 10:siete=0b1110111;BREAK;CASE 11:siete=0b0011111;BREAK;CASE 12:

siete=0b1001110;BREAK;CASE 13:siete=0b0111101;BREAK;CASE 14:siete=0b1001111;BREAK;CASE 15:siete=0b1000111;default: }

 output_D(siete); delay_ms(100); 

}}