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
| #include <stdio.h>
#include <stdlib.h>
typedef struct element element;
struct element
{
int notedev;
int notereseau;
int date;
element *elementSuivant;
};
element *debut = NULL;
void ajouter(int noted, int noter, int datej)
{
element *p = NULL;
p = malloc(sizeof(element));
if (p != NULL)
{
(p->notedev) = noted;
(p->notereseau) = noter;
(p->date) = datej;
(p->elementSuivant) = debut;
debut = &p;
}
}
void lireListe()
{
element *p = NULL;
p = debut;
while (p != NULL)
{
printf ("%d\n", (p->notedev));
printf ("%d\n", (p->notereseau));
printf ("%d\n", (p->date));
p = (p->elementSuivant);
}
}
int main(void)
{
int i = 0;
int noteendev = 0;
int noteenreseau = 0;
int ladate = 0;
while (i < 3)
{
printf("inserer la note que vous avez eu en developpement\n");
scanf("%d", ¬eendev);
printf("inserer lanote que vous avez eu en reseau\n");
scanf("%d", ¬eenreseau);
printf("inserer la date d\'aujourd'hui\n");
scanf("%d", &ladate);
ajouter(noteendev, noteenreseau, ladate);
i++;
}
lireListe();
return 0;
} |
