-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy path14 first normal version.c
192 lines (172 loc) · 3.54 KB
/
14 first normal version.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
#include <ncurses.h>
#include <stdio.h>
#define size_x 70
#define size_y 20
struct Snake
{
int x[100];
int y[100];
};
struct Snake snake;
bool Game_Over = true, fruit = false, fr_on_sn = false;
int score = 0;
int size_snake = 3, fruit_x, fruit_y;
void Setup();
void Pole();
void Print_Snake();
void Pereresovka();
bool Prov_Fruit();
void Eat_Fruit();
int main()
{
initscr();
srand(time(0));
curs_set(0);
noecho();
keypad(stdscr, true);
Setup();
Pole();
Print_Snake();
mvaddch(fruit_y, fruit_x, '9');
while (Game_Over)
{
switch (getch())
{
case KEY_UP:
clear();
if (snake.y[0] - 1 != snake.y[1]) {
if (snake.y[0] == 2) { Game_Over = false; break;}
for (int i = 1; i < size_snake; i++) {
if (snake.x[0]==snake.x[i]&&snake.y[0]-1==snake.y[i]) {
Game_Over = false; break;
}
}
Pereresovka();
snake.y[0]--; }
Pole();
Eat_Fruit();
mvaddch(fruit_y, fruit_x, '9');
Print_Snake();
//refresh();
break;
case KEY_DOWN:
clear();
if (snake.y[0] + 1 != snake.y[1]) {
if (snake.y[0] == 18) { Game_Over = false; break;}
for (int i = 1; i < size_snake; i++) {
if (snake.x[0]==snake.x[i]&&snake.y[0]+1==snake.y[i]) {
Game_Over = false; break;
}
}
Pereresovka();
snake.y[0]++; }
Pole();
Eat_Fruit();
mvaddch(fruit_y, fruit_x, '9');
Print_Snake();
//refresh();
break;
case KEY_RIGHT:
clear();
if (snake.x[0] + 1 != snake.x[1]) {
if (snake.x[0] == 68) { Game_Over = false; break;}
for (int i = 1; i < size_snake; i++) {
if (snake.x[0]+1==snake.x[i]&&snake.y[0]==snake.y[i]) {
Game_Over = false; break;
}
}
Pereresovka();
snake.x[0]++; }
Pole();
Eat_Fruit();
mvaddch(fruit_y, fruit_x, '9');
Print_Snake();
//refresh();
break;
case KEY_LEFT:
clear();
if (snake.x[0] - 1 != snake.x[1]) {
if (snake.x[0] == 1) { Game_Over = false; break;}
for (int i = 1; i < size_snake; i++) {
if (snake.x[0]-1==snake.x[i]&&snake.y[0]==snake.y[i]) {
Game_Over = false; break;
}
}
Pereresovka();
snake.x[0]--; }
Pole();
Eat_Fruit();
mvaddch(fruit_y, fruit_x, '9');
Print_Snake();
//refresh();
break;
}
}
clear();
printw("Game Over!");
usleep(5000);
refresh();
getch();
endwin();
return 0;
}
void Setup()
{
fruit_x = rand()%(size_x - 3) + 2; fruit_y = rand()%(size_y - 2) + 4;
snake.x[0] = 35;
snake.y[0] = 10;
snake.x[1] = 35;
snake.y[1] = 11;
snake.x[2] = 35;
snake.y[2] = 12;
}
void Pole()
{
printw("Score: %d", score);
for (int i = 0; i < size_y; i++) {
for (int j = 0; j < size_x; j++) {
if ((i == 1 || i == 19) || ((j == 0 && i != 0)) || ((j == 69) && i != 0)) { mvaddch(i, j, '='); }
} printw("\n");
}
}
void Print_Snake()
{
for (int i = 0; i < size_snake; i++) {
if (i == 0) {
mvaddch(snake.y[0], snake.x[0], '%');
}
else {
mvaddch(snake.y[i], snake.x[i], '*');
}
}
}
void Pereresovka()
{
for(int i = size_snake; i !=0; i--) {
snake.y[i]=snake.y[i-1];
snake.x[i]=snake.x[i-1];
}
}
bool Prov_Fruit()
{
fruit_x = rand()%(size_x - 3) + 2;
fruit_y = rand()%(size_y - 1) + 2;
for (int i = 0; i < size_snake; i++) {
if ((snake.x[i] == fruit_x) &&(snake.y[i] == fruit_y)) {
return false;
break;
}
}
return true;
}
void Eat_Fruit()
{
if ((snake.y[0] == fruit_y) && (snake.x[0] == fruit_x)) {
while (!fr_on_sn) {
fr_on_sn = Prov_Fruit();
}
fr_on_sn = false;
score++;
size_snake++;
}
}