c语言职工档案管理,职工档案及简明信息生成 C语言 程序设计 谢谢啊

满意答案

02ae427d08e371d7e90d5b995e828d6d.png

andrew_512

2014.01.01

02ae427d08e371d7e90d5b995e828d6d.png

采纳率:48%    等级:7

已帮助:211人

亲自测试

#include

#include

#include

struct wk_long

{

char name[30];

char sex[10];

unsigned int nId;

unsigned int nAge;

};

struct wk_s

{

char name[30];

unsigned int nAge;

};

int Readin(wk_long workerS[], int nLength)

{

for (int i = 0; i < nLength; ++i)

{

printf("Please input the %d worker Information:\n", i+1);

printf("Please input the Nmae:");

scanf("%s", workerS[i].name);

printf("Please input the Sex:");

scanf("%s",workerS[i].sex);

printf("please input the ID:");

scanf("%d", &workerS[i].nId);

printf("please input the nAge:");

scanf("%d",&workerS[i].nAge);

}

return 0;

}

int Display(wk_long* pWorker)

{

printf("Name: %s\n", pWorker->name);

printf("Sex: %s\n", pWorker->sex);

printf("Id: %-5d\n", pWorker->nId);

printf("Age: %d\n", pWorker->nAge);

return 0;

}

int select(wk_long* pWorkers, wk_s* pWks, int nLen)

{

for (int i = 0; i < nLen; ++i)

{

strcpy(pWks[i].name,pWorkers[i].name);

pWks[i].nAge = pWorkers[i].nAge;

}

return 0;

}

int delwk(wk_s* pWks, wk_long* pWorkers, int nInd)

{

if (pWks[nInd].name[0] == 0)

{

printf("The people of the index is not in the simple list\n");

return 0;

}

memset(&pWks[nInd], 0, sizeof(wk_s));

memset(&pWorkers[nInd], 0, sizeof(wk_long));

printf("The Information about the index of the list is deleted\n");

}

int DisplayHelp(void)

{

printf("1. 输入数据\n");

printf("2. 显示原始数据\n");

printf("3. 制作简明数据\n");

printf("4. 删除简明数据\n");

printf("5. Goodbye!\n");

printf("Input 1-5:\n");

return 0;

}

int main()

{

wk_long workers[10];

memset(workers,0,sizeof(workers));

wk_s wkShort[10];

memset(wkShort, 0, sizeof(wkShort));

int nInput;

int nInd;

while (1)

{

DisplayHelp();

scanf("%d", &nInput);

switch(nInput)

{

case 1:

Readin(workers, 10);

break;

case 2:

for (int i = 0; i < 10; ++i)

{

if(workers[i].name[0] != '\0')

{

printf("The information of the %d number in the List:\n", i+1);

Display(&workers[i]);

}

}

break;

case 3:

select(workers, wkShort, 10);

break;

case 4:

printf("Please Input The delete index:");

scanf("%d", &nInd);

delwk(wkShort, workers, nInd);

break;

case 5:

return 0;

break;

default:

break;

}

}

return 0;

}

00分享举报

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值