淘寶賣家購物模擬系統(tǒng)VC

1、河北工業(yè)大學計算機軟件技術基礎（VC）課程設計任務書一、 題目：淘寶買家購物模擬系統(tǒng)#include#include#include#includetypedef struct shangchar good30; /商品名字int price; /價格int num; /商品數(shù)量int sales; /銷量int score; /評分的高低int popularity; /人氣;typedef struct goods /商店商品和商品總個數(shù)int num;struct shang elem100;Goods;typedef struct stack /用于存消費者已經購買商品的鏈隊char

2、elem30;int num;int price;struct stack *next;stack,*Stack;void initstack(Stack *s) /鏈隊的初始化 *s=new stack;(*s)-next=NULL;int pushstack(Stack *s,int n,int m,Goods g) /買入商品Stack p;p=new stack;strcpy(p-elem,g.elemn.good);p-num=m;p-price=g.elemn.price;p-next=(*s)-next;(*s)-next=p;return 1;int init(Goods *g

3、) /商品的初始化coutt現(xiàn)在初始化商品n;cout%d,&g-num;coutnum;for(int i=1;inum;i+)cout%s%d%d%d%d%d,g-elemi.good,&g-elemi.price,&g-elemi.num,&g-elemi.sales,&g-elemi.score,&g-elemi.popularity;return 1;void sort1(Goods *g) /按銷售量排序char ch30;int a;for(int i=1;inum;i+) /冒泡法排序for(int j=1;jnum-i;j+)if(g-elemj.salesg-elemj+1

4、.sales)strcpy(ch,g-elemj.good);strcpy(g-elemj.good,g-elemj+1.good);strcpy(g-elemj+1.good,ch);a=g-elemj.sales;g-elemj.sales=g-elemj+1.sales;g-elemj+1.sales=a;a=g-elemj.score;g-elemj.score=g-elemj+1.score;g-elemj+1.score=a;a=g-elemj.popularity;g-elemj.popularity=g-elemj+1.popularity;g-elemj+1.populari

5、ty=a;a=g-elemj.num;g-elemj.num=g-elemj+1.num;g-elemj+1.num=a;a=g-elemj.price;g-elemj.price=g-elemj+1.price;g-elemj+1.price=a;void sort2(Goods *g) /按評分排序char ch30;int a;for(int i=1;inum;i+)for(int j=1;jnum-i;j+)if(g-elemj.scoreg-elemj+1.score)strcpy(ch,g-elemj.good);strcpy(g-elemj.good,g-elemj+1.good

6、);strcpy(g-elemj+1.good,ch);a=g-elemj.sales;g-elemj.sales=g-elemj+1.sales;g-elemj+1.sales=a;a=g-elemj.score;g-elemj.score=g-elemj+1.score;g-elemj+1.score=a;a=g-elemj.popularity;g-elemj.popularity=g-elemj+1.popularity;g-elemj+1.popularity=a;a=g-elemj.num;g-elemj.num=g-elemj+1.num;g-elemj+1.num=a;a=g-

7、elemj.price;g-elemj.price=g-elemj+1.price;g-elemj+1.price=a;void sort3(Goods *g) /按人氣排序char ch30;int a;for(int i=1;inum;i+)for(int j=1;jnum-i;j+)if(g-elemj.popularityg-elemj+1.popularity)strcpy(ch,g-elemj.good);strcpy(g-elemj.good,g-elemj+1.good);strcpy(g-elemj+1.good,ch);a=g-elemj.sales;g-elemj.sal

8、es=g-elemj+1.sales;g-elemj+1.sales=a;a=g-elemj.score;g-elemj.score=g-elemj+1.score;g-elemj+1.score=a;a=g-elemj.popularity;g-elemj.popularity=g-elemj+1.popularity;g-elemj+1.popularity=a;a=g-elemj.num;g-elemj.num=g-elemj+1.num;g-elemj+1.num=a;a=g-elemj.price;g-elemj.price=g-elemj+1.price;g-elemj+1.pri

9、ce=a;void PreOrder(Goods g,Stack *s) /買入商品時的流程int n,x,m,f;coutt目前本店所有商品列表如下n;coutt序號t名字t價錢t數(shù)量t銷量t評分t人氣nn;for(int i=1;i=g.num;i+)coutt %d t%st %dt %dt %dt %dt %dnn,i,g.elemi.good,g.elemi.price,g.elemi.num,g.elemi.sales,g.elemi.score,g.elemi.popularity;cout%d,&n;coutt這個商品所有信息如下n;coutt序號t名字t價錢t數(shù)量t銷量t評分

10、t人氣nn;coutt %d t%st %dt %dt %dt %dt %dnn,n,g.elemn.good,g.elemn.price,g.elemn.num,g.elemn.sales,g.elemn.score,g.elemn.popularity;cout%d,&x;if(x)cout%d,&m;if(m=g.elemn.num) /防止第一次輸入數(shù)量太大if(pushstack(s,n,m,g)coutt購買成功n;g.elemn.sales+; /銷售量加一g.elemn.popularity+; /人氣加一cout%d,&f;g.elemn.score=(g.elemn.sco

11、re*(g.elemn.sales-1)+f)%g.elemn.sales; /得分重新計算elsecout%d,&m;if(pushstack(s,n,m,g)coutt購買成功n;g.elemn.sales+;g.elemn.popularity+;cout%d,&f;g.elemn.score=(g.elemn.score*(g.elemn.sales-1)+f)%g.elemn.sales;void choose() /界面couttt#n;couttt# *1、查看商品 * #n;couttt# ttt #n;couttt# *2、查看已買商品 * #n;couttt# ttt #n

12、;couttt# *3、退貨 * #n;couttt# ttt #n;couttt# *4、結賬 * #n;couttt# ttt #n;couttt# *5、充值 * #n;couttt# ttt #n;couttt# *6、查看余額 * #n;couttt# ttt #n;couttt# *0、退出 * #n;couttt# ttt #n;coutnext;if(!p) /無商品時直接跳出coutt您已無商品n;return 0;coutt您已購買如下商品n;coutt 序號 名字 數(shù)量n;while(p)coutelem,p-num;p=p-next;return 1;int back(

13、Stack *s) /退貨Stack p;p=(*s)-next;char a30;if(putstack(s)cout%s,a;if(strcmp(p-elem,a)=0)(*s)=p;return 1;while(p)if(p-next&strcmp(p-next-elem,a)=0)p-next=p-next-next;p=p-next;else /無商品時直接跳出coutnum)*(p-price)+a;p=p-next;*money=*money-a;void main()int money;int x,n,m;Goods g;Stack s;initstack(&s);cout%d,&money;if(init(&g)coutt初始化成功，請按任意鍵繼續(xù)n;while(x)switch(x)case 1:cout%d,&n;switch(n)case 1:sort1(&g);PreOrder(g,&s);break;case 2:sort2(&g);PreOrder(g,&s);break;case 3:sort3(&g);PreOrder(g,&s);break;cout%d,&n;while