1.asp txt 员工工资查询系统 v1.8怎么和网站连接
2.求解一道C++程序设计的工资工资题目。。查询查询查(职工信息管理系统)
3.考勤管理系统
asp txt 员工工资查询系统 v1.8怎么和网站连接
该代码是系统系统txt格式的数据库,是源码源码蜗牛星际网页源码FSO读取文本文件,无需数据库链接函数。工资工资
楼主的查询查询查java非公平锁源码意思应该是如何放网站运行,请购买支持asp的系统系统网站空间,然后上传根目录,源码源码绑定域名,工资工资即可访问。查询查询查
更多疑问可以咨询软件留的系统系统练习方式或者访问软件留下的淘宝网址。
求解一道C++程序设计的源码源码题目。。工资工资多人斗地主源码 教程(职工信息管理系统)
根据你的查询查询查要求修改过,而且调试通过了~~~看看行不行
如果有问题可以直接和我QQ联系:
#include<iostream>
#include<string>
#include<fstream>
using namespace std;
const N=; // 定义系统可录入的系统系统员工最大数值
string Ename[N];
long Enum[N];
char Esex[N];
int Eage[N];
char Emarriage[N];
int Edepart[N];
int Eposition[N];
int Edegree[];
int Eworktime[N];
float Epay[N];
class Employee
{
public:
string Employeename;
long Employeenum;
char Employeesex;
int Employeeage;
char Employeemarriage;
int Employeedepart;
int Employeeposition;
int Employeedegree;
int Employeeworktime;
float Employeepay;
static long EmployeeMaxNum;
static float EmployeeBasePay;
void NewInfo();
void ShowInfo();
void showall();
void showdepart(int depart);
void showdegree(int degree);
void showage(int min,int max);
void shownum(long number);
void RefreshInfo();
void DeleteInfo();
float Pay(int Employeegrade);
static int MaxNum();
};
class DBOperate
{
public:
string Employeename;
long Employeenum;
char Employeesex;
int Employeeage;
char Employeemarriage;
int Employeedepart;
int Employeeposition;
int Employeedegree;
int Employeeworktime;
float Employeepay;
static long EmployeeMaxNum;
static float EmployeeBasePay;
void WriteIn(int iflag);
void ReadOut();
void RefreshMaxNum(int iflag); //i=1 or -1 or 0
};
long Employee::EmployeeMaxNum = ;
float Employee::EmployeeBasePay = ;
int Employee::MaxNum() //返回系统已经存储的人数
{
int MN = 0;
ifstream myf;
myf.open("EmployeeMaxNum.txt");
myf>>MN;
cout<<MN<<endl;
myf.close();
return MN;
}
void Employee::NewInfo() //添加新成员函数
{
cout<<"新员工姓名: ";
cin>>Employee::Employeename;
Employee::Employeenum = EmployeeMaxNum + Employee::MaxNum()+1;
cout<<"新员工性别 (F为女性,M为男性): ";
cin>>Employee::Employeesex;
cout<<"新员工年龄: ";
cin>>Employee::Employeeage;
cout<<"新员工婚姻状况(Y为已婚,精品php源码免费下载N为未婚): ";
cin>>Employee::Employeemarriage;
cout<<"新员工学历,请输入相应学历的序号: "<<endl;
cout<<" [1:初中 2:高中 3:本科 4:硕士 5:博士] ";
cin>>Employee::Employeedegree;
while(Employee::Employeedegree !=1&&Employee::Employeedegree !=2&&Employee::Employeedegree !=3&&Employee::Employeedegree !=4&&Employee::Employeedegree !=5)
{
cout<<"输入有误,请重新输入:"<<endl;
cout<<" [1:初中 2:高中 3:本科 4:硕士 5:博士]";
cin>>Employee::Employeedegree;
}
cout<<"新员工所在部门,请输入相应部门的序号:"<<endl;
cout<<" [1:董事会 2:市场部 3:公关部 4:客服中心 5:信息中心] ";
cin>>Employee::Employeedepart;
while(Employee::Employeedepart !=1&&Employee::Employeedepart !=2&&Employee::Employeedepart !=3&&Employee::Employeedepart !=4&&Employee::Employeedepart!=5)
{
cout<<"输入有误,请重新输入:"<<endl;
cout<<" [1:董事会 2:市场部 3:公关部 4:客服中心 5:信息中心] ";
cin>>Employee::Employeedepart;
}
cout<<"新员工职位,五一杯数学建模源码 请输入相应职位的序号: "<<endl;
cout<<" [1:临时职员 2: 正式职员 3:主任 4:部门经理 5:董事长] ";
cin>>Employee::Employeeposition;
while(Employee::Employeeposition !=1&&Employee::Employeeposition !=2&&Employee::Employeeposition !=3&&Employee::Employeeposition !=4&&Employee::Employeeposition !=5)
{
cout<<"输入有误,请重新输入:"<<endl;
cout<<" [1:临时职员 2: 正式职员 3:主任 4:部门经理 5:董事长] ";
cin>>Employee::Employeeposition;
}
cout<<"新员工的工作时(不需要输入单位): ";
cin>>Employee::Employeeworktime;
Employee::Employeepay = Employee::Pay(Employee::Employeeposition);
DBOperate dbo;
dbo.ReadOut();
int MaxNum = Employee::MaxNum();
Enum[MaxNum] = Employee::Employeenum;
Ename[MaxNum] = Employee::Employeename;
Esex[MaxNum] = Employee::Employeesex;
Eage[MaxNum] = Employee::Employeeage;
Emarriage[MaxNum] = Employee::Employeemarriage;
Edegree[MaxNum] = Employee::Employeedegree;
Edepart[MaxNum] = Employee::Employeedepart;
Eposition[MaxNum] = Employee::Employeeposition;
Eworktime[MaxNum] = Employee::Employeeworktime;
Epay[MaxNum] = Employee::Employeepay;
dbo.WriteIn(1);
cout<<" 添加新成员成功!"<<endl;
return;
}
void Employee::ShowInfo() //程序主体 数据输出函数
{
int choice1,choice2,min,max;
long searchnum;
Employee e;
cout<<" 请选择查询方式:"<<endl;
cout<<"
2024-11-25 10:39
2024-11-25 10:23
2024-11-25 10:10
2024-11-25 09:13
2024-11-25 08:41
2024-11-25 08:07