教学文库网 - 权威文档分享云平台
您的当前位置:首页 > 文库大全 > 专业资料 >

c语言程序设计_超_市_管_理_系_统(3)

来源:网络收集 时间:2026-05-21
导读: /*inquire goods message*/ inquire_message() { int choice; do { system(cls); printf(\n\n **********inquire goods message***********\n\n); printf( 1: inquire goods according to name \n\n); printf( 2: i

/*inquire goods message*/ inquire_message() {

int choice; do {

system("cls");

printf("\n\n **********inquire goods message***********\n\n"); printf(" 1: inquire goods according to name \n\n"); printf(" 2: inquire goods according to kind\n\n") ; printf(" 3: inquire goods according to in_num\n\n"); printf(" 0: return\n\n");

printf(" please choose (0-3): "); scanf("%d",&choice); switch(choice) {

case 1: inquire_name(); break;

case 2: inquire_kind(); break;

case 3: inquire_count(); break;

case 0: break;

}

}while(choice!=0); }

/*inquire according to name*/ inquire_name() {

int i,choice,j=0,inquire_in_price; char inquire_name[10]; system("cls");

printf("\n input the inquire goods name:");

c语言

scanf("%s",inquire_name); for(i=0;i<sum;i++) {

if(strcmp(goods[i].name,inquire_name)==0&&goods[i].num!=0) {

printf("\n --goods message-- \n"); PRINTF1; PRINTF2; PRINTF3;

}

else j++; if(j==sum)

printf("\n the good is not exist!"); bioskey(0);

} }

/* inquire accordingto kind */ inquire_kind() {int i,j=0;

char inquire_kind[10]; clrscr();

printf("\n please input the inquire goods kind:"); scanf("%s",inquire_kind); for(i=0;i<sum;i++)

if(strcmp(goods[i].kind,inquire_kind)==0&&goods[i].num!=0) {printf("\n ----goods message---- \n"); PRINTF1; PRINTF2; PRINTF3;} else j++;

if(j==sum) printf("\n this goods is not exist!"); bioskey(0); }

/*inquire according to in_num*/ inquire_count()

{int i,inquire_count,j=0; clrscr();

printf("\n please input the inquire in_num:"); scanf("%d",&inquire_count); for(i=0;i<sum;i++)

c语言

if(strcmp(goods[i].in_num,inquire_count)==0&&goods[i].num!=0) {printf("\n ----goods message----"); PRINTF1; PRINTF2; PRINTF3;} else j++;

if(j==sum) printf("\n this goods is not exist!"); bioskey(0); }

/*count goods message*/ count_message() {

int choice; do {

system("cls");

printf("\n\n **********count goods message**********\n\n"); printf(" 1: count the first kind of goods\n\n"); printf(" 2: count the secend kind of goods\n\n"); printf(" 3; count the third kind of goods\n\n"); printf(" 0: return\n\n"); printf(" please choose (0-3):"); scanf("%d",&choice); switch(choice) {

case 1: count_first_goods(); break;

case 2: count_secend_goods(); break;

case 3: count_third_goods(); break; case 0: break;

}

} while(choice!=0); }

/*count goods ji bie*/ count_first_goods() {int i,profit[MAX],j; clrscr();

for(i=0;i<sum;i++)

profit[i]=(goods[i].in_num-goods[i].amount)*(goods[i].out_price-goods[i].in_price);

c语言

printf("\n the first kind of goods : \n"); for(i=0;i<sum;i++) if(profit[i]>=500) {

PRINTF1; PRINTF2; PRINTF3;} else j++;

if(j==sum) printf("\n the goods is not exist!\n"); printf("\n press any key to return! \n"); bioskey(0); }

count_secend_goods() {int i,profit[MAX],j; system("cls");

for(i=0;i<sum;i++)

profit[i]=(goods[i].in_num-goods[i].amount)*(goods[i].out_price-goods[i].in_price); printf("\n the secend kind of goods : \n"); for(i=0;i<sum;i++)

if(profit[i]>=200&&profit[i]<500) {

PRINTF1; PRINTF2; PRINTF3;} else j++;

if(j==sum) printf("\n the goods is not exist!\n"); printf("\n press any key to return! \n"); bioskey(0); }

count_third_goods() {int i,profit[MAX],j; system("cls"); for(i=0;i<sum;i++)

profit[i]=(goods[i].in_num-goods[i].amount)*(goods[i].out_price-goods[i].in_price); printf("\n the third kind of goods : \n"); for(i=0;i<sum;i++) if(profit[i]<200) {

PRINTF1; PRINTF2; PRINTF3;} else j++;

if(j==sum) printf("\n the goods is not exist!\n"); printf("\n press any key to return! \n");

c语言

}

/*sort amount*/ sort_amount() {

struct goods *p,*q[MAX]; int i,j,k;

system("cls");

printf("\n sort amount\n");

printf("\n ----------------------------------------\n");

printf("\n rank num name kind amount\n"); p=goods;

for(i=0;i<sum;i++) q[i]=p++;

for(i=0;i<sum;i++) {

k=i;

for(j=i+1;j<sum;j++)

if(q[k]->amount<q[j]->amount) k=j; if(k!=i) {

p=q[i]; q[i]=q[k]; q[k]=p;

}

for(i=0;i<sum;i++)

printf("\n %6d %6d %8s %8s %5d\n",i+1,q[i]->num,q[i]->name,q[i]->kind,q[i]->amount);

bioskey(0); } }

/*sort profit*/ sort_profit()

{struct goods *p,*q[MAX]; int i,j,k; clrscr();

printf("\n sort profit \n");

printf(" ----------------------------------------------------\n");

printf("\n rank num name kind amount\n");

c语言

for(i=0;i<sum;i++) q[i …… 此处隐藏:3479字,全部文档内容请下载后查看。喜欢就下载吧 ……

c语言程序设计_超_市_管_理_系_统(3).doc 将本文的Word文档下载到电脑,方便复制、编辑、收藏和打印
本文链接:https://www.jiaowen.net/wenku/269874.html(转载请注明文章来源)
Copyright © 2020-2025 教文网 版权所有
声明 :本网站尊重并保护知识产权,根据《信息网络传播权保护条例》,如果我们转载的作品侵犯了您的权利,请在一个月内通知我们,我们会及时删除。
客服QQ:78024566 邮箱:78024566@qq.com
苏ICP备19068818号-2
Top
× 游客快捷下载通道(下载后可以自由复制和排版)
VIP包月下载
特价:29 元/月 原价:99元
低至 0.3 元/份 每月下载150
全站内容免费自由复制
VIP包月下载
特价:29 元/月 原价:99元
低至 0.3 元/份 每月下载150
全站内容免费自由复制
注:下载文档有可能出现无法下载或内容有问题,请联系客服协助您处理。
× 常见问题(客服时间:周一到周五 9:30-18:00)