學(xué)生籍貫信息管理系統(tǒng)(c)

1、l29, the company responsible for a variety of procedures for reimbursement document, invoice review, approval of work; 30, regularly convened general meeting of shareholders, preparation work for the meeting; 31, the company responsible for payroll management jobs, including around salary survey, em

2、ployee salary, salary accounting methods developed, payroll accounting, payment of wages, bonuses; 32, the company responsible for delivery of financial procedures; 33, according to the companys strategic development plan, the preparation and management of funds to meet day-to-day operating funding

3、requirements to ensure the companys safety, liquidity and profitability of the funds; 34, responsible for the environmental protection building materials Corporation issued by the Corporation Annual, monthly economic indicators in the assessment of the economic responsibility system of proposed amen

4、dments; 35, the company responsible for all types of contracts and tracking, implementation, implementation of the agreement, abnormality was detected in time to take appropriate measures and feedback to the leadership; 36, regular inspection, analysis, budget implementation of the business and fina

5、ncial performance, and to propose measures to increase revenue and reduce expenditure; 37, responsible for organizing the companys contracting business tenders; 38, responsible for preparing the annual budget and final accounts, distribution of profits, loss compensation plan; 39, responsible for th

6、e violations of financial discipline, or damage the companys interests (corruption and bribery) review of the Act; 40,學(xué)生籍貫信息管理系統(tǒng)(c).txt吃吧吃吧不是罪，再胖的人也有權(quán)利去增肥！苗條背后其實(shí)是憔悴，愛你的人不會(huì)在乎你的腰圍！嘗嘗闊別已久美食的滋味，就算撐死也是一種美！減肥最可怕的不是饑餓，而是你明明不餓但總覺得非得吃點(diǎn)什么才踏實(shí)。編制一個(gè)學(xué)生籍貫信息管理系統(tǒng)，每個(gè)學(xué)生信息包括：學(xué)號(hào)、姓名、籍貫。具體功能： （1）創(chuàng)建信息鏈表并以磁盤文件保存； （2）讀取磁盤文件并

7、顯示輸出所有學(xué)生的籍貫信息； （3）按學(xué)號(hào)或姓名查詢其籍貫； （4）按籍貫查詢并輸出該籍貫的所有學(xué)生； （5）能添加、刪除和修改學(xué)生的籍貫信息#include #include #define LEN sizeof(struct student)#define NULL 0struct studentlong num;char name20;char jg20;struct student *next;int n=0;void save(struct student *head) FILE *fp;char filename20;struct student *p1;printf(Please

8、 input the filenamen);scanf(%s,filename);if(fp=fopen(filename,w)=NULL) printf(cant open filen); return; for(p1=head;p1!=NULL;p1=p1-next) fprintf(fp,%ld,p1-num); fputc(t,fp); fprintf(fp,%s,p1-name); fputc(t,fp); fputc(t,fp); fprintf(fp,%s,p1-jg); fputc(n,fp); free(p1);fclose(fp);void print(struct stu

9、dent *head) struct student*p;printf(nNow,these information is:n);p=head;if(head!=NULL)do printf(%ldt%stt%sn,p-num,p-name,p-jg); p=p-next; while(p!=NULL);struct student *creat() struct student *head,*p1,*p2;char ch;p1=p2=(struct student *)malloc(LEN);printf(n Welcome to student jiguan system!n);print

10、f(Please input ones num,name and jiguann);printf(0 0 0:exitn);scanf(%ld%s%s,&p1-num,p1-name,p1-jg);head=NULL;while(p1-num!=0) n=n+1; if(n=1)head=p1; else p2-next=p1; p2=p1; p1=(struct student *)malloc(LEN); scanf(%ld%s%s,&p1-num,p1-name,p1-jg); p2-next=NULL;free(p1);printf(Save?Y/Nn);scanf(%c,&ch);s

11、canf(%c,&ch);if(ch=y|ch=Y) save(head);print(head);return(head);void loadf()FILE *fp;int N=n;char filename20;struct student *p1;p1=(struct student *)malloc(LEN);printf(Please input the filenamen);scanf(%s,filename);if(fp=fopen(filename,r)=NULL) printf(cannot open filen); return; printf(File has been

12、open:n);for (;N!=0;N-) fscanf(fp,%ld%s%s,&p1-num,p1-name,p1-jg); printf(%ldt%stt%sn,p1-num,p1-name,p1-jg); free(p1);fclose(fp);void xsearch(struct student*head)long num; struct student *p1,*p2; int c=0; printf(Please input the search number:n); scanf(%ld,&num); for(p1=head;p1!=NULL;p1=p1-next) if(nu

13、m=p1-num) c=c+1; printf(%ldt%stt%sn,p1-num,p1-name,p1-jg); printf(There are %d results!n,c); void nsearch(struct student*head)char name20; struct student *p1,*p2; int c=0; printf(Please input the search name:n); scanf(%s,name); for(p1=head;p1!=NULL;p1=p1-next) if(strcmp(name,p1-name)=0) c=c+1; print

