




已阅读5页,还剩6页未读, 继续免费阅读
版权说明:本文档由用户提供并上传,收益归属内容提供方,若内容存在侵权,请进行举报或认领
文档简介
#include#include#include#include #define MAX 100char filename20; /*/FILE *fp;int n; /*/struct date /*/ int year;int mouth;int day; ;struct person /*/ char name10; /*/int age; /*/char job10; /*/char sex10; /*/char address20; /*/char phone10; /*/struct date in_time; /*/t,workerMAX;/*/void input()int i;system(cls);/system(cls);printf(nnn);scanf(%s,filename);printf(n);printf(nn);scanf(%d,&n);if(fp=fopen(filename,w)=NULL) printf(n);exit(0);for(i=0;in;i+) printf(%dn,i+1);printf(n);scanf(%s,);printf(n);scanf(%d,&workeri.age);printf(n);scanf(%s,workeri.job);printf(n);scanf(%s,workeri.sex);printf(n);scanf(%s,workeri.address);printf(n);scanf(%s,workeri.phone);printf(n);scanf(%d,&workeri.in_time.year);printf(n);scanf(%d,&workeri.in_time.mouth);printf(n);scanf(%d,&workeri.in_time.day);printf(n);getch();for(i=0;in;i+)fprintf(fp,%s %d %s %s %s %s %d-%d-%dn,,workeri.age,workeri.job,workeri.sex,workeri.address,workeri.phone,workeri.in_time.year,workeri.in_time.mouth,workeri.in_time.day);fclose(fp);/*/void output() int i;if(fp=fopen(filename,r)=NULL) printf( n);getch();exit(0);system(cls);printf( n);printf(tttttt n);for(i=0;in;i+) fscanf(fp,%s %d %s %s %s %s %d-%d-%d,,&workeri.age,workeri.job,workeri.sex,workeri.address,workeri.phone,&workeri.in_time.year,&workeri.in_time.mouth,&workeri.in_time.day);printf(%st%dt%st%st%st%st%d-%d-%d n,,workeri.age,workeri.job,workeri.sex,workeri.address,workeri.phone,workeri.in_time.year,workeri.in_time.mouth,workeri.in_time.day);fclose(fp);printf( n);getch();/*/void save() int i;if(fp=fopen(filename,w)=NULL) /*/ printf(n );exit(0);for(i=0;in;i+)fprintf(fp,%s %d %s %s %s %s %d-%d-%dn,,workeri.age,workeri.job,workeri.sex,workeri.address,workeri.phone,workeri.in_time.year,workeri.in_time.mouth,workeri.in_time.day);fclose(fp);/*/void read_message() int i;printf(n);scanf(%s,filename);printf(nn);scanf(%d,&n);if(fp=fopen(filename,r)=NULL) printf( n);getch();for(i=0;in;i+)fscanf(fp,%s %d %s %s %s %s %d-%d-%d,,&workeri.age,workeri.job,workeri.sex,workeri.address,workeri.phone,&workeri.in_time.year,&workeri.in_time.mouth,&workeri.in_time.day);fclose(fp);/*/void modify() int i,flag,choice; char ch,namekey10;flag=0;system(cls);printf( n);doprintf(n);scanf(%s,namekey);for(i=0;in;i+) if(strcmp(,namekey)=0) printf(y/n)n);printf(tttttt n);printf(%st%dt%st%st%st%st%d-%d-%d n,,workeri.age,workeri.job,workeri.sex,workeri.address,workeri.phone,workeri.in_time.year,workeri.in_time.mouth,workeri.in_time.day);getchar(); /*/ch=getchar();if(ch=y) printf( *nn);printf( *1,*nn);printf( *2,*nn);printf( *3,*nn);printf( *4,*nn);printf( *5,*nn);printf( *6,*nn);printf( *7,*nn);printf( *8,*nn);printf( *9,*nn);printf( (1-9)n);scanf(%d,&choice);switch(choice) case 1: printf(n);scanf(%s,); break;case 2: printf(n);scanf(%d,&workeri.age); break;case 3: printf(n);scanf(%s,workeri.job); break;case 4: printf(n);scanf(%s,workeri.sex); break;case 5: printf(n);scanf(%s,workeri.address); break;case 6: printf(n);scanf(%s,workeri.phone); break;case 7: printf(n);scanf(%d,&workeri.in_time.year); break;case 8: printf(n);scanf(%d,&workeri.in_time.mouth); break;case 9: printf(n);scanf(%d,&workeri.in_time.day); break;printf(n);printf(tttttt n);printf(%st%dt%st%st%st%st%d-%d-%d n,,workeri.age,workeri.job,workeri.sex,workeri.address,workeri.phone,workeri.in_time.year,workeri.in_time.mouth,workeri.in_time.day);else break;elseif(i=n) printf(n);printf(n(y/n)n);getchar(); /*/ch=getchar();if(ch=y) printf(n);flag=1;else flag=0;while(flag=1);printf(n) ;getch();/*/void add() int i,flag=0; char ch;system(cls);printf(n n);printf( *-*nn);do i=n;printf(n (,)n);printf(n);scanf(%s,);printf(n);scanf(%d, &workeri.age);printf(n);scanf(%s,workeri.job);printf( n);scanf(%s,workeri.sex);printf(n);scanf(%s,workeri.address);printf(n);scanf( %s,workeri.phone);printf(n);scanf(%d,&workeri.in_time.year);printf(n);scanf(%d,&workeri.in_time.mouth);printf(n);scanf(%d,&workeri.in_time.day);n+;printf(n(y/n)n);getchar(); /*/ch=getchar();if(ch=y) printf(n);flag=1;else flag=0;while(flag=1);printf(n) ;getch();/*/void del() int i,flag; char ch,namekey10;flag=0;system(cls);printf(n);do printf(n);scanf(%s,namekey);for(i=0;in;i+)if(strcmp(,namekey)=0) /*/ printf(y/n)n);printf(tttttt n);printf(%st%dt%st%st%st%st%d-%d-%d n,,workeri.age,workeri.job,workeri.sex,workeri.address,workeri.phone,workeri.in_time.year,workeri.in_time.mouth,workeri.in_time.day);getchar(); /*/ch=getchar();if(ch=y) for(;in;i+)workeri=workeri+1;n-;else break;elseif(i=n)printf(n);printf(n(y/n)n);getchar(); /*/ch=getchar();if(ch=y) printf(n);flag=1;else flag=0;while(flag=1);printf(n) ;getch();/*/void renew() int i;do system(cls);printf(nnn *nn);printf( 1nn);printf( 2nn);printf( 3nn);printf( 0,n);printf( (0-3)n);scanf(%d,&i);switch(i) case 1: add(); break;case 2: del(); break;case 3: modify(); break;case 0: break;while(i!=0);save();/*/void name_cha() int i,j; char namekey10;j=0;system(cls);printf( n);scanf(%s,namekey);for(i=0;in;i+)if(strcmp(,namekey)=0) /*/ printf(-n);printf(tttttt n);printf(%st%dt%st%st%st%st%d-%d-%d n,,workeri.age,workeri.job,workeri.sex,workeri.address,workeri.phone,workeri.in_time.year,workeri.in_time.mouth,workeri.in_time.day);else j+;if(j=n)printf(n);printf(n);getch();/*/void age_cha() int i,j; int agekey;j=0;system(cls);printf( n);scanf(%d,&agekey);for(i=0;in;i+)if(workeri.age=agekey) printf(-n);printf(tttttt n);printf(%st%dt%st%st%st%st%d-%d-%d n,,workeri.age,workeri.job,workeri.sex,workeri.address,workeri.phone,workeri.in_time.year,workeri.in_time.mouth,workeri.in_time.day);else j+;if(j=n)printf(n);printf(n);getch();/*/void job_cha() int i,j; char jobkey10;j=0;system(cls);printf(n);scanf(%s,jobkey);for(i=0;in;i+)if(strcmp(workeri.job,jobkey)=0) printf(-n);printf(tttttt n);printf(%st%dt%st%st%st%st%d-%d-%d n,,workeri.age,workeri.job,workeri.sex,workeri.address,workeri.phone,workeri.in_time.year,workeri.in_time.mouth,workeri.in_time.day);else j+;if(j=n)printf(n);printf(n);getch();/*/void inquire() int i;do system(cls);printf(nnn *nn);printf( *1,*nn);printf( *2,*nn);printf( *3,*nn);printf( *0,n);printf( (0-3)n);scanf(%d,&i);switch(i) case 1: name_cha();break;case 2: age_cha(); break;case 3: job_cha();break;case 0: break;while(i!=0);/*/void line() int i,j;system(cls);printf(-nn);for(i=0;in-1;i+)for(j=i+1;jworkerj.age) t=workeri;workeri=workerj;workerj=t;printf(tttttt n);for(i=0;in;i+)printf(%st%dt%st%st%st%st%d-%d-%d n,,workeri.age,workeri.job,workeri.sex,workeri.address,workeri.phone,workeri.in_time.year,workeri.in_time.mouth,workeri.in_time.day);printf(n);getch();/*/void count_age() int i,j; int agekey;j=0;system(cls);printf( n);scanf(%d,&agekey);for(i=0;in;i+)if(workeri.age=agekey) printf(-n);printf(tttttt n);printf(%st%dt%st%st%st%st%d-%d-%d n,,workeri.age,workeri.job,workeri.sex,workeri.address,workeri.phone,workeri.in_time.year,workeri.in_time.mouth,workeri.in_time.day);else j+;if(j=n)printf(n);printf(n);getch();/*/void count_job() int i,j; char jobkey10;j=0;system(cls);printf(n);scanf(%s,jobkey);for(i=0;in;i+)if(strcmp(workeri.job,jobkey)=0) printf(-n);printf(tttttt n);printf(%st%dt%st%st%st%st%d-%d-%d n,,workeri.age,workeri.job,workeri.sex,workeri.address,workeri.phone,workeri.in_time.year,workeri.in_time.mouth,workeri.in_time.day);else j+;if(j=n)printf(n);printf(n);getch();/*/void count_sex() int i,j; char sexkey10;j=0;system(cls);printf(n);scanf(%s,sexkey);for(i=0;in;i+)if(strcmp(workeri.sex,sexkey)=0) printf(-n);printf(tttttt n);printf(%st%dt%st%st%st%st%d-%d-%d n,,workeri.age,workeri.job,workeri.sex,workeri.address,workeri.phone,workeri.in_time.year,workeri.in_time.mouth,workeri.in_time.day);else j+;if(j=n)printf(n);printf(n);getch();/*/void count() int i;do system(cls);printf(nnn *nn);printf( 1,nn);printf( 2,nn);printf( 3,nn);printf( 0,nn);printf( (0-3):n);scanf(%d,&i);switch(i) case 1: count_age(); break;case 2: c
温馨提示
- 1. 本站所有资源如无特殊说明,都需要本地电脑安装OFFICE2007和PDF阅读器。图纸软件为CAD,CAXA,PROE,UG,SolidWorks等.压缩文件请下载最新的WinRAR软件解压。
- 2. 本站的文档不包含任何第三方提供的附件图纸等,如果需要附件,请联系上传者。文件的所有权益归上传用户所有。
- 3. 本站RAR压缩包中若带图纸,网页内容里面会有图纸预览,若没有图纸预览就没有图纸。
- 4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
- 5. 人人文库网仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对用户上传分享的文档内容本身不做任何修改或编辑,并不能对任何下载内容负责。
- 6. 下载文件中如有侵权或不适当内容,请与我们联系,我们立即纠正。
- 7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。
最新文档
- 电梯公司年会活动方案
- 铆工标准化作业考核试卷及答案
- 液氯气化处理工工艺创新考核试卷及答案
- 溶剂脱沥青装置操作工职业考核试卷及答案
- 景泰蓝磨蓝工5S管理考核试卷及答案
- 【地理】四川省眉山市东坡区部分学校2024-2025学年高一下学期4月期中试题(解析版)
- 煤层气集输工职业考核试卷及答案
- 国际集装箱标准比较分析报告
- 海洋勘探震源操作工应急处置考核试卷及答案
- 碳汇计量评估师技能巩固考核试卷及答案
- 2025年疫苗上岗证考试题及答案
- 2025中国载人eVTOL行业白皮书
- 2025中国人民抗日战争纪念馆招聘4人考试模拟试题及答案解析
- 2025年老年康复科老年康复护理技能评估试卷答案及解析
- 征地拆迁面试题目及答案
- 果树栽培工专业技能考核试卷及答案
- 航空科普课件
- 2025广西壮族自治区药用植物园招聘高层次人才21人备考试题及答案解析
- 2025-2026学年人教版(2024)初中地理八年级上册教学计划及进度表
- 电气运行基础知识培训课件
- 水工闸门操作培训
评论
0/150
提交评论