-
Notifications
You must be signed in to change notification settings - Fork 1
/
tower-of-hanoi-in-c.c
214 lines (214 loc) · 2.96 KB
/
tower-of-hanoi-in-c.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
/*
program name: tower of hanoi
program written: Sagar Rajendra Shinde
year: S.Y.CSE
*/
#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
#include<dos.h>
int pop1(void );
int pop2(void );
int pop3(void );
void push1(int );
void push2(int );
void push3(int );
void display(void );
void star(void );
int top1=2,top2=-1,top3=-1,i,n1,n2,a1,a2,a3,b1,b2,b3,c,m;
int stack1[3]={3,2,1};
int stack2[3]={0,0,0};
int stack3[3]={0,0,0};
int main()
{
int p,k;
clrscr();
star();
printf("\x1B[1;%dm",33);
printf("\n\t welcome to tower of hanoi game\n\n\t\t1:start\n\n\t\t2:quit\n\n");
star();
printf("\n\n\n");
scanf("%d",&k);
if(k==1)
{
clrscr();
star();
printf("\n\n\tloading...\n\n\n");
star();
delay(5000);
}
if(k==1)
{
clrscr();
star();
printf("\x1B[1;%dm",36);
for(i=2;i>=0;i--)
{
printf("\x1B[1;%dm",36);
printf("%d\t%d\t%d\n",stack1[i],stack2[i],stack3[i]);
}
printf("\n\n");
star();
sos:
printf("\x1B[1;%dm",30);
printf("\n\tenter tower number to pop the element : ");
scanf("%d",&n1);
if(n1==1)
{
p=pop1();
}
else if(n1==2)
{
p=pop2();
}
else if(n1==3)
{
p=pop3();
}
else
{
printf("\n\nerror tower1 ");
}
printf("\x1B[1;%dm",30);
printf("\n\tenter tower number push the element : ");
scanf("%d",&n2);
if(n2==1)
{
clrscr();
push1(p);
}
else if(n2==2)
{
clrscr();
push2(p);
}
else if(n2==3)
{clrscr();
push3(p);
}
else
{
printf("\n\nerror tower 2");
}
display();
printf("\n\t\t\tnext");
m=1;
delay(3000);
if(m==1)
{
goto sos;
}
else
{
exit(0);
}
}
else
{ clrscr();
star();
printf("\x1B[1;%dm",31);
printf("\n\n\t\tTHANK YOU for using\n\n");
star();
}
getch();
return 0;
}
int pop1(void )
{
a1=stack1[top1];
stack1[top1]=0;
top1=top1-1;
return a1;
}
int pop2(void )
{
a2=stack2[top2];
stack2[top2]=0;
top2=top2-1;
return a2;
}
int pop3(void )
{
a3=stack3[top3];
stack3[top3]=0;
top3=top3-1;
return a3;
}
void push1(int p)
{
int u,k;
top1=top1+1;
b1=0;
stack1[top1]=b1;
u=p;
p=b1;
b1=u;
stack1[top1]=b1;
if(top1>0)
{
k=top1-1;
if(stack1[top1]>stack1[k])
{
printf("\n\n\nerror lower number is smaller\n\n");
exit(1);
}
}
}
void push2(int p)
{
int u,k;
top2=top2+1;
b2=0;
stack2[top2]=b2;
u=p;
p=b2;
b2=u;
stack2[top2]=b2;
if(top2>0)
{
k=top2-1;
if(stack2[top2]>stack2[k])
{
printf("\n\n\nerror lower number is smaller\n\n");
exit(1);
}
}
}
void push3(int p)
{
int u,k;
top3=top3+1;
b3=0;
stack3[top3]=b3;
u=p;
p=b3;
b3=u;
stack3[top3]=b3;
if(top3>0)
{
k=top3-1;
if(stack3[top3]>stack3[k])
{
printf("\n\n\nerror lower number is smaller\n\n");
exit(1);
}
}
}
void display(void )
{
clrscr();
star();
printf("\n\n");
printf("\x1B[1;%dm",36);
for(i=2;i>=0;i--)
{
printf("%d\t%d\t%d\n",stack1[i],stack2[i],stack3[i]);
}
printf("\n\n");
star();
}
void star(void )
{
printf("\x1B[1;%dm",32);
printf("\n************************************************\n\n\n\n");
}