C語言停車場(chǎng)管理系統(tǒng)源代碼

1、精選優(yōu)質(zhì)文檔-傾情為你奉上#include<stdio.h>#include<stdlib.h>#define stacksize 2 /車站/容量/typedef struct Snode int number; float int_time2; float bian_time2;record;typedef struct record *base; record *top; int size;Stack;/typedef struct Qnode int number; float int_time2; struct Qnode *next;Qnode,*Queue

2、;typedef struct Queue front; Queue rear;Linkqueue;void xunhuan(Stack L,Linkqueue Q);void jixu(Stack L,Linkqueue Q);/void InitStack(Stack &L) /堆棧操作 L.base=(record*)malloc(sizeof(Snode)*stacksize); if(!L.base) exit(0); L.top=L.base; L.size=stacksize;/void input(Stack &L,record h) *L.top+=h; /S

3、node output(Stack &L,record &e) e=*-L.top; return e; int Stackman(Stack L) if(L.top-L.base=L.size) return 0; else return 1;int StackEmpty(Stack L) if(L.base=L.top) return 0; else return 1;/void Initque(Linkqueue &Q) /隊(duì)列操作 Q.front=Q.rear=(Queue)malloc(sizeof(Qnode); if(!Q.front) exit(0);

4、Q.front->next=NULL;/void enqueue(Linkqueue &Q,int number,float time) Queue q; printf("停車場(chǎng)已滿，請(qǐng)將車輛停入便道!n"); q=(Queue)malloc(sizeof(Qnode); q->int_time0=time0; q->int_time1=time1; q->number=number; q->next=NULL; Q.rear->next=q; Q.rear=q; /void outqueue(Linkqueue &Q,Q

5、ueue &e) /此處有點(diǎn)問題？ / Qnode *q; /q=(Queue)malloc(sizeof(Qnode); e=Q.front->next; / Q.front->next=q->next;/delete q; Q.front->next=Q.front->next->next; if(Q.rear=e) Q.front=Q.rear; / Q.front=NULL; int QEmpty(Linkqueue Q) if(Q.rear=Q.front) return 0; else return 1;/ /停車場(chǎng)管理操作/void j

6、ixu(Stack L,Linkqueue Q)int n; fflush(stdin); scanf("%d",&n);switch(n)case 1:printf("nn");xunhuan(L,Q); break;case 2:printf("*退出管理系統(tǒng)*n"); break;default:printf("n輸入錯(cuò)誤，請(qǐng)重新輸入: ");jixu(L,Q);break;void jiaofei(float time,float time1,float time2) /繳費(fèi)操作 float dat

7、a1,data2;double money;if(time20!=0&&time21!=0) data2=(time10-time20-1)*60+60-time21+time11;elsedata2=0;data1=(time0-time10-1)*60+60-time11+time1;/printf("進(jìn)入車場(chǎng)時(shí)間%f,退出車場(chǎng)時(shí)間%fn",time11,time1);printf("你的停車時(shí)間為%lf小時(shí) ,在便道停留時(shí)間%f小時(shí)n",data1/60,data2/60); money=data1/60*5.0+data2/60*

8、2.0; printf("請(qǐng)交納%lf元n",money); /* if(data1<=60.0)printf("請(qǐng)交納5元。");if(data1>60.0&&data1<=120.0)printf("請(qǐng)交納10元。");if(data1>120.0)printf("請(qǐng)交納20元。");*/void leave(Stack &L,Linkqueue &Q,int number,float time) /汽車離開操作Stack S;InitStack(S);f

9、loat time12,time22; record e,e1;Queue q; e1=output(L,e); while(e.number!=number) input(S,e1); e1=output(L,e); time10=_time0; /入車站時(shí)間time11=_time1;time20=e.bian_time0; /入便道時(shí)間time21=e.bian_time1; jiaofei(time,time1,time2); / while(StackEmpty(S) input(L,output(S,e1); while(QEmpty(Q)&&S

10、tackman(L) outqueue(Q,q); /printf("nn請(qǐng)輸入汽車從便道進(jìn)入停車場(chǎng)的時(shí)間，輸入格式為（時(shí) 空格 分）:"); e.bian_time0=q->int_time0; e.bian_time1=q->int_time1; /scanf("%f %f",&time20,&time21); _time0=time0; _time1=time1; e.number=q->number; printf("n汽車從便道退出進(jìn)入停車場(chǎng)"); printf(&quo

11、t;n請(qǐng)將%d號(hào)車停在%d號(hào)位置！n",e.number,L.top-L.base+1); input(L,e); /void xunhuan(Stack L,Linkqueue Q) /選擇操作及循環(huán)/Queue q; char ch; int number; float time2,time22; fflush(stdin); printf("nA:進(jìn)入停車場(chǎng) D：退出停車場(chǎng) E：退出管理系統(tǒng)n"); printf("n請(qǐng)輸入："); scanf("%c",&ch);fflush(stdin); switch(c

12、h) case 'A': printf("n請(qǐng)輸入車牌號(hào): "); scanf("%d",&number); printf("請(qǐng)輸入入場(chǎng)時(shí)間，輸入格式為（時(shí) 空格 分）:"); scanf("%f %f",&time0,&time1); if(Stackman(L) record e; _time0=time0; _time1=time1; e.bian_time0=0.0; e.bian_time1=0.0; e.number=number; print

13、f("請(qǐng)將車停在%d號(hào)位置！",L.top-L.base+1); input(L,e); else enqueue(Q,number,time); printf("n"); printf("n1、繼續(xù)操作 2、退出操作 : "); jixu(L,Q); break; case 'D': if(StackEmpty(L) printf("請(qǐng)輸入離開汽車的車牌號(hào)："); scanf("%d",&number); printf("輸入汽車離開時(shí)間："); s

14、canf("%f %f",&time20,&time21); leave(L,Q,number,time2); else printf("停車場(chǎng)為空n"); printf("n1、繼續(xù)操作 2、退出操作 : "); jixu(L,Q); break; case 'E': printf("*退出管理系統(tǒng)*n"); break; default: printf("輸入錯(cuò)誤，請(qǐng)重新輸入！n"); printf("#n"); xunhuan(L,Q); break; /void main() /主函數(shù)操作 Linkqueue Q; Stack L; InitStack(L); Init