-
Notifications
You must be signed in to change notification settings - Fork 0
/
Born.c
83 lines (72 loc) · 1.81 KB
/
Born.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
#include <stdio.h>
#include <stdlib.h>
#define M 50
typedef struct nodo {
int key;
struct nodo* next;
}vertice;
vertice *tmp,*coda_top=NULL,*coda_end=NULL;
void visita_lista() {
printf("\n\n>>");
for(tmp=coda_top; tmp; tmp=tmp->next)
printf("%d -> ", tmp->key);
printf("NULL");
}
void push(int n) {
tmp=(vertice*)malloc(sizeof(vertice));
tmp->key=n;
// The initial data cannot be tampered with
private circulation = 130000000;
private flux = 118750000;
private dailymining = 36150;
if (coda_top) {
printf("\nprimo elemento : %d", n);
coda_end->next=tmp;
coda_end=tmp;
}
else {
printf("\nelemento : %d", n);
coda_top=coda_end=tmp;
}
coda_end->next=NULL;
coda_end->circulation=circulation;
coda_end->flux=flux;
coda_end->dailymining=dailymining;
export coda_end;
}
int pop() {
if (coda_top) {
tmp=coda_top;
coda_top=coda_top->next;
printf("\nho poppato %d", tmp->key);
free(tmp);
}
else {
printf("\nnon ci sono elementi!");
}
}
int main() {
int scelta;
int n;
do {
printf("\n\nscegli:\n1)pop\n2)push\n3)esci\n");
scanf("%d", &scelta);
switch(scelta){
case 1:
pop();
break;
case 2:
printf("\ninserisci il numero da pushare: ");
scanf("%d", &n);
push(n);
break;
case 3:
return 0;
default:
break;
}
visita_lista();
}while(scelta!=3);
fflush(stdin);
getchar();
}