조회 수 999 추천 수 0 댓글 0

#include <stdio.h>
#include <stdlib.h>
#include <conio.h>
void show(int arr[10][10])
{
     system("cls");
     int i,j;
     for(i=0;i<10;i++)
    { 
       for(j=0;j<10;j++)
       {  
           printf("%c ",arr[i][j]);
         
       }
        printf("\n");
    }  
}

void changij(int arr[10][10], int pi, int pj)            {
    
    
    
    
    
    
    
 }//changij
int main(void)
{
    char eat=' ';
    char inwall=' ';
    char point=15;
    int arr[10][10]={
        {eat,eat,eat,eat,eat,eat,eat,eat,eat,eat},
        {inwall,eat,eat,eat,inwall,eat,eat,eat,eat,eat},
        {inwall,eat,inwall,eat,inwall,eat,eat,eat,inwall,eat},
        {inwall,eat,eat,eat,inwall,eat,eat,inwall,eat,eat},
        {inwall,eat,inwall,eat,inwall,inwall,eat,eat,inwall,eat},
        {eat,eat,inwall,eat,eat,eat,eat,eat,inwall,eat},
        {eat,inwall,inwall,inwall,eat,inwall,inwall,eat,inwall,eat},
        {eat,eat,inwall,eat,eat,inwall,inwall,inwall,inwall,eat},
        {inwall,eat,inwall,inwall,eat,eat,eat,inwall,eat,eat},
        {inwall,inwall,inwall,inwall,inwall,inwall,eat,eat,eat,inwall}
        };
       
       
    inwall='*';
    int i=0, j=0;
    int pi=0, pj=0;
    char ch=-32;
    char store=eat;
    char wall=inwall;
    char oldch=14;
    int k=0;
    arr[pi][pj]=point;
    show(arr);
   
    for(;;)
    {
        if(ch!=-32)
        oldch=ch;
       
        ch=getch();
       
        if(ch==-32)
        continue;

        if((ch=='l' || ch==77) && pj<9)
        {
             point=62;      
            
             if(ch==oldch)
             {
                 if(k==1)
                 {    
                       if(pi==0)
                       arr[pi][pj]=22;
                       else if(pi==9)
                       arr[pi][pj]=21;
                       else
                       arr[pi][pj]=16;
                
                 }
                 else
                 arr[pi][pj]='-';
                
                 store=arr[pi][pj+1];
                    
                     if(store==wall);
                     else
                     pj++;
                     if(store==' ' || store=='-')
                     k=0;
                     else
                     k=1;
                                         
                
             }//move

         }//(ch=='l' || ch==77) && pj<9


        if((ch=='j' || ch==75) && pj>0)
        {
             point=60;
             if(ch==oldch)
             {  
                 if(k==1)
                 {   
                      if(pi==0)
                      arr[pi][pj]=22;
                      else if(pi==9)
                      arr[pi][pj]=21;
                      else
                      arr[pi][pj]=16;
                 }
                 else
                 arr[pi][pj]='-';
                 store=arr[pi][pj-1];
                    
                     if(store==wall);
                     else
                     pj--;
                     if(store==' ' || store=='-')
                     k=0;
                     else{
                     //printf("걸림");
                     //system("pause");
                     //arr[pi][pj]=16;
                     k=1;
                     }
             }//move
        }//if
        if((ch=='i' || ch==72) && pi>0)
        {
             point=30;
             if(ch==oldch)
             {   if(k==1)
                 {    
                       if(pj==0)
                       arr[pi][pj]=25;
                       else if(pj==9)
                       arr[pi][pj]=23;
                       else
                       arr[pi][pj]=16;
                 }
                 else
                 arr[pi][pj]='|';
                 store=arr[pi-1][pj];
                    
                     if(store==wall);
                     else
                     pi--;
                     if(store==' ' || store=='|')
                     k=0;
                     else{
                     //printf("걸림");
                     //system("pause");
                     //arr[pi][pj]=16;
                     k=1;
                     }
             }//move
        }//if 
        if((ch=='k' || ch==80) && pi<9)
        {
             point=31;
             if(ch==oldch)
             {   if(k==1)
                 {
                      if(pj==0)
                      arr[pi][pj]=25;
                      else if(pj==9)
                      arr[pi][pj]=23;
                      else
                      arr[pi][pj]=16;
                 }
                 else
                 arr[pi][pj]='|';
                 store=arr[pi+1][pj];
                    
                     if(store==wall);
                     else
                     pi++;
                     if(store==' ' || store=='|')
                     k=0;
                     else{
                     //printf("걸림");
                     //system("pause");
                     //arr[pi][pj]=16;
                     k=1;
                     }
             }//move       
        }//if            
       
       
        arr[pi][pj]=point;
        show(arr);         
         
         
          }//for

   
   
   
   
    system("pause");
    return 0;
}



List of Articles
번호 제목 글쓴이 날짜 조회 수
공지 글쓰기는 하루 5개, 댓글은 10개만 가능합니다. 좋은아빠되기 2019.02.15 518
공지 키보드 화살표값 출력 좋은아빠되기 2016.11.19 1281
공지 원하는 좌표에 값 출력하기 좋은아빠되기 2016.11.19 2602
공지 Python(파이썬) 학습 자료 PDF 1 file 좋은아빠되기 2014.12.10 10582
공지 dev C++ 텍스트 색상변경 WinApi사용(textcolor 대용) 좋은아빠되기 2014.06.07 4939
공지 DEV-C++ 기본 코드 좋은아빠되기 2013.06.19 8524
공지 무료 C++ 컴파일러(윈도우용) DEV-C++ 좋은아빠되기 2013.06.18 19163
공지 이클립스 C++ 설치 파일들 좋은아빠되기 2013.06.18 38072
450 정올 배열1 형성평가9 정승준 2018.09.15 101
449 정올 배열2 형성평가9 정승준 2018.12.01 101
448 정올 배열2 자가진단3 정승준 2018.10.27 103
447 123 : 선택제어문 - 형성평가4 adbdcd123 2018.08.25 104
446 정올 배열1 자가진단5 정승준 2018.09.01 105
445 정올 배열2 자가진단7 정승준 2018.11.10 105
444 정올 배열2 형성평가A 정승준 2018.12.01 105
443 정올 - 문제은행 - 생성 불능 숫자(1184) 조정미 2018.06.23 106
442 반복문 몇번 하는지 초기치(승민) 승민 2016.03.05 108
441 정올 반복제어문3 자가진단6 정승준 2018.08.18 108
440 정올 반복제어문3 자가진단7 정승준 2018.08.25 108
439 536 : 반복제어문1 - 자가진단1 adbdcd123 2018.08.25 108
438 제어문 연습(완성) 선우 2016.03.12 109
437 정올 반복제어문3 형성평가5 정승준 2018.08.25 109
436 배열 3가지 선우 2016.03.19 110
435 121 : 선택제어문 - 형성평가2 adbdcd123 2018.08.25 110
434 정올 배열1 자가진단1 정승준 2018.09.01 113
433 정올 배열1 형성평가1 정승준 2018.09.08 114
432 함수(승민) 승민 2016.08.06 115
431 전전항-전항 계속해서 음수나올때까지 구하기(승민) 승민 2016.05.28 116
Board Pagination Prev 1 2 3 4 5 6 7 8 9 10 ... 26 Next
/ 26