kiemtrac.cpp

examples C,c++ codes programs

/*	viet chuong trinh tuyen sinh voi 3 mon toan(he so 2) , ly , hoa		*/
	//diem thuong kv1+1, kv2+2,kv3+3
	//chung chi nghe +1, phong trao+1, thi quoc te+2, dan toc thieu so +2
	//diem thuong khong qua 3
	//diem trung tuyen Dai Hoc 25, Cao Dang 20
/* 	a. nhap ds va sap xep theo diem tang dan
   	b. in ds trung tuyen dai hoc
	c. in ds trung tuyen cao dang
	d. in 2 thi sinh co diem cao nhat
					*/

#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
#define MAX 50

void main (void)
{
	struct tuyensinh
	{ 
	char hoten[30]; int toan, li, hoa, diemth, tongd; int khuvuc, nghe, pt, qte, dantoc;
	};
tuyensinh ts[MAX];
char tam[10];
int i,n;
printf("Nhap vao so thi sinh : ");
gets(tam);
n=atoi(tam);

for(i=0;i<n;i++)
{
printf("*************************************************************************\n");
printf("Nhap vao du lieu cho thi sinh thu %d\n", i+1);
printf("ho ten : ");
gets(ts[i].hoten);

printf("Khu vuc : ");
gets(tam);
ts[i].khuvuc=atoi(tam);

printf("Diem toan : ");
gets(tam);
ts[i].toan=atoi(tam);

printf("Diem li : ");
gets(tam);
ts[i].li=atoi(tam);

printf("Diem hoa : ");
gets(tam);
ts[i].hoa=atoi(tam);

printf("co chung chi nghe nhap 1 neu khong co nhap 0     : ");
gets(tam);
ts[i].nghe=atoi(tam);

printf("co phong trao nhap 1 neu khong co nhap 0         : ");
gets(tam);
ts[i].pt=atoi(tam);

printf("co thi quoc te nhap 2 neu khong co nhap 0        : ");
gets(tam);
ts[i].qte=atoi(tam);

printf("la dan toc thieu so nhap 2 neu khong phai nhap 0 : ");
gets(tam);
ts[i].dantoc=atoi(tam);

ts[i].diemth=ts[i].khuvuc+ts[i].nghe+ts[i].pt+ts[i].qte+ts[i].dantoc;
if (ts[i].diemth>3) ts[i].diemth=3 ;
ts[i].tongd = 2*ts[i].toan + ts[i].li + ts[i].hoa + ts[i].diemth;
}

/*cau a*/
int j;
tuyensinh tg;
for(i=0;i<n-1;i++)
	for(j=i+1;j<n;j++)
	
	if (ts[i].toan>ts[j].toan)
	{
	tg=ts[i];
	ts[i]=ts[j];
	ts[j]=tg;
	};
// in danh sach
printf("   Hoten--------------Tong Diem\n");
for(i=0;i<n;i++)
printf("   %s                 %d \n",ts[i].hoten,ts[i].tongd);
getch();
}

//caub
for(i=0;i<n;i++)