forked from mehtimsv/ApLabGitPractice
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path3.cpp
More file actions
177 lines (163 loc) · 2.3 KB
/
3.cpp
File metadata and controls
177 lines (163 loc) · 2.3 KB
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
#include<stdio.h>
#include<stdlib.h>
#pragma warning(disable:4996)
#define MAX_SIZE 200
//int arr[MAX_SIZE];
long long arr[MAX_SIZE];
typedef struct alfa* alfaptr;
struct alfa {
long long x;
alfaptr next;
};
alfaptr rear = NULL, front = NULL;
//int x
void push(long long x)
{
alfaptr node;
node = (alfaptr)malloc(sizeof(struct alfa));
node->x = x;
//
node->next = NULL;
if (!front)
{
front = node;
//
rear = node;
}
else {
rear->next = node;
rear = node;
}
}
void pop()
{
if (!front)
printf("ERROR1");
else
{
//
alfaptr node = front;
//node = front->next;
//front = node;
//
front = node->next;
free(node);
}
}
//int
void search(long long x)
{
alfaptr node = front;
int counter = 0;
while (node)
//{}
{
if (node->x == x)
{
//
counter++;
printf("%d", counter);
}
else {
printf("ERROR2");
//break;
}
node = node->next;
}
}
void rpop() {//pop last element
//
if (front == rear)
{
front = NULL;
rear = NULL;
return;
}
alfaptr node = front;
//node
while (node->next != rear)
node = node->next;
//
node->next = NULL;
free(rear);
rear = node;
}
void set()
{
alfaptr node = front;
for (int i = 0; i < MAX_SIZE && node; i++, node = node->next)
arr[i] = node->x;
}
int size()
{
alfaptr node = front;
//count
int count = 0;
while (node)
{
count++;
node = node->next;
}
return count;
}
void show()
{
if (!front) {
for (int i = 0; i < MAX_SIZE; i++)
printf("%lld ", arr[i]);
}
else
{
printf("ERROR3");
}
}
//long long
long long average()
{
alfaptr node = front;
//int //count
long long sum = 0, count = 0;
while (node) {
sum += node->x;
count++;
node = node->next;
}
return sum / count;
}
void main()
{
int cmd;
long long int x;
while (true)
{
scanf("%d", &cmd);
switch (cmd)
{
case 1://push
scanf("%lld", &x);
push(x);
break;
case 2://pop
pop();
break;
case 3://rpop
rpop();
break;
case 4://search
scanf("%lld", &x);
search(x);
break;
case 5://set
set();
break;
case 6://show
show();
break;
case 7://size
printf("%d", size());
break;
case 10:
exit(0);
}
}
}