Truyen2U.Net quay lại rồi đây! Các bạn truy cập Truyen2U.Com. Mong các bạn tiếp tục ủng hộ truy cập tên miền mới này nhé! Mãi yêu... ♥

ke thua

#include"stdio.h"

#include"conio.h"

#include"iomanip.h"

#include"iostream.h"

#include"string.h"

class sinhvien

{ private :

char masv[5];

char ten[30];

int nsinh;

char gt[5];

float mon1,mon2;

public :

void nhap();

void xuat();

float m1()

{ return mon1; }

float m2()

{ return mon2; }

};

void sinhvien::nhap()

{ cout<<"

nhap ma sinh vien :"; gets(masv);

cout<<"

nhap ho ten:"; gets(ten);

cout<<"

nhap ngay thang nam sinh :"; cin>>(nsinh);

cout<<"

nhap diem mon1,mon2 :"; cin>>mon1>>mon2;

};

void sinhvien::xuat()

{ cout<<"

"<<setw(3)<<masv<<setw(15)<<ten<<setw(5)<<nsinh<<setw(3)<<mon1<<setw(3)<<mon2;

};

class cntt:private sinhvien

{ private :

float ltc;

float ctdl;

float toanrr;

float dtb;

char lop[10];

public :

void nhapcntt();

void xuatcntt();

friend void maxdiemcntt(cntt *sv,int n);

friend void sapxepcntt(cntt *sv,int n);

friend void hocbongcntt(cntt *sv,int n);

};

void cntt::nhapcntt()

{ nhap();

cout<<"

nhap diem ltc , ctdl , toanrr :"; cin>>ltc>>ctdl>>toanrr;

dtb=(m1()+m2()+ltc+ctdl+toanrr)/5;

cout<<"

nhap lop :"; gets(lop);

};

void cntt::xuatcntt()

{ xuat();

cout<<setw(3)<<ltc<<setw(3)<<ctdl<<setw(3)<<toanrr<<setw(5)<<dtb<<setw(10)<<lop;

};

void maxdiemcntt(cntt *sv,int n)

{ int i;

cntt m;

m=sv[1];

for(i=1;i<=n;i++)

if (sv[i].dtb>m.dtb ) m=sv[i];

cout<<"

masv hoten ngaysinh gioitinh mon1 mon2 ltc ctdl toanrr dtb lop";

m.xuatcntt();

};

void sapxepcntt(cntt *sv,int n)

{ int i,j;

cntt tg;

for(i=1;i<n;i++)

for(j=i+1;j<=n;j++)

if (sv[i].dtb<sv[j].dtb)

{ tg=sv[j];

sv[j]=sv[i];

sv[i]=tg;

}

cout<<"

danh sach sinh vien khoa cntt sau khi sap xep la";

cout<<"

masv hoten ngaysinh gioitinh mon1 mon2 ltc ctdl toanrr dtb lop";

for(i=1;i<=n;i++)

sv[i].xuatcntt();

};

void hocbongcntt(cntt *sv,int n)

{ int t,i,j;

cntt tg;

t=int(n*90/100);

for(i=1;i<n;i++)

for(j=i+1;j<=n;j++)

if (sv[i].dtb<

sv[j].dtb)

{ tg=sv[j];

sv[j]=sv[i];

sv[i]=tg;

}

for(i=1;i<=t;i++)

if ( sv[i].dtb>7 )

sv[i].xuatcntt();

};

class cokhi:private sinhvien

{ private :

float ctmay;

float vekt;

float tl;

float dtb;

char lop[10];

public :

void nhapck();

void xuatck();

friend void maxdiemck(cokhi *sv,int n);

friend void sapxepck(cokhi *sv,int n);

friend void hocbongck(cokhi *sv,int n);

};

void cokhi::nhapck()

{ nhap();

cout<<"

nhap diem ctmay , vekt , tl :"; cin>>ctmay>>vekt>>tl;

dtb=(m1()+m2()+ctmay+vekt+tl)/5;

cout<<"

nhap lop :"; gets(lop);

};

void cokhi::xuatck()

{ xuat();

cout<<setw(3)<<ctmay<<setw(3)<<vekt<<setw(3)<<tl<<setw(5)<<dtb<<setw(10)<<lop;

};

