原 c语言实现的简单学生管理系统,C++实现简单的学生管理系统

C++实现简单的学生管理系统

//Student.cpp

#include

using namespace std;

struct Stu

{

char no[10];

char name[16];

int math;

int chi;

double ave;

};

class Student

{

public:

Stu st;

Student * next;

public:

Student(){}

Student(Stu s)

{

st=s;

next=NULL;

st.ave=(st.math+st.chi)/2.0;

}

void setst(Stu s)

{

st=s;

st.ave=(st.math+st.chi)/2.0;

}

Stu getst()

{

return st;

}

void show()

{

cout<

cout<

cout<

cout<

cout<

cout<

cout<

}

};

//main.cpp

#include

#include"Student.cpp"

using namespace std;

Student * create_List();

void traverse_List(Student * pHead);

bool is_empty(Student * pHead);

int length_List(Student * pHead);

bool insert_List(Student * pHead,int position,Stu st);

bool delete_List(Student * pHead,int position,Stu * st);

void sort_List(Student * pHead);

void menu_select();

void handle_menu(int s);

void outFile();

Student * inFile();

void delFile();

Student * pHead;

void main()

{

menu_select();

}

void menu_select()

{

int s;

cout<

cout<

cout<

cout<

cout<

cout<

cout<

cout<

cout<

cout<

cout<

cin>>s;

handle_menu(s);

}

void handle_menu(int s)

{

switch (s)

{

case 1:

{

system("cls");

pHead=create_List();

system("cls");

menu_select();

break;

}

case 2:

{

if(NULL==pHead)

{

cout<

getchar();

getchar();

system("cls");

menu_select();

}

system("cls");

sort_List(pHead);

traverse_List(pHead);

getchar();

getchar();

system("cls");

menu_select();

break;

}

case 3:

{

if(pHead!=NULL)

{

system("cls");

outFile();

system("cls");

menu_select();

}

system("cls");

menu_select();

break;

}

case 4:

{

system("cls");

pHead=inFile();

system("cls");

menu_select();

break;

}

case 5:

{

system("cls");

delFile();

system("cls");

menu_select();

break;

}

case 6:

{

if(NULL==pHead)

{

cout<

getchar();

getchar();

system("cls");

menu_select();

}

system("cls");

int num;

Stu st;

traverse_List(pHead);

cout<

cin>>num;

cout<

cout<

cin>>st.no;

cout<

cin>>st.name;

cout<

cin>>st.math;

cout<

cin>>st.chi;

if(insert_List(pHead,num-1,st))

{

cout<

}

else

{

cout<

}

getchar();

getchar();

system("cls");

menu_select();

break;

}

case 7:

{

if(NULL==pHead)

{

cout<

getchar();

getchar();

system("cls");

menu_select();

}

int num;

Stu * st=(Stu *)malloc(sizeof(Stu));

traverse_List(pHead);

cout<

cin>>num;

if(delete_List(pHead,num,st))

{

cout<

cout<no<name<

}

else

{

cout<

}

getchar();

getchar();

system("cls");

menu_select();

break;

}

case 8:

{

if(NULL!=pHead)

{

system("cls");

cout<

getchar();

getchar();

system("cls");

menu_select();

}

else

{

cout<

getchar();

getchar();

system("cls");

menu_select();

}

break;

}

case 9:

{

system("cls");

cout<

exit(0);

break;

}

}

}

void delFile()

{

ofstream fileout;

fileout.open("c:\\kcsj.txt",ios_base::out);

fileout<

fileout.close();

}

Student * inFile()

{

Student * pHead=(Student *)malloc(sizeof(Student));

if(NULL==pHead)

{

cout<

exit(0);

}

Student * pTail=pHead;

pTail->next=NULL;

ifstream in("c:\\kcsj.txt");

if (!in.is_open())

{

cout << "Error opening file"<

exit(0);

}

while (!in.eof())

{

Stu st;

in.read(reinterpret_cast(&st), sizeof(st));

if (in.fail())

{

break;

}

Student * pNew=new Student();

if(NULL==pNew)

{

printf("分配失败,程序终止\n");

exit(0);

}

pNew->setst(st);

pTail->next=pNew;

pNew->next=NULL;

pTail=pNew;

}

in.close();

return pHead;

}

void outFile()

{

ofstream out;

out.open("c:\\kcsj.txt",ios_base::out|ios_base::app|ios::binary);

if(!out)

{

cout<

out.close();

out.open("stu.dat",ios_base::out|ios::binary);

}

else

{

out.close();

out.open("c:\\kcsj.txt",ios_base::out|ios_base::app|ios::binary);

}

Student * temp=pHead->next;

while(temp!=NULL)

{

Stu st=temp->getst();

out.write(reinterpret_cast(&st), sizeof(st));

temp=temp->next;

}

out.close();

}

Student * create_List()

{

int len;

Student * pHead=(Student *)malloc(sizeof(Student));

if(NULL==pHead)

{

cout<

exit(0);

}

Student * pTail=pHead;

pTail->next=NULL;

cout<

cin>>len;

for(int i=0;i

{

Stu st;

cout<

cin>>st.no;

cout<

cin>>st.name;

cout<

cin>>st.math;

cout<

cin>>st.chi;

Student * pNew=new Student();

if(NULL==pNew)

{

printf("分配失败,程序终止\n");

exit(0);

}

pNew->setst(st);

pTail->next=pNew;

pNew->next=NULL;

pTail=pNew;

}

return pHead;

}

void traverse_List(Student * pHead)

{

int i=1;

Student * temp=pHead->next;

while(temp!=NULL)

{

cout<

temp->show();

temp=temp->next;

i++;

}

}

bool is_empty(Student * pHead)

{

if(NULL==pHead->next)

{

return true;

}

else

{

return false;

}

}

int length_List(Student * pHead)

{

int len=0;

Student * temp=pHead->next;

while(temp)

{

len++;

temp=temp->next;

}

return len;

}

bool insert_List(Student * pHead,int position,Stu st)

{

int i=0;

Student * p=pHead;

while(NULL!=p&&i

{

p=p->next;

i++;

}

if(i>position-i||NULL==p)

{

return false;

}

Student * pNew=(Student *)malloc(sizeof(Student));

if(NULL==pNew)

{

cout<

exit(0);

}

pNew->setst(st);

pNew->next=p->next;

p->next=pNew;

return true;

}

bool delete_List(Student * pHead,int position,Stu * st)

{

int i=0;

Student * p=pHead;

while(NULL!=p->next&&i

{

p=p->next;

i++;

}

Student * q=p->next;

*st=q->getst();

p->next=p->next->next;

free(q);

q=NULL;

return true;

}

void sort_List(Student * pHead)

{

Student * p,* q;

Stu temp;

int i,j;

int len=length_List(pHead);

for(i=0,p=pHead->next;inext)

{

for(j=i+1,q=p->next;jnext)

{

if(q->st.ave>p->st.ave)

{

temp=q->st;

q->st=p->st;

p->st=temp;

}

}

}

}

以上所述就是本文的全部内容了，希望大家能够喜欢。