C++實(shí)現(xiàn)簡單的學(xué)生管理系統(tǒng)
//Student.cpp
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
|
#include<iostream> using namespace std; struct Stu { char no[10]; char name[16]; int math; int chi; double ave; }; class Student { public : Stu st; Student * next; public : Student(){} Student(Stu s) { st=s; next=NULL; st.ave=(st.math+st.chi)/2.0; } void setst(Stu s) { st=s; st.ave=(st.math+st.chi)/2.0; } Stu getst() { return st; } void show() { cout<< "----------------------------" <<endl; cout<< "學(xué)號:" <<st.no<<endl; cout<< "姓名:" <<st.name<<endl; cout<< "數(shù)學(xué)成績:" <<st.math<<endl; cout<< "語文成績:" <<st.chi<<endl; cout<< "平均成績:" <<st.ave<<endl; cout<< "----------------------------" <<endl; } }; |
//main.cpp
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
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
|
#include<fstream> #include"Student.cpp" using namespace std; Student * create_List(); void traverse_List(Student * pHead); bool is_empty(Student * pHead); int length_List(Student * pHead); bool insert_List(Student * pHead, int position,Stu st); bool delete_List(Student * pHead, int position,Stu * st); void sort_List(Student * pHead); void menu_select(); void handle_menu( int s); void outFile(); Student * inFile(); void delFile(); Student * pHead; void main() { menu_select(); } void menu_select() { int s; cout<< "請輸入您要操作的選項(xiàng):" <<endl; cout<< "1.增加原始記錄" <<endl; cout<< "2.按平均分排序顯示所有記錄" <<endl; cout<< "3.保存原始文件" <<endl; cout<< "4.讀取原始文件" <<endl; cout<< "5.刪除原始文件" <<endl; cout<< "6.插入單條記錄" <<endl; cout<< "7.刪除單條記錄" <<endl; cout<< "8.顯示記錄總條數(shù)" <<endl; cout<< "9.結(jié)束程序運(yùn)行" <<endl<<endl; cout<< "左邊數(shù)字對應(yīng)功能選擇,請選擇1-9:" ; cin>>s; handle_menu(s); } void handle_menu( int s) { switch (s) { case 1: { system ( "cls" ); pHead=create_List(); system ( "cls" ); menu_select(); break ; } case 2: { if (NULL==pHead) { cout<< "記錄總條數(shù)為零" <<endl; getchar (); getchar (); system ( "cls" ); menu_select(); } system ( "cls" ); sort_List(pHead); traverse_List(pHead); getchar (); getchar (); system ( "cls" ); menu_select(); break ; } case 3: { if (pHead!=NULL) { system ( "cls" ); outFile(); system ( "cls" ); menu_select(); } system ( "cls" ); menu_select(); break ; } case 4: { system ( "cls" ); pHead=inFile(); system ( "cls" ); menu_select(); break ; } case 5: { system ( "cls" ); delFile(); system ( "cls" ); menu_select(); break ; } case 6: { if (NULL==pHead) { cout<< "記錄總條數(shù)為零" <<endl; getchar (); getchar (); system ( "cls" ); menu_select(); } system ( "cls" ); int num; Stu st; traverse_List(pHead); cout<< "您想在哪條記錄后插入,請輸入序號:" ; cin>>num; cout<< "編輯要插入的記錄:" <<endl; cout<< "學(xué)號:" ; cin>>st.no; cout<< "姓名:" ; cin>>st.name; cout<< "數(shù)學(xué)成績:" ; cin>>st.math; cout<< "語文成績:" ; cin>>st.chi; if (insert_List(pHead,num-1,st)) { cout<< "插入成功!" <<endl; } else { cout<< "插入失敗!" <<endl; } getchar (); getchar (); system ( "cls" ); menu_select(); break ; } case 7: { if (NULL==pHead) { cout<< "記錄總條數(shù)為零" <<endl; getchar (); getchar (); system ( "cls" ); menu_select(); } int num; Stu * st=(Stu *) malloc ( sizeof (Stu)); traverse_List(pHead); cout<<endl<< "請輸入您要?jiǎng)h除的記錄的序號:" ; cin>>num; if (delete_List(pHead,num,st)) { cout<<endl<< "成功刪除的記錄如下:" <<endl; cout<< "學(xué)號:" <<st->no<<endl<< "姓名:" <<st->name<<endl; } else { cout<< "刪除失敗!" <<endl; } getchar (); getchar (); system ( "cls" ); menu_select(); break ; } case 8: { if (NULL!=pHead) { system ( "cls" ); cout<< "記錄總條數(shù):" <<length_List(pHead)<< "條" <<endl; getchar (); getchar (); system ( "cls" ); menu_select(); } else { cout<< "記錄總條數(shù)為零" <<endl; getchar (); getchar (); system ( "cls" ); menu_select(); } break ; } case 9: { system ( "cls" ); cout<< "成功退出!" <<endl; exit (0); break ; } } } void delFile() { ofstream fileout; fileout.open( "c:\\kcsj.txt" ,ios_base::out); fileout<< "" ; fileout.close(); } Student * inFile() { Student * pHead=(Student *) malloc ( sizeof (Student)); if (NULL==pHead) { cout<< "分配失敗,程序終止!" <<endl; exit (0); } Student * pTail=pHead; pTail->next=NULL; ifstream in( "c:\\kcsj.txt" ); if (!in.is_open()) { cout << "Error opening file" <<endl; exit (0); } while (!in.eof()) { Stu st; in.read( reinterpret_cast < char *>(&st), sizeof (st)); if (in.fail()) { break ; } Student * pNew= new Student(); if (NULL==pNew) { printf ( "分配失敗,程序終止\n" ); exit (0); } pNew->setst(st); pTail->next=pNew; pNew->next=NULL; pTail=pNew; } in.close(); return pHead; } void outFile() { ofstream out; out.open( "c:\\kcsj.txt" ,ios_base::out|ios_base::app|ios::binary); if (!out) { cout<< "文件不存在,退出時(shí)別忘記保存文件!" <<endl; out.close(); out.open( "stu.dat" ,ios_base::out|ios::binary); } else { out.close(); out.open( "c:\\kcsj.txt" ,ios_base::out|ios_base::app|ios::binary); } Student * temp=pHead->next; while (temp!=NULL) { Stu st=temp->getst(); out.write( reinterpret_cast < char *>(&st), sizeof (st)); temp=temp->next; } out.close(); } Student * create_List() { int len; Student * pHead=(Student *) malloc ( sizeof (Student)); if (NULL==pHead) { cout<< "分配失敗,程序終止!" <<endl; exit (0); } Student * pTail=pHead; pTail->next=NULL; cout<< "請輸入要存儲(chǔ)的學(xué)生人數(shù):" ; cin>>len; for ( int i=0;i<len;i++) { Stu st; cout<< "請輸入第" <<i+1<< "個(gè)學(xué)生的學(xué)號:" ; cin>>st.no; cout<< "請輸入第" <<i+1<< "個(gè)學(xué)生的姓名:" ; cin>>st.name; cout<< "請輸入第" <<i+1<< "個(gè)學(xué)生的數(shù)學(xué)成績:" ; cin>>st.math; cout<< "請輸入第" <<i+1<< "個(gè)學(xué)生的語文成績:" ; cin>>st.chi; Student * pNew= new Student(); if (NULL==pNew) { printf ( "分配失敗,程序終止\n" ); exit (0); } pNew->setst(st); pTail->next=pNew; pNew->next=NULL; pTail=pNew; } return pHead; } void traverse_List(Student * pHead) { int i=1; Student * temp=pHead->next; while (temp!=NULL) { cout<<endl<< "序號:" <<i<<endl; temp->show(); temp=temp->next; i++; } } bool is_empty(Student * pHead) { if (NULL==pHead->next) { return true ; } else { return false ; } } int length_List(Student * pHead) { int len=0; Student * temp=pHead->next; while (temp) { len++; temp=temp->next; } return len; } bool insert_List(Student * pHead, int position,Stu st) { int i=0; Student * p=pHead; while (NULL!=p&&i<position-1) { p=p->next; i++; } if (i>position-i||NULL==p) { return false ; } Student * pNew=(Student *) malloc ( sizeof (Student)); if (NULL==pNew) { cout<< "分配失敗,程序終止" <<endl; exit (0); } pNew->setst(st); pNew->next=p->next; p->next=pNew; return true ; } bool delete_List(Student * pHead, int position,Stu * st) { int i=0; Student * p=pHead; while (NULL!=p->next&&i<position-1) { p=p->next; i++; } Student * q=p->next; *st=q->getst(); p->next=p->next->next; free (q); q=NULL; return true ; } void sort_List(Student * pHead) { Student * p,* q; Stu temp; int i,j; int len=length_List(pHead); for (i=0,p=pHead->next;i<len-1;i++,p=p->next) { for (j=i+1,q=p->next;j<len;j++,q=q->next) { if (q->st.ave>p->st.ave) { temp=q->st; q->st=p->st; p->st=temp; } } } } |
以上所述就是本文的全部內(nèi)容了,希望大家能夠喜歡。