void maxdiemck(cokhi *sv,int n)

{ int i;

cokhi max;

max=sv[1];

for(i=1;i<=n;i++)

if (sv[i].dtb>max.dtb ) max=sv[i];

cout<<"

masv hoten ngaysinh gioitinh mon1 mon2 ctmay vekt tl dtb lop";

max.xuatck();

};

void sapxepck(cokhi *sv,int n)

{ int i,j;

cokhi tg;

for(i=1;i<n;i++)

for(j=i+1;j<=n;j++)

if (sv[i].dtb<sv[j].dtb)

{ tg=sv[j];

sv[j]=sv[i];

sv[i]=tg;

}

cout<<"

danh sach sinh vien khoa cokhi sau khi sap xep la";

cout<<"

masv hoten ngaysinh gioitinh mon1 mon2 ctmay vekt tl dtb lop";

for(i=1;i<=n;i++)

sv[i].xuatck();

};

void hocbongck(cokhi *sv,int n)

{ int t,i,j;

cokhi tg;

t=int(n*90/100);

for(i=1;i<n;i++)

for(j=i+1;j<=n;j++)

if (sv[i].dtb< sv[j].dtb)

{ tg=sv[j];

sv[j]=sv[i];

sv[i]=tg;

}

for(i=1;i<=t;i++)

if ( sv[i].dtb>7 )

sv[i].xuatck();

};

void main()

{ clrscr();

cntt sv[100];

cokhi sv1[100];

int i,j,m,n,chon,ch,traloi;

do

{ cout<<"

ban muon chon khoa nao";

cout<<"

cntt (0) , cokhi (1) ";

cin>>chon;

if (chon==0)

{ cout<<"

nhap so sinh vien :";

cin>>n;

cout<<"

nhap danh sach sinh vien:";

for(i=1;i<=n;i++)

sv[i].nhapcntt();

cout<<"

danh sach sinh vien khoa cntt ";

cout<<"

masv hoten ngaysinh gioitinh mon1 mon2 ltc ctdl toanrr dtb lop";

for(i=1;i<=n;i++)

sv[i].xuatcntt();

do

{ cout<<"

ban muon chon j ? ";

cout<<"

xem sv co diem cao nhat [1]";

cout<<"

sap xep danh sach sv tang dan [2]";

cout<<"

tim sv co hoc bong [3]";

cin>>ch;

if (ch==2)

{ sapxepcntt(sv,n); }

if (ch==1)

{ cout<<"

sinh vien co diem cao nhat khoa cntt la:";

maxdiemcntt(sv,n);}

if (ch==3)

{ cout<<"

nhung sv duoc hoc bong:";

hocbongcntt(sv,n); }

cout<<"

ban co muon chon lai khong";

cin>>traloi;

}

while (traloi==1);

}

if (chon==1)

{ cout<<"

nhap so sinh vien :";

cin>>m;

cout<<"

nhap danh sach sinh vien:";

for(i=1;i<=m;i++)

sv1[i].nhapck();

cout<<"

danh sach sinh vien khoa cokhi ";

cout<<"

masv hoten ngaysinh gioitinh mon1 mon2 ctmay vekt tl dtb lop";

for(i=1;i<=m;i++)

sv1[i].xuatck();

do

{ cout<<"

ban muon xem j ?";

cout<<"

danh sach sv sap xep giam dan [1]:";

cout<<"

sinh vien co diem cao nhat khoa [2]:";

cout<<"

nhung sinh vien duoc hoc bong [3];";

cin>>ch;

if (ch==1)

{ sapxepck(sv1,m); }

if (ch==2)

{ cout<<"

sinh vien co diem cao nhat khoa cokhi la:";

maxdiemck(sv1,m); }

if (ch==3)

{ cout<<"

nhung sv duoc hoc bong:";

hocbongck(sv1,m); }

cout<<"

ban muon chon lai khong ?:";

cin>>traloi;

}

while (traloi==1);

}

cout<<"

ban co muon chon lai khong ?";

cin>>traloi; }

while (traloi==1);

getch();

}

Bạn đang đọc truyện trên: Truyen2U.Com

Tags: #phương