![¡ù????
??? ??
??? ??? ?? ?????. ??? ?? ???? ? ???? ?? ???. ?, ??
? ??? ?? ? ???? ?? ??? ?? ?? ?? ??, ??? ??? ?? ??
?? ??? ???. ??? ??? LIFO(Last In First Out)??? ? ???.
??? ???? ??(????? ???.) ? ???? ????. ??? ??? ?? ?
? ?? ??? push
push?? ?? ??? ???? ?? ??? pop ?????. ? ???
?? ?? ??? ? ????.
??? ?? ????
??? ???? ??? ???? ?? ?? ??? ?? ??? ???. ?? ??? ?
?? ?? ?? ??? ??? ???? ??? ??? top??? ?? ???? ????
???.
??? ??? ?? ??? ?? ??? ?? ??? ???. ?? 10??? ?????.
??? ??? ???? ?????? ???? ??? ?? ?? ? ? ????.
#define MAXSIZE 10 // ??? ?? ??
int stack[MAXSIZE]; // ??? ? ?
int top; // ??? ??
??? top? ??? ??? ??? ???. ?? ??? top? ??? ?? ? ????
??? ? ?, ?, ??? ??? ??? ?? ??? ????? ???. ???? ?? ?
? ???? ???? ??? ??????. ??? ?? ? ? ??? ? ??? ????
????? ??, ?????? ????.
???, ????? ?? ? ?, ???? ??, ?, ???? ??? ?? ?? ? ???
?? ?? ??? ?? ???.
??, ??? ?? ?? ?? top? -1? ?? ??? ???. C?? ??? ???? 0
?? ?????, top? 0??? ??? ???? ?? ??? ?????. ??? ???
? ??? ?? ??? ????? ?? ???? ??? ??? ??? ??? top? -1
? ???? ???.
push? ???? ?? ??? ??? push? ?? ??? val??? ?? ???? ???
????. ? ? push? top? ?? ????? ??? ??? top? val? ??? ???.
???, ?? ?????? ??? ???? ??? push? ?? ?? ??? ???? ?
??. ?? ?? ?????(Stack Overflow)?? ???. ???? ??? ???? top?](https://image.slidesharecdn.com/project2hwp-13410074880976-phpapp02-120629170537-phpapp02/85/Project-2-Hwp-7-320.jpg)
![MAX-1? ??? ? ??? ???? ????? ?? ??? ?? ???.
[[ ??? ?? ]]
????? ??? ???? ?? ???? ??? ?? ????.
???? ?? ???? ?? ?? ??? ?? ??? ?? ??? ?? ??? ??? ?? ? ?
?? ?? ??? ?? ?????
?? ??? ?? ??? ?? ???? ??? ?? ??? ? ?? ??? ??? ??? ? ??
? ????? ??? ??? ??.
??? ??? ?? ??? ??? ?? ???? ? ?? ?? ??? ???? ???? ??? ?
?? ??? ???.
? ? ???? ??? ????? ?? ???? ??? ???? ?? ?? ???? ???? ?
? ???? ?? ??? ????.
??? ?? ??? ??? ???? ?? ? ? ???? ?? ??? ??? ?? ?? ? ?? ?
??? ?? ??? ??? ????
?? ??? ???? ??? ????? ? ??? ???? ???? ? ?? ?? ??? ???
?? ?? ??? ??? ????.
?? ?? ???? ???? ???? ????? ?? ??? ?? ??? ? ??? ???.
?? ??
?? ??? ??? ??? ?? ???, ????? ????. ?? ??? ????, ?
?? ?? ? ?? ?? ???? ??? ???. ? ?? ??? ??? ???? ???
????. ?, ?? ??? ?? ?? ??? ??? FIFO(First In First Out)??? ???
?.
?? ??? put
put? get
get? ????. ?? ??? ?? ?? ?? ?(rear)?? ????,
rear
?? put
put??? ???. ??? ??? ??? ?? ?? ?(front)?? ???? ?? get
front
??? ???.
??? ? ????
??? ??? ?? ??? ??? ??? ??? ???? ? ???, ?? ? ????
? ??? ?? ????. ?? ??? ??? ?? ?? ???? ??? ???? ??
??? ??? ?????.
#define MAXSIZE 10 // ?? ??
int queue[MAXSIZE];
int front=-1, rear=-1;
???? put? get ??? ??? ?????.
int put (unsigned int val) {](https://image.slidesharecdn.com/project2hwp-13410074880976-phpapp02-120629170537-phpapp02/85/Project-2-Hwp-8-320.jpg)
![if (rear >= MAXSIZE-1) {
printf (" Queue Overflow");
return (-1);
}
queue[++rear] = val;
}
int get () {
if (front <= 0) {
printf (" Queue Underflow");
return -1;
}
return queue[front++];
}
??? ???? ???? front? rear? ? ????? ?? ????? ???. ?? ?
?? ??? ? ?? rear? ??? ??? ?? ??? put??? Overflow??? ???
? ? ????. ???? rear? ??? ??? ???? ?? ?? ???? ??? ??
??? ??? ??? ???? ???.
int put (unsigned int val) {
if (rear >= MAXSIZE-1) {
if (!(rear-front)) {
return -1;
}
// ??? ??? ??? ??? ??.
memcpy (&queue[0], &queue[front], rear-front+1);
rear=rear-front;
front = 0;
}
queue[++rear] = val;
}
??? ??? ??? 10?? ?? ??? ??? 5????? ?? ??? ??? put?
??? ?????? ??? ???????.
??? ?????? ?????. ?? (?? ??) ?(Circular Queue)? ???? ???
?. ?? ?? ?? ??? ?? ?? ?? ??? ??? ????. ???? ???? ?
??? ??? ???? ??? ????. ?? ??? ???.
[[ ?? ?? ]]
?? ??? ??? ????? ???? ???, ?? ??? ?? ???? ??? ?? ??? ?
??? ???? ????.
?? ????? ??? ????? ?? ?? ?? ?? ??? ??? ????? ?? ?????
???? ?? ?? ???.
??? ??? ???? ?? ??? ??? ?? ???? ?? ????? ???? ?? ???
??? ?? ?? ???.
?? ???? ??? ??? ?? ???? ?? ??? ??? ?? ??? ????? ??? ?
??? ?? ??? ????
?? ??? ???? ??? ??? ??? ??? ?? ??? ??? ???? ??? ????.
??? ?? ?? ?? ??? ??.
???? ?? ??? ????. ??? ?? ?? ???? ?? ??? ?? ?? ? ?? ???
?? ???? ???.](https://image.slidesharecdn.com/project2hwp-13410074880976-phpapp02-120629170537-phpapp02/85/Project-2-Hwp-9-320.jpg)
![<??? ?? ??>
?? ? ????, ?? infix? postfix? ??? ??? ??.
??? ?? ????. ??? infix? postfix? ??? ???? ???? ?? ????.
????? ??? ??.
? ???? ????? [ ?? < +,- < *,/ ] ? ???.
1. '(' ? ??? ??? ????. (?? => ??)
2. ')' ? ??? ???? '('? ????? ??? ?? ?? '('? ??? ???.
3. ???? ??? ???? ? ????? ?? ????? ???? ?? ??? ??
? ?? ?? ??? ????.
4. ????? ?? ?? ???.
5. ?? ??? ??? ??? ?? ????? ?? ??? ????.
?) (2*(3+6/2)+2)/4+3
?? ? ??(??->??) ??
( (
'(' ??? ?? (??)
2 2 (
??? ??? ??
* 2 * ( '*'
? '('??????? ??
( 2 ( * ( '('
? ??? ??( ??)
3 2 3 ( * ( ??
? ??? ??
+ 2 3 + ( * ( '+'?
'('?? ????? ??
6 2 3 6 + ( * ( ??
? ??? ??
/ 2 3 6 / + ( * ( '/'?
'+'?? ????? ??
2 2 3 6 2 / + ( * ( ??
? ??? ??
) 2 3 6 2 / + * ( '('??
? ??? ??,'('???
+ 2 3 6 2 / + * + ( '*' ?
'+' ?? ???? ?
2 2 3 6 2 / + * 2 + ( ???
??
) 2 3 6 2 / + * 2 + '(' ?? ?
?? ??
/ 2 3 6 2 / + * 2 + / ????
??(??)](https://image.slidesharecdn.com/project2hwp-13410074880976-phpapp02-120629170537-phpapp02/85/Project-2-Hwp-13-320.jpg)
![¡ù??
#include <stdio.h>
#include <stdlib.h>
#define ROW_SIZE 10
#define COL_SIZE 9
#define NUM_WAYS 8
typedef int board_t[ROW_SIZE][COL_SIZE];
int dr[NUM_WAYS] = {-2,-1,1,2,2,1,-1,-2};
int dc[NUM_WAYS] = {1,2,2,1,-1,-2,-2,-1};
void initialize_board(board_t board)
{
int i,j;
for(i=0;i<ROW_SIZE;i++)
{
for(j=0;j<COL_SIZE;j++)
{
board[i][j] = -1;
}
}
}
void print_board(board_t board)
{
int i,j;
for(i=0;i<ROW_SIZE;i++)
{
for(j=0;j<COL_SIZE;j++)
{
printf("%dt",board[i][j]);
}
printf("n");
}
}
int is_inside_board(int r, int c)
{
return r>=0 && r<ROW_SIZE && c>=0 && c<COL_SIZE;
}
int is_available(board_t board, int r, int c)
{](https://image.slidesharecdn.com/project2hwp-13410074880976-phpapp02-120629170537-phpapp02/85/Project-2-Hwp-17-320.jpg)
![return is_inside_board(r,c) && board[r][c] == -1;
}
int num_next_moves(board_t board, int r, int c)
{
int i,result=0;
for(i=0;i<NUM_WAYS;i++)
{
if(is_available(board,r+dr[i],c+dc[i]))
{
result++;
}
}
return result;
}
int next_way_of(board_t board, int r, int c)
{
int i, min = NUM_WAYS, result=0;
for(i=0;i<NUM_WAYS;i++)
{
if(is_available(board, r+dr[i], c+dc[i]) &&
num_next_moves(board,r+dr[i],c+dc[i])<min)
{
min=num_next_moves(board,r+dr[i],c+dc[i]);
result=i;
}
}
return result;
}
int main()
{
int r,c,move,next_way;
board_t board;
initialize_board(board);
while(1)
{
printf("input start position r(0~9) c(0~8): ");
scanf("%d %d",&r, &c);
fflush(stdin);
if(is_inside_board(r,c))
{
break;
}
printf("Please put them again.n");
}
board[r][c] = 0;](https://image.slidesharecdn.com/project2hwp-13410074880976-phpapp02-120629170537-phpapp02/85/Project-2-Hwp-18-320.jpg)
![for(move=1;move<ROW_SIZE*COL_SIZE;move++)
{
if(num_next_moves(board,r,c)==0)
{
printf("Failed.n");
print_board(board);
system("pause");
return 1;
}
next_way = next_way_of(board,r,c);
r=r+dr[next_way];
c=c+dc[next_way];
board[r][c]=move;
}
print_board(board);
system("pause");
return 0;
}](https://image.slidesharecdn.com/project2hwp-13410074880976-phpapp02-120629170537-phpapp02/85/Project-2-Hwp-19-320.jpg)
![¡ù????
#include <stdio.h>
#define STACK_SIZE 8
#define JANG_GI 89
int stack2[STACK_SIZE];
int po[STACK_SIZE47];
void position(int a){
int n, n1=0;
stack2[0] = a-21;
stack2[1] = a-19;
stack2[2] = a-12;
stack2[3] = a-8;
stack2[4] = a+8;
stack2[5] = a+12;
stack2[6] = a+19;
stack2[7] = a+21;
for(n=0; n<STACK_SIZE; n++){
if(stack2[n]<=0&&stack2[n]>=89){
if(stack2[n]%10==a%10-2||stack2[n]%10==a%10+2||stac
k2[n]%10==a%10+1||stack2[n]%10==a%10-1){
po[n1]=stack2[n];
n1++;
}
}
}
}
void stack(int a){](https://image.slidesharecdn.com/project2hwp-13410074880976-phpapp02-120629170537-phpapp02/85/Project-2-Hwp-21-320.jpg)
![int stack1[JANG_GI], stack3[JANG_GI];
int count=0, count1, top;
int k;
for(;;){
if(top==89){
break;
}
stack1[count]=a;
stack3[count]=a;
count++;
top++;
position(a);
for(count1=0; count1<=top; count++){
if(po[0]!=stack1[count1]){
a=po[0];
break;
}
else if(po[1]!=stack1[count1]){
a=po[1];
break;
}
else if(po[2]!=stack1[count1]){
a=po[2];
break;
}
else if(po[3]!=stack1[count1]){
a=po[3];
break;
}
else if(po[4]!=stack1[count1]){
a=po[4];
break;
}](https://image.slidesharecdn.com/project2hwp-13410074880976-phpapp02-120629170537-phpapp02/85/Project-2-Hwp-22-320.jpg)
![else if(po[5]!=stack1[count1]){
a=po[5];
break;
}
else if(po[6]!=stack1[count1]){
a=po[6];
break;
}
else if(po[7]!=stack1[count1]){
a=po[7];
break;
}
else{
top--;
count=top;
k=stack1[count+1]-stack3[count];
for(count1=0; count1<STACK_SIZE; count1++){
if(stack2[count]==k){
a = stack3[count]+stack2[count+1];
}
else{
break;
}
}
}
}
}
}
int main(){
int x, y, good;
int coor;
printf("input x:");](https://image.slidesharecdn.com/project2hwp-13410074880976-phpapp02-120629170537-phpapp02/85/Project-2-Hwp-23-320.jpg)
![scanf("%d", &x);
printf("input y:");
scanf("%d", &y);
coor = x*10+y;
stack(coor);
for(good=0; good<90; good++){
printf("<");
printf("%d", stack1[good]/10);
printf(",");
printf("%d", stack1[good]%10);
printf(">");
}
return 0;
}](https://image.slidesharecdn.com/project2hwp-13410074880976-phpapp02-120629170537-phpapp02/85/Project-2-Hwp-24-320.jpg)
Project#2???? Hwp
- 1. ????01 ?? ???? #2 ?( )? ?? ?? : 09 ??? ?? : 09 ??? 11 ??? 11 ??? 11 ???
- 2. -Index- -??? ?? -???? -??? -???? -???? -?? -??? & ???? -???? -???? -???? ? ??
- 3. ¡ù????? 09??? ?? : ????? ? ??? ??, ?? ?? 09??? ???? ?? ? ????? 11??? ???? ?? ? ????? 11??? ???? ?? ? ???? ?? 11??? ???? ?? ? ???? ?? ¡ù???? 3?27? ???? ? ???? 3?29? ???? ?? ? ?? 4? 3? ???? ?? ??? ?? ???? ?? ? ???? 4? 7? ?? ???? ?? ? ?? ??? ??
- 4. ¡ù??? ???? 2012? 3? 27?(?) ? C1 ??? 09??? ??? 09???, 09???, 11???, 11???, 11??? ?? ?? 1.??? ???? ??? ?????? 2?, ???? ?? 2??? ?? ????. 2.?? ?? ?? ?????? ??? ?? ??? ??? ?? ?? ??? ??? ??? ? ? ?? ????? ? 3.??? ?? ???? ???????? ? ???? ??? ???? ??? ???? ????? ?. ??? ???? ??? ?? ????? ?. 4.???? ?? ?? ????? ?? ?? ??? ??? ??? ?? ??? ????? ? ? ??? ?? ????? ?.
- 5. ???? 2012? 3? 29?(?) ? C1 ??? 09??? ??? 09???, 09???, 11???, 11???, 11??? ?? ?? 1.??? ?? ?? ?? ?? ??? ?? ??? ???? ???? ????? ?? ???? ? ????? ??? ?? ???. 2.?? ?? ????? ??? ?????? ??? ??? ? ??? ??? ????? ? ???? ?. 3.??? ??/??? ?? ???? ??, ?, ????? ??? ??? ?? ??? ??? ????? ???? ? ??? ?? ?? ??? ??? ? ??. ???? ?? ??? ????? ??, ?, ????? ??? ????? ?? ?? ????? ??? ???? ??. 4.??? ?? ?? ?? ??? ???? ?????? ? ??? ???? ??? ????, ?? ?? ??? ???? ???? ???? ??? ??? ???? ???.
- 6. ???? 2012? 4? 3?(?) ? C1 ??? 09??? ??? 09???, 09???, 11???, 11???, 11??? ?? ?? 1.??? ?? ?? ???? ???? ??? ?? ? ????, ????? ??? ?? ???? ? ???. 2.?? ?? ?? ?? ??? ?? ??? ??? ????? ??? ??? ????? ? ???? ???? ??? ?. 3.??? ?? / ??? ?? ??? ???? ?? ??? ???? ???? ???? ?? ?? ??? ? ???? ?? ??? ??? ?. 4.??? ?? ?? ?? ??? ?? ?? ???? ?? ??? ? ?????? ???? ?? ? ?? ?? ?? ????? ?? ??? ?
- 7. ¡ù???? ??? ?? ??? ??? ?? ?????. ??? ?? ???? ? ???? ?? ???. ?, ?? ? ??? ?? ? ???? ?? ??? ?? ?? ?? ??, ??? ??? ?? ?? ?? ??? ???. ??? ??? LIFO(Last In First Out)??? ? ???. ??? ???? ??(????? ???.) ? ???? ????. ??? ??? ?? ? ? ?? ??? push push?? ?? ??? ???? ?? ??? pop ?????. ? ??? ?? ?? ??? ? ????. ??? ?? ???? ??? ???? ??? ???? ?? ?? ??? ?? ??? ???. ?? ??? ? ?? ?? ?? ??? ??? ???? ??? ??? top??? ?? ???? ???? ???. ??? ??? ?? ??? ?? ??? ?? ??? ???. ?? 10??? ?????. ??? ??? ???? ?????? ???? ??? ?? ?? ? ? ????. #define MAXSIZE 10 // ??? ?? ?? int stack[MAXSIZE]; // ??? ? ? int top; // ??? ?? ??? top? ??? ??? ??? ???. ?? ??? top? ??? ?? ? ???? ??? ? ?, ?, ??? ??? ??? ?? ??? ????? ???. ???? ?? ? ? ???? ???? ??? ??????. ??? ?? ? ? ??? ? ??? ???? ????? ??, ?????? ????. ???, ????? ?? ? ?, ???? ??, ?, ???? ??? ?? ?? ? ??? ?? ?? ??? ?? ???. ??, ??? ?? ?? ?? top? -1? ?? ??? ???. C?? ??? ???? 0 ?? ?????, top? 0??? ??? ???? ?? ??? ?????. ??? ??? ? ??? ?? ??? ????? ?? ???? ??? ??? ??? ??? top? -1 ? ???? ???. push? ???? ?? ??? ??? push? ?? ??? val??? ?? ???? ??? ????. ? ? push? top? ?? ????? ??? ??? top? val? ??? ???. ???, ?? ?????? ??? ???? ??? push? ?? ?? ??? ???? ? ??. ?? ?? ?????(Stack Overflow)?? ???. ???? ??? ???? top?
- 8. MAX-1? ??? ? ??? ???? ????? ?? ??? ?? ???. [[ ??? ?? ]] ????? ??? ???? ?? ???? ??? ?? ????. ???? ?? ???? ?? ?? ??? ?? ??? ?? ??? ?? ??? ??? ?? ? ? ?? ?? ??? ?? ????? ?? ??? ?? ??? ?? ???? ??? ?? ??? ? ?? ??? ??? ??? ? ?? ? ????? ??? ??? ??. ??? ??? ?? ??? ??? ?? ???? ? ?? ?? ??? ???? ???? ??? ? ?? ??? ???. ? ? ???? ??? ????? ?? ???? ??? ???? ?? ?? ???? ???? ? ? ???? ?? ??? ????. ??? ?? ??? ??? ???? ?? ? ? ???? ?? ??? ??? ?? ?? ? ?? ? ??? ?? ??? ??? ???? ?? ??? ???? ??? ????? ? ??? ???? ???? ? ?? ?? ??? ??? ?? ?? ??? ??? ????. ?? ?? ???? ???? ???? ????? ?? ??? ?? ??? ? ??? ???. ?? ?? ?? ??? ??? ??? ?? ???, ????? ????. ?? ??? ????, ? ?? ?? ? ?? ?? ???? ??? ???. ? ?? ??? ??? ???? ??? ????. ?, ?? ??? ?? ?? ??? ??? FIFO(First In First Out)??? ??? ?. ?? ??? put put? get get? ????. ?? ??? ?? ?? ?? ?(rear)?? ????, rear ?? put put??? ???. ??? ??? ??? ?? ?? ?(front)?? ???? ?? get front ??? ???. ??? ? ???? ??? ??? ?? ??? ??? ??? ??? ???? ? ???, ?? ? ???? ? ??? ?? ????. ?? ??? ??? ?? ?? ???? ??? ???? ?? ??? ??? ?????. #define MAXSIZE 10 // ?? ?? int queue[MAXSIZE]; int front=-1, rear=-1; ???? put? get ??? ??? ?????. int put (unsigned int val) {
- 9. if (rear >= MAXSIZE-1) { printf (" Queue Overflow"); return (-1); } queue[++rear] = val; } int get () { if (front <= 0) { printf (" Queue Underflow"); return -1; } return queue[front++]; } ??? ???? ???? front? rear? ? ????? ?? ????? ???. ?? ? ?? ??? ? ?? rear? ??? ??? ?? ??? put??? Overflow??? ??? ? ? ????. ???? rear? ??? ??? ???? ?? ?? ???? ??? ?? ??? ??? ??? ???? ???. int put (unsigned int val) { if (rear >= MAXSIZE-1) { if (!(rear-front)) { return -1; } // ??? ??? ??? ??? ??. memcpy (&queue[0], &queue[front], rear-front+1); rear=rear-front; front = 0; } queue[++rear] = val; } ??? ??? ??? 10?? ?? ??? ??? 5????? ?? ??? ??? put? ??? ?????? ??? ???????. ??? ?????? ?????. ?? (?? ??) ?(Circular Queue)? ???? ??? ?. ?? ?? ?? ??? ?? ?? ?? ??? ??? ????. ???? ???? ? ??? ??? ???? ??? ????. ?? ??? ???. [[ ?? ?? ]] ?? ??? ??? ????? ???? ???, ?? ??? ?? ???? ??? ?? ??? ? ??? ???? ????. ?? ????? ??? ????? ?? ?? ?? ?? ??? ??? ????? ?? ????? ???? ?? ?? ???. ??? ??? ???? ?? ??? ??? ?? ???? ?? ????? ???? ?? ??? ??? ?? ?? ???. ?? ???? ??? ??? ?? ???? ?? ??? ??? ?? ??? ????? ??? ? ??? ?? ??? ???? ?? ??? ???? ??? ??? ??? ??? ?? ??? ??? ???? ??? ????. ??? ?? ?? ?? ??? ??. ???? ?? ??? ????. ??? ?? ?? ???? ?? ??? ?? ?? ? ?? ??? ?? ???? ???.
- 10. ??? ?? ?? ?? ???? ???? ?? ???? ?? ??? ?? ???. ???? ???? ??? ?? ??? ??? ?? ????? ??????. ?, ?? ????? ???? ??? ??? ?? ?????? ????? ??? ?? ?. ???? ??? ??????? ??? ???, ?? ??? ??? ??? ?? ?? ? ?? ? ??? ?? ?? ????. ???? ??? ?? ????, ?? ??? ????, ?? ??? ?? ?? ?? ?? ?. ?? ?? ?? ?? ???? ??? ???. (1? ???, ??? ??? ??) ?? ??? ??? ?? ?? ???, ??? ?? ??? ??? ?? ?? ?? ??? ??? ??????. 1-2-3-4-5-6-7-8-9 ? ?? ???? ??? ?, ? ?? ??? ?? ??? ???? ?? ???? ?? ???? ?? ??? ???? ??? ??? ?? ????. ???? ??? ?? ??? ??? ?? ????? ??????. ?, ?? ????? ???? ??? ??? ?? ?????? ????? ??? ?? ?. ???? ??? ??????? ??? ???, ?? ??? ??? ??? ?? ?? ? ?? ? ??? ?? ?? ????. ???? ??? ?? ????, ?? ??? ????, ?? ??? ?? ?? ?? ?? ?. ?? ?? ?? ?? ???? ??? ???. (1? ???, ??? ??? ??) ?? ??? ??? ?? ?? ???, ??? ?? ??? ??? ?? ?? ?? ??? ??? ??????.
- 11. infix, prefix, postfix. (?????, ?????, ?????) ???? ??? infix??. ?, ???? ????(????? ??)? ???? ??? ????. a + 1? ?? ?? ??. ??? ?? ?? ???? ????. + a 1? ?? ???? ????? ?? ??? prefix?? ??. ??? a 1 +? ?? ??? ??? postfix?? ??. ?? infix? prefix or postfix ? ??? ?? ????. ?? infix?? ?? ????. 1 + ( a + 2 ) * 5 / 7 ????? ? ???. ? ??? ?? ? ?? ?? ??? ????. ( 1 + ( ( ( a + 2 ) * 5 ) / 7 ) ) ???? ??? ??? ?? ???. ?? ????? ?? ????. ??? ??? ??, ? ?? ??? ?? "???? + ??? + ????" ? ??? ?? ??? ???. ? ??? ???? ???? ?? ???. ( 1 + ( ( ( a 2 )+ * 5 ) / 7 ) ) ( 1 + ( ( ( a 2 )+ 5 )* / 7 ) ) ( 1 + ( ( ( a 2 )+ 5 )* 7 ) / ) ( 1 ( ( ( a 2 )+ 5 )* 7 ) / ) + ? ???? ?? ??? ?? ?? ??? ?? ?? ???. ?? ??? ??? ??? ?? ?????. 1 a 2 + 5 * 7 / + ?? ?? ??? ?? ????, ?? ??? ??? ? ??? ??? ?? ??? ? ??? ??? ?? ??? ?? ??? ??. ???? ??? ???? ??? ??? ?? ?? ???? ?? ???. + : a + 2 * : (a + 2 ) * 5 / : (a + 2 ) * 5 / 7 + : 1 + ( a + 2 ) * 5 / 7 ? ??. ???? prefix?? ?? ???? ???? ??? ?? ??. prefix? ???? ??? ??????? ???? ??? ??? ???? ???? ?? ? ???? ??.
- 12. ?? ??? ???? ??? ?????? ?? ? ???. ?? ??? ????. postfix?? ???? ??? ???? ??? ????? ?? ??? ?? ?????, prefix??? ??? ??? ?? ? ??? ????? ???? ??? ????? ?? ? ?? ?? ???? ?? ??? ?? ?? ?? ?? ??. ?? ?? ? ?? ????... ( a + b ) * c + d * k ?? ????? ? ???. ??? ???. ( ( ( a + b ) * c ) + ( d * k ) ) ?? ??. ( ( + ( a b ) * c ) + ( d * k ) ) ( * ( + ( a b ) c ) + ( d * k ) ) ( * ( + ( a b ) c ) + * ( d k ) ) + ( * ( + ( a b ) c ) * ( d k ) ) ?? ??... + * + a b c * d k ? ??. ?? ??? ????. ???? ???? ???? ??? ???? ??. ??? ??? ?? ????. + * + a : b -> + * ( a + b ) // 3?? ???? 1?? ????? ??? ??? ??? ???? ?? + * ( a + b ) : c -> + ( ( a + b ) * c ) + ( ( a + b ) * c ) : * -> + ( ( a + b ) * c ) * + ( ( a + b ) * c ) * : d -> + ( ( a + b ) * c ) * d + ( ( a + b ) * c ) * d : k -> + ( ( a + b ) * c ) (d * k) - > ( ( a + b ) * c ) + (d * k) ? ??~ ? ???? ????? ??? ??? ?. <?? ??> ?? ?? ?? ?? ??? ???? ?? ???? ?? ????. ?? ?? ??? ?? prefix, ?? ??? ?? postfix ?? ??? ?? infix? ??. ??? ???, ??? ???? ????.
- 13. <??? ?? ??> ?? ? ????, ?? infix? postfix? ??? ??? ??. ??? ?? ????. ??? infix? postfix? ??? ???? ???? ?? ????. ????? ??? ??. ? ???? ????? [ ?? < +,- < *,/ ] ? ???. 1. '(' ? ??? ??? ????. (?? => ??) 2. ')' ? ??? ???? '('? ????? ??? ?? ?? '('? ??? ???. 3. ???? ??? ???? ? ????? ?? ????? ???? ?? ??? ?? ? ?? ?? ??? ????. 4. ????? ?? ?? ???. 5. ?? ??? ??? ??? ?? ????? ?? ??? ????. ?) (2*(3+6/2)+2)/4+3 ?? ? ??(??->??) ?? ( ( '(' ??? ?? (??) 2 2 ( ??? ??? ?? * 2 * ( '*' ? '('??????? ?? ( 2 ( * ( '(' ? ??? ??( ??) 3 2 3 ( * ( ?? ? ??? ?? + 2 3 + ( * ( '+'? '('?? ????? ?? 6 2 3 6 + ( * ( ?? ? ??? ?? / 2 3 6 / + ( * ( '/'? '+'?? ????? ?? 2 2 3 6 2 / + ( * ( ?? ? ??? ?? ) 2 3 6 2 / + * ( '('?? ? ??? ??,'('??? + 2 3 6 2 / + * + ( '*' ? '+' ?? ???? ? 2 2 3 6 2 / + * 2 + ( ??? ?? ) 2 3 6 2 / + * 2 + '(' ?? ? ?? ?? / 2 3 6 2 / + * 2 + / ???? ??(??)
- 14. 4 2 3 6 2 / + * 2 + 4 / ??? ? ? + 2 3 6 2 / + * 2 + 4 / + '/'? '+'?? ??? ????'+'??? 3 2 3 6 2 / + * 2 + 4 / 3 + ??? ? ? ? 2 3 6 2 / + * 2 + 4 / 3 + ???? ?? ?(??) ?? ?? ?? ??? ??(dequeue)??? ??? ???? ?? ??? postfix???? ??? ?? ??.
- 15. ¡ù???? 1)??? ??? ??? ???? ??. ¢Ù?? ?? x, y? ????. ¢Úx*10+y? ?? ? ??? ??? ??? 1? ??? ???? 0?? ?????. ¢Û? ? ? ??? 1? ???? ??? ???. ¢Ü??? ? ?? ???? ???. ¢Ý??? ? ?? ?? ?? ??? ????? ?? ?? ??? ????. ¢Þ????. ¢ß???? ??? ??? 89?? ????? ???? ????. 1-1)??? ??? ??? ???? ??(??). ¢Ù?? ?? x, y? ????. ¢Úx*10+y? ?? ? ??? ??? ???. ¢Û?? ??? ??? stack ??? ???. ¢Ü??? ? ?? ???? ???. ¢Ü?? ?? ???? ?? ??? ? ??? ???. ¢Þ?? ??? ???? ??? ¢Ü??? ?? ??? ???? ??? ???? ???? ???? ? ?? ??? stack??? ?? ?? ????. ¢Ý??? ? ?? ?? ?? ??? ????? ?? ?? ??? ????. ¢Þ????. ¢ß???? ??? ??? 89?? ????? ???? ????. 1-2)??? ??? ??? ???? ??(??). ¢Ù?? ?? x, y? ????. ¢Úx*10+y? ?? ? ??? ??? ???. ¢Ústack 2? ???. ¢Ûstack1? ???? ??. ¢Üstack2? ????? ??. ¢Üstack2? top? ??? ??. ¢Þstack2? top? ?? ????? stack1? ?? ???? ???? stack1? top? ?? ??. ¢Ýstack2? top? ?? ????? stack1? ?? ????? stack2? top? ?? stack1 ? ??. ¢Þstack2? top? ?? ??. ¢ßstack2? ?? ?? ?? stack1? ??? queue? ??? ?? ??. ¢àstack2? ?? ?? ?? stack1? ??? ?? ?? ? stack1? ?? ????? stack2? ??(????) ¢á¢Ü??? ???? ?? 2)???? 2? ??? ???? ??. ¢Ù?? ?? x, y? ????. ¢Ú???? ? ?? ??? ???? 2? ??? ???? ???. ¢Û? ? ? ??? 1? ???? ??? ???. ¢Ü??? ? ?? ???? ???.
- 16. ¢Ý??? ? ?? ?? ?? ??? ????? ?? ?? ??? ????. ¢Þ????. ¢ß???? ??? ??? 89?? ????? ???? ????.
- 17. ¡ù?? #include <stdio.h> #include <stdlib.h> #define ROW_SIZE 10 #define COL_SIZE 9 #define NUM_WAYS 8 typedef int board_t[ROW_SIZE][COL_SIZE]; int dr[NUM_WAYS] = {-2,-1,1,2,2,1,-1,-2}; int dc[NUM_WAYS] = {1,2,2,1,-1,-2,-2,-1}; void initialize_board(board_t board) { int i,j; for(i=0;i<ROW_SIZE;i++) { for(j=0;j<COL_SIZE;j++) { board[i][j] = -1; } } } void print_board(board_t board) { int i,j; for(i=0;i<ROW_SIZE;i++) { for(j=0;j<COL_SIZE;j++) { printf("%dt",board[i][j]); } printf("n"); } } int is_inside_board(int r, int c) { return r>=0 && r<ROW_SIZE && c>=0 && c<COL_SIZE; } int is_available(board_t board, int r, int c) {
- 18. return is_inside_board(r,c) && board[r][c] == -1; } int num_next_moves(board_t board, int r, int c) { int i,result=0; for(i=0;i<NUM_WAYS;i++) { if(is_available(board,r+dr[i],c+dc[i])) { result++; } } return result; } int next_way_of(board_t board, int r, int c) { int i, min = NUM_WAYS, result=0; for(i=0;i<NUM_WAYS;i++) { if(is_available(board, r+dr[i], c+dc[i]) && num_next_moves(board,r+dr[i],c+dc[i])<min) { min=num_next_moves(board,r+dr[i],c+dc[i]); result=i; } } return result; } int main() { int r,c,move,next_way; board_t board; initialize_board(board); while(1) { printf("input start position r(0~9) c(0~8): "); scanf("%d %d",&r, &c); fflush(stdin); if(is_inside_board(r,c)) { break; } printf("Please put them again.n"); } board[r][c] = 0;
- 19. for(move=1;move<ROW_SIZE*COL_SIZE;move++) { if(num_next_moves(board,r,c)==0) { printf("Failed.n"); print_board(board); system("pause"); return 1; } next_way = next_way_of(board,r,c); r=r+dr[next_way]; c=c+dc[next_way]; board[r][c]=move; } print_board(board); system("pause"); return 0; }
- 20. ¡ù??? & ???? ??? ??? ? ?? ??? ???? ??? ? ??? ??? ??? ? ???? ?? ?? ? ???? ??? ???? ?? ??? ? ?? ??? ?? ???? ??. ???? ??? ??? 1? ??? ?? ????? ??.
- 21. ¡ù???? #include <stdio.h> #define STACK_SIZE 8 #define JANG_GI 89 int stack2[STACK_SIZE]; int po[STACK_SIZE47]; void position(int a){ int n, n1=0; stack2[0] = a-21; stack2[1] = a-19; stack2[2] = a-12; stack2[3] = a-8; stack2[4] = a+8; stack2[5] = a+12; stack2[6] = a+19; stack2[7] = a+21; for(n=0; n<STACK_SIZE; n++){ if(stack2[n]<=0&&stack2[n]>=89){ if(stack2[n]%10==a%10-2||stack2[n]%10==a%10+2||stac k2[n]%10==a%10+1||stack2[n]%10==a%10-1){ po[n1]=stack2[n]; n1++; } } } } void stack(int a){
- 22. int stack1[JANG_GI], stack3[JANG_GI]; int count=0, count1, top; int k; for(;;){ if(top==89){ break; } stack1[count]=a; stack3[count]=a; count++; top++; position(a); for(count1=0; count1<=top; count++){ if(po[0]!=stack1[count1]){ a=po[0]; break; } else if(po[1]!=stack1[count1]){ a=po[1]; break; } else if(po[2]!=stack1[count1]){ a=po[2]; break; } else if(po[3]!=stack1[count1]){ a=po[3]; break; } else if(po[4]!=stack1[count1]){ a=po[4]; break; }
- 23. else if(po[5]!=stack1[count1]){ a=po[5]; break; } else if(po[6]!=stack1[count1]){ a=po[6]; break; } else if(po[7]!=stack1[count1]){ a=po[7]; break; } else{ top--; count=top; k=stack1[count+1]-stack3[count]; for(count1=0; count1<STACK_SIZE; count1++){ if(stack2[count]==k){ a = stack3[count]+stack2[count+1]; } else{ break; } } } } } } int main(){ int x, y, good; int coor; printf("input x:");
- 24. scanf("%d", &x); printf("input y:"); scanf("%d", &y); coor = x*10+y; stack(coor); for(good=0; good<90; good++){ printf("<"); printf("%d", stack1[good]/10); printf(","); printf("%d", stack1[good]%10); printf(">"); } return 0; }
- 25. ¡ù???? x, y ??? ?? ???? stack ???? ??? ?? ????? ???? ???.
- 26. ¡ù???? ? ?? URL http://winplz.tistory.com/123 http://klsm1229.blog.me/150088201991 http://blog.naver.com/pjy9954?Redirect=Log&logNo=70128954403 http://blog.naver.com/skout123?Redirect=Log&logNo=50135743013 http://blog.naver.com/keloc?Redirect=Log&logNo=40153471559 http://blog.naver.com/dntkrl79?Redirect=Log&logNo=70095768962 http://blog.naver.com/keloc?Redirect=Log&logNo=40153471559 http://blog.naver.com/dntkrl79?Redirect=Log&logNo=70095768962 http://stackoverflow.com/questions/5633248/open-knights-tour-backtracking-algorithm- in-smlnj http://www.geeksforgeeks.org/archives/12916 http://blog.naver.com/ryutuna?Redirect=Log&logNo=100122313091 ???? -FOUNDATIONS OF ALGORITHMS USING C++ PSEUDOCODE p183~222 Richard Neapolitan/kumarss Naimipour ? -C??? ??? ???? p50~70