-
Notifications
You must be signed in to change notification settings - Fork 2
/
w7p2.c
372 lines (305 loc) · 10.8 KB
/
w7p2.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
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
/*
*****************************************************************************
Workshop - #7 (P2)
Full Name : MD ARAFAT KOYES
Student ID#: XXXXX
Email : [email protected]
Section : XXX
Authenticity Declaration:
I declare this submission is the result of my own work and has not been
shared with any other student or 3rd party content provider. This submitted
piece of work is entirely of my own creation.
*****************************************************************************
*/
#define _CRT_SECURE_NO_WARNINGS
#define MAXIMUM_PATH_LENGTH 70
#define MINIMUM_PATH_LENGTH 10
#define MAXIMUM_LIVES 10
#define MINIMUM_LIVES 1
#define MULTIPLE 5
#include <stdio.h>
struct playerInfo {
int lives;
char playerCharacter;
int treasureCount;
int positionHistory[MAXIMUM_PATH_LENGTH];
};
struct gameInfo {
int moves;
int pathLength;
int bombLocations[MAXIMUM_PATH_LENGTH];
int treasureLocations[MAXIMUM_PATH_LENGTH];
};
int main(void)
{
// Declaring variables
int i, j, k; // Used in for loops
int movesRemaining, livesRemaining, movePosition = MAXIMUM_PATH_LENGTH + 1;
struct playerInfo player;
struct gameInfo game;
printf("================================\n");
printf(" Treasure Hunt!\n");
printf("================================\n");
printf("\n");
printf("PLAYER Configuration\n");
printf("--------------------\n");
printf("Enter a single character to represent the player: ");
scanf(" %c", &player.playerCharacter);
do {
printf("Set the number of lives: ");
scanf("%d", &player.lives);
if (player.lives < MINIMUM_LIVES || player.lives > MAXIMUM_LIVES)
{
printf(" Must be between 1 and 10!\n");
}
} while (player.lives < MINIMUM_LIVES || player.lives > MAXIMUM_LIVES);
printf("Player configuration set-up is complete\n");
printf("\n");
// Configuring the game
printf("GAME Configuration\n");
printf("------------------\n");
// Do
do {
printf("Set the path length (a multiple of 5 between 10-70): ");
scanf("%d", &game.pathLength);
if ((game.pathLength < MINIMUM_PATH_LENGTH || game.pathLength > MAXIMUM_PATH_LENGTH) || (game.pathLength % MULTIPLE != 0))
{
printf(" Must be a multiple of 5 and between 10-70!!!\n");
}
} while ((game.pathLength < MINIMUM_PATH_LENGTH || game.pathLength > MAXIMUM_PATH_LENGTH) || (game.pathLength % MULTIPLE != 0));
// Number of moves
do {
printf("Set the limit for number of moves allowed: ");
scanf("%d", &game.moves); // moves
if (game.moves < player.lives || game.moves >(int) (0.75 * game.pathLength))
{
printf(" Value must be between %d and %d\n", player.lives, (int)(0.75 * game.pathLength));
}
} while (game.moves < player.lives || game.moves >(int) (0.75 * game.pathLength));
printf("\n");
// Bomb Placement
printf("BOMB Placement\n");
printf("--------------\n");
printf("Enter the bomb positions in sets of 5 where a value\n");
printf("of 1=BOMB, and 0=NO BOMB. Space-delimit your input.\n");
printf("(Example: 1 0 0 1 1) NOTE: there are %d to set!\n", game.pathLength);
for (i = 0; i < game.pathLength; i += 5)
{
printf(" Positions [%2d-%2d]: ", i + 1, i + 5);
scanf("%d %d %d %d %d", &game.bombLocations[i], &game.bombLocations[i + 1], &game.bombLocations[i + 2], &game.bombLocations[i + 3], &game.bombLocations[i + 4]);
}
printf("BOMB placement set\n");
printf("\n");
// Treasure Placement in Arrays
printf("TREASURE Placement\n");
printf("------------------\n");
printf("Enter the treasure placements in sets of 5 where a value\n");
printf("of 1=TREASURE, and 0=NO TREASURE. Space-delimit your input.\n");
printf("(Example: 1 0 0 1 1) NOTE: there are %d to set!\n", game.pathLength);
for (i = 0; i < game.pathLength; i += 5)
{
printf(" Positions [%2d-%2d]: ", i + 1, i + 5);
scanf("%d %d %d %d %d", &game.treasureLocations[i], &game.treasureLocations[i + 1], &game.treasureLocations[i + 2], &game.treasureLocations[i + 3], &game.treasureLocations[i + 4]);
}
printf("TREASURE placement set\n");
printf("\n");
printf("GAME configuration set-up is complete...\n");
printf("\n");
// Settings
printf("------------------------------------\n");
printf("TREASURE HUNT Configuration Settings\n");
printf("------------------------------------\n");
// Player Details
printf("Player:\n");
printf(" Symbol : %c\n", player.playerCharacter);
printf(" Lives : %d\n", player.lives);
printf(" Treasure : [ready for gameplay]\n");
printf(" History : [ready for gameplay]\n");
printf("\n");
// Game Details
printf("Game:\n");
printf(" Path Length: %d\n", game.pathLength);
// Bombs
printf(" Bombs : ");
// Displaying bombs Array
for (j = 0; j < game.pathLength; j++)
{
printf("%d", game.bombLocations[j]);
}
printf("\n");
// Treasures
printf(" Treasure : ");
// Displaying treasures array
for (k = 0; k < game.pathLength; k++)
{
printf("%d", game.treasureLocations[k]);
}
printf("\n\n");
// Start
printf("====================================\n");
printf("~ Get ready to play TREASURE HUNT! ~\n");
printf("====================================\n");
// Assigning Values
movesRemaining = game.moves;
livesRemaining = player.lives;
player.treasureCount = 0;
int vCount = 0;
char currentPosition[MAXIMUM_PATH_LENGTH];
char positionItem[MAXIMUM_PATH_LENGTH];
for (j = 0; j < game.pathLength; j++)
{
player.positionHistory[j] = 0;
}
for (k = 0; k < game.pathLength; k++)
{
positionItem[k] = '-'; // no error
}
for (k = 0; k < game.pathLength; k++)
{
currentPosition[k] = ' ';
}
// Printing the table
do {
// First Line
for (k = 0; k < game.pathLength; k++)
{
if (currentPosition[k] == 'V')
{
vCount++;
}
}
if (vCount == 0)
{
printf("\n");
}
else
{
printf(" ");
for (k = 0; k < game.pathLength; k++)
{
if (currentPosition[k] == 'V')
{
printf("%c\n", currentPosition[k]);
break;
}
else
{
printf("%c", currentPosition[k]);
}
}
}
for (k = 0; k < game.pathLength; k++)
{
currentPosition[k] = ' ';
}
// 2nd Line
printf(" ");
for (k = 0; k < game.pathLength; k++)
{
printf("%c", positionItem[k]);
}
printf("\n");
// 3rd Line
printf(" ");
for (i = 1; i <= game.pathLength; i++)
{
if (i % 10 == 0)
{
printf("%d", (int)i / 10);
}
else
{
printf("|");
}
}
printf("\n");
// 4th Line
printf(" ");
for (i = 0; i < game.pathLength; i += 10)
{
printf("1234567890");
}
printf("\n");
// Displaying Player Statistics
printf("+---------------------------------------------------+\n");
printf(" Lives: %2d | Treasures: %2d | Moves Remaining: %2d\n", livesRemaining, player.treasureCount, movesRemaining);
printf("+---------------------------------------------------+\n");
// Quit loop if the remaining lives are Zero
if (livesRemaining == 0)
{
break;
}
// Quit loop if the remaining moves are Zero
if (movesRemaining == 0)
{
break;
}
// Determining the Next Move
do {
printf("Next Move [1-20]: ");
scanf("%d", &movePosition);
if (movePosition < 1 || movePosition > game.pathLength)
{
printf(" Out of Range!!!\n");
}
} while (movePosition < 1 || movePosition > game.pathLength);
printf("\n");
if (player.positionHistory[movePosition - 1] == 1)
{
printf("===============> Dope! You've been here before!\n\n");
currentPosition[movePosition - 1] = 'V';
movesRemaining++;
}
else if (game.bombLocations[movePosition - 1] == 1 && game.treasureLocations[movePosition - 1] == 1)
{
printf("===============> [&] !!! BOOOOOM !!! [&]\n");
printf("===============> [&] $$$ Life Insurance Payout!!! [&]\n\n");
positionItem[movePosition - 1] = '&';
currentPosition[movePosition - 1] = 'V';
livesRemaining--;
player.treasureCount++;
}
else if (game.bombLocations[movePosition - 1] == 1)
{
printf("===============> [!] !!! BOOOOOM !!! [!]\n\n");
positionItem[movePosition - 1] = '!';
currentPosition[movePosition - 1] = 'V';
livesRemaining--;
}
else if (game.treasureLocations[movePosition - 1] == 1)
{
printf("===============> [$] $$$ Found Treasure! $$$ [$]\n\n");
positionItem[movePosition - 1] = '$';
currentPosition[movePosition - 1] = 'V';
player.treasureCount++;
}
else
{
printf("===============> [.] ...Nothing found here... [.]\n\n");
positionItem[movePosition - 1] = '.';
currentPosition[movePosition - 1] = 'V';
}
// Storing the position in history Array
player.positionHistory[movePosition - 1] = 1;
// Decrementing the number of moves left
movesRemaining--;
if (livesRemaining == 0)
{
printf("No more LIVES remaining!\n\n");
}
if (movesRemaining == 0)
{
printf("No more MOVES remaining!\n\n");
}
} while (movesRemaining >= 0 && livesRemaining >= 0);
// Final table
printf("\n");
// Ending Lines
printf("##################\n");
printf("# Game over! #\n");
printf("##################\n");
printf("\n");
printf("You should play again and try to beat your score!\n");
printf("\n");
return 0;
}