14、f(%ldt%stt%sn,p1-num,p1-name,p1-jg); printf(There are %d results!n,c);void jsearch(struct student*head)char jg20; struct student *p1,*p2; int c=0; printf(Please input the search jiguan:n); scanf(%s,jg); for(p1=head;p1!=NULL;p1=p1-next) if(strcmp(jg,p1-jg)=0) c=c+1; printf(%ldt%stt%sn,p1-num,p1-name,

15、p1-jg); printf(There are %d results!n,c);void search(struct student*head) int a=4; for(;a!=0;) printf(nWelcome to student juguan system!n); printf(n search information systemn); printf( 0:exitn); printf( 1:use xuehao searchn); printf( 2:use name searchn); printf( 3:use jiguan searchn); printf(Please

16、 select:n); scanf(%d,&a); clrscr(); switch(a) case 0:printf(Thank you for playing!Bye!n); break; case 1:xsearch(head);break; case 2:nsearch(head);break; case 3:jsearch(head);break; default:printf(Choose error,choose again!n);break; struct student *del(struct student *head,struct student *p1) struct

17、student *p2; char ch; if(p1=NULL) printf(No result,cant manage!n); elseif(p1=head) head=p1-next; else for(p2=head;p2-next!=p1;p2=p2-next); p2-next=p1-next; n=n-1; printf(Save the change?Y/Nn); scanf(%c,&ch); scanf(%c,&ch); if(ch=y|ch=Y) save(head); free(p1); free(p2); return(head);void change(struct

18、 student *head,struct student *p1) char ch; if(p1=NULL) printf(No result,cant manage!n); elseprintf(Please input the new information of it.n); scanf(%ld%s%s,&p1-num,p1-name,p1-jg); printf(Save the change?Y/Nn); scanf(%c,&ch); scanf(%c,&ch); if(ch=y|ch=Y) save(head); struct student * add(struct stude

19、nt *head,struct student *p1) int a;char ch;struct student *p0,*p2;p0=p2=(struct student *)malloc(LEN);if(p1=NULL) printf(No result,cant manage!n);else printf(Please input the new students information.n); scanf(%ld%s%s,&p0-num,p0-name,p0-jg); printf(Where would you like to add?n); printf( 1:add befor

20、e itn); printf( 2:add after itn); scanf(%d,&a); switch(a) case 1:if(p1=head) p0-next=p1;head=p0; else for(p2=head;p2-next!=p1;p2=p2-next); p0-next=p1; p2-next=p0; break; case 2:if(p1-next=NULL) p1-next=p0; p0-next=NULL; else p2=p1-next; p0-next=p2; p1-next=p0; break; default:printf(Choose error,choo

21、se again!n); break; n=n+1;printf(Save the change?Y/Nn);scanf(%c,&ch);scanf(%c,&ch);if(ch=Y|ch=y) save(head); free(p0); free(p1); free(p2); return(head);struct student* inman(struct student*head) char ch; int a=4; long num; char name20; char jg20; struct student *p1; printf(Input its feature,so you c

22、an deal with it.n); printf( 0:exitn); printf( 1:input its numbern); printf( 2:input its namen); printf( 3:input its jiguann); scanf(%d,&a); clrscr(); switch(a) case 0:p1=NULL;break; case 1:printf(Please input the search number:n); scanf(%ld,&num); for(p1=head;p1!=NULL;p1=p1-next) if(num=p1-num) prin

23、tf(%ldt%stt%sn,p1-num,p1-name,p1-jg); printf(Is this one you want?n); printf(Y/Nn); scanf(%c,&ch); scanf(%c,&ch); if(ch=Y|ch=y) break; break; case 2:printf(Please input the search name:n); scanf(%s,name); for(p1=head;p1!=NULL;p1=p1-next) if(strcmp(name,p1-name)=0) printf(%ldt%stt%sn,p1-num,p1-name,p

24、1-jg); printf(Is this one you want?n); printf(Y/Nn); scanf(%c,&ch); scanf(%c,&ch); if(ch=Y|ch=y) break; break; case 3:printf(Please input the search jiguan:n); scanf(%s,jg); for(p1=head;p1!=NULL;p1=p1-next) if(strcmp(jg,p1-jg)=0) printf(%ldt%stt%sn,p1-num,p1-name,p1-jg); printf(Is this one you want?

25、n); printf(Y/Nn); scanf(%c,&ch); scanf(%c,&ch); if(ch=Y|ch=y) break; break; default:printf(Choose error,choose again!n);p1=NULL;break; if(p1=NULL) printf(Thats all!n);return p1;struct student * manage(struct student *head) struct student *p1;int a=4;p1=(struct student*)malloc(LEN);for(;a!=0;) printf(nWelcome to the student jiguan system!n); printf(n manage information system n); printf(What are you going to do?n); printf( 0:exitn); printf( 1:add informationn); printf( 2:delete infor