C语言职工管理系统源代码及运行截图(简单版).doc

#include#include#define N 100typedef struct worker char name20; long number; int y,m,d; char zhicheng20; char bumen20; float salary;Worker;void Display() printf(nnntt*职工管理系统*nn); printf(ttt0.退tt 出n); printf(ttt1.新tt 建n); printf(ttt2.显tt 示n); printf(ttt3.查tt 询n); printf(ttt4.删tt 除nn);/*1.新 建*/void Add( Worker w,int n) int i; printf(t姓名t工号t进场时间t职称t部门t工资nn); for(i=0;i n;i+) printf(员工%d: ,i+1); scanf(%s %ld %d %d %d %s %s %f,,&wi.number, &wi.y,&wi.m,&wi.d,wi.zhicheng,wi.bumen,&wi.salary); /*2.显 示*/void Browse( Worker w,int n ) int i; printf(t姓名t工号t进场时间t职称t部门t工资nn); for(i=0;i n;i+) printf(员工%d:,i+1); printf(%st%ldt%d-%d-%dt%st%st%fnn,,wi.number,wi.y,wi.m,wi.d,wi.zhicheng,wi.bumen,wi.salary); /*3.1查询姓名*/void SearchName( Worker w,int n ) char name20; int i; printf(ttt输入要查询的名字:); scanf(%s,name); for( i = 0; i n; i + ) if( strcmp( ,name ) = 0 ) printf(nttt查得信息如下:nn); printf(姓名t工号t进场时间t职称t部门t工资nn); printf(%st%ldt%d-%d-%dt%st%st%fnn,,wi.number,wi.y,wi.m,wi.d,wi.zhicheng,wi.bumen,wi.salary); return; printf(ttt查无此人！);/*3.2查询工号*/void SearchNumber( Worker w,int n ) long number; int i,k=0; printf(ttt输入要查询的工号:); scanf(%ld,&number); for( i = 0; i n; i + ) if( wi.number = number ) printf(nttt查得信息如下:nn); printf(姓名t工号t进场时间t职称t部门t工资nn); printf(%st%ldt%d-%d-%dt%st%st%fnn,,wi.number,wi.y,wi.m,wi.d,wi.zhicheng,wi.bumen,wi.salary); return; printf(nttt查无此人！);/*3.查 询*/void Search( Worker w,int n ) int x; printf(ttt选择查询方式(1.姓名/2.工号):); scanf(%d,&x); printf(n); switch(x) case 1: SearchName(w,n); break; case 2: SearchNumber(w,n); break; /*4.删 除*/void Delete( Worker w,int n ) char name20; int i,j; printf(ttt输入要删除的名字:); scanf(%s,name); printf(n); for( i = 0; i n; i + ) if( strcmp( ,name ) = 0 ) printf(ttt将删除以下信息:nn); printf(t姓名t工号t进场时间t职称t部门t工资nn); printf(t%st%ldt%d-%d-%dt%st%st%fnn,,wi.number,wi.y,wi.m,wi.d,wi.zhicheng,wi.bumen,wi.salary); for( j = i;jn-1;j+ ) wj = wj+1; printf(ttt成功删除！nn); return; printf(ttt查无此人！);void Run( Worker w,int n ) int choice; do Display(); printf(ttt输入你的选择:); scanf(%d,&choice); printf(n); switch( choice ) case 0: break; case 1: Add(w,n); break; case 2: Browse(w,n); break; case 3: Search(w,n); break; cas