*주* 스토어

*주*

개인

팔로워0 팔로우

소개

등록된 소개글이 없습니다.

전문분야 등록된 전문분야가 없습니다.

판매자 정보

학교정보

입력된 정보가 없습니다.

직장정보

입력된 정보가 없습니다.

자격증

입력된 정보가 없습니다.

판매지수

판매중 자료수

1개
전체 판매량

71개
최근 3개월 판매량

0개
자료후기 점수

평균A
자료문의 응답률

0%

전체자료 1개

ATMEGA128 CPU와 breadboard를 활용한 CLCD(2x16) 행맨 평가A좋아요

#include #include void delay_ms(unsigned int m);void delay_us(unsigned int u);void write_data(char d);void write_instruction(char i);void init_lcd(void);void null_lcd(void);void start_game(void);void main_game(void);void compare_word(void);void time_over_check(void);void game_over_check(void);void scaffold(void);void underbar_make(void);void alphabet_control(void);unsigned int count = 0;//unsigned int 0~65534, 오버플로우 발생시 카운트세는 변수void timer0_ovf_isr(void);//오버플로우 발생 시 작동하는 인터럽트 함수 선언char opening[35] = {"WELCOME TO HANG MAN MADE BY PARK"};char alphabet[27] = {'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};char word_level[9][10] = {"dog","apple","banana","swing","faith","patience","physics","stripper","elements"}; //[9] 배열개수, [10]하나의 배열당 길이char word_hint[9][10] = {"d_g","a_pl_","b_na_a","_wi_g","fai__","p_ti_nc_","_hy_i_s","_tr_pp_r","e_e_en_s"}; //[9] 배열개수, [10]하나의 배열당 길이char CLCD[32];char answer[15] = {"YOUR ANSWER => "};char wron{null_lcd();null_chk = 1;}int i, k, l, m, o, p = 0;l = 0;m = 0;if (_chk == 0){for(i = 0; word_level[word_ind][i] != 0; i++){CLCD[i+1] = '_';}}if(dup_check == 1){ //단어 길이 확인length_count = i;}CLCD[0] = '';for(k = 16; answer[l] != 0; k++, l++){CLCD[k] = answer[l];}alphabet_control();CLCD[31] = alphabet[alphabet_ind]; //알파벳 출력CLCD[10] = 'L'; //life출력CLCD[11] = 'I';CLCD[12] = 'F';CLCD[13] = 'E';CLCD[14] = ':';CLCD[15] = life_count+0x30;if( alphabet_ind > 25){alphabet_ind = 0;}if( alphabet_ind < 0){alphabet_ind = 25;}PORTA = seg_num[seg_num_ind];if ( seg_num_ind < 5 ){//시간제한이 5초 미만이면 깜빡이게DDRA = 0x80;}time_over_check(); //타임 오버 체크switch(life_count){ //실패했을시 라이프 LED 감소case 8: DDRB = 0xfe; break;case 7: DDRB = 0xfc; break;case 6: DDRB = 0xf8; break;case 5: DDRB = 0xf0; break;case 4: DDRB = 0xe0; break;case 3: DDRB = 0xc0; break;case 2: DDRB = 0x80; break;case 1: DDRB = 0x00; break;case 0: DDRG = 0x07; break;}}#pragma interrupt_handler int0_isr:iv_INT0 //이버튼은 한번만 눌러야 중복이 안됨, 정답 모두다 맞췄을때를 여기다 넣어야break;}}*/}#pragma interrupt_handler int4_isr:iv_INT4 //레벨 조정 모드void int4_isr(void){/* int i;init_lcd();while(1){delay_ms(500);for(i = 0; i < 16; i++){write_instruction(0x80+i);write_data(level_select_mode[0+i]);}if( (PINE & 0x02) != 0x02) {word_ind++;}if( (PINE & 0x04) != 0x04) {word_ind--;}if( (PINE & 0x08) != 0x08) {init_lcd();break;}if (word_ind < 0){word_ind = 8;}if (word_ind > 8){word_ind = 0;}write_instruction(0xc0);write_data('L');write_instruction(0xc1);write_data('V');write_instruction(0xc2);write_data('L');write_instruction(0xc3);write_data(':');write_instruction(0xc4);write_data(word_ind+0x30);}underbar_make();*/}#pragma interrupt_handler int5_isr:iv_INT5 //힌트void int5_isr(void){/* int i, o;init_lcd();while(1){for(i = 0; i < 16; i++){write_instruction(0x80+i);write_data(hint[0+i]);}for(i = 0; word_hint[word_ind][0+i] != 0; i++){write_instruction(0xc0+i);write_data(word_hint[word_ind][0+i]);}delay_ms(2000);o++;if(o > 3){ //자동 종료init_lcd();break;}}*/}#pragma interrupt_handler 세기위해}else {count++;//1000이 아직 아니면 계속 오버플로우 발생 카운트 증가}}void compare_word(void){int i, j = 0;for(i = 0; word_level[word_ind][i] != 0; i++){if(word_level[word_ind][i] == imsi_answer){_chk = 1;CLCD[i+1] = word_level[word_ind][i];SUCCESS++;SUCCESS_count++; //성공횟수 추가failed_ind = 'N';}}if(SUCCESS == 0){ //일치하는 횟수가 0이면 실패failed_ind = 'Y';failed_count++; //실패횟수 추가}}void time_over_check(void){int i, o;if( seg_num_ind == 0 ){delay_ms(1000);while(1){for(i = 0; i < 16; i++){write_instruction(0x80+i);write_data(time_over[0+i]);}for(i = 0; i < 8; i++){write_instruction(0xc0+i);write_data(time_over[16+i]);write_instruction(0xb0+i);write_data(time_over[24+i]);}delay_ms(2000);o++;if(o > 5){ //자동 종료init_lcd();break;}}life_count--;scaffold();seg_num_ind = 10; //타임 초기화}game_over_check(); //게임 오버 체크(시간으로)}void underbar_make(void){int i;for(i = 0; word_level[word_ind][i] != 0; i++){ //단어에 맞게 언더바 재생성CLCD[i+1] = '_';}CLCD[0] = '';length_count = i;//달라진 단어길이에 맞게 재수정for(i; i < 8; i++){ //남는공간 null 로 넣기CLCD[i+2]delay_ms(1000);if(i > 3){ //자동 종료init_lcd();break;}}}if( life_count == 3){while(1){write_instruction(0x80);write_data('-');write_instruction(0x81);write_data('-');write_instruction(0x82);write_data('-');write_instruction(0x83);write_data('-');write_instruction(0x84);write_data('|');write_instruction(0xc4);write_data('|');i++;delay_ms(1000);if(i > 3){ //자동 종료init_lcd();break;}}}if( life_count == 2){while(1){write_instruction(0x80);write_data('-');write_instruction(0x81);write_data('-');write_instruction(0x82);write_data('-');write_instruction(0x83);write_data('-');write_instruction(0x84);write_data('|');write_instruction(0xc4);write_data('|');write_instruction(0xc3);write_data('o');i++;delay_ms(1000);if(i > 3){ //자동 종료init_lcd();break;}}}if( life_count == 1){while(1){write_instruction(0x80);write_data('-');write_instruction(0x81);write_data('-');write_instruction(0x82);write_data('-');write_instruction(0x83);write_data('-');write_instruction(0x84);write_data('|');write_instruction(0xc4)*/

공학/기술| 2015.12.26| 23페이지| 3,000원| 조회(1,214)

C언어, 마이크로프로세서, 행맨, atmega128, ATmega, hangman, 빵판

미리보기

닫기