学生成绩管理系统V1.0

某班有最多不超过30人(具体人数由键盘输入)参加某门课程的考试,用一维数组作函数参数 编程实现如下学生成绩管理:

(1)录入每个学生的学号和考试成绩;

(2)计算课程的总分和平均分;

(3)按成绩由高到低排出名次表;

(4)按学号由小到大排出成绩表;

(5)按学号查询学生排名及其考试成绩;

(6)按优秀(90~100)、良好(80~89)、中等(70~79)、及格(60~69)、不及格(0~59)5个类别,统计每个类别的人数以及所占的百分比;

(7)输出每个学生的学号、考试成绩。

复制代码
#include <iostream>
#include <iomanip>
using namespace std;
void input(int a[], float b[],int);
void caculate(float a[],int);
void sort_in_descending_order_by_score(int a[], float b[],int);
void sort_in_ascending_order_by_number(int a[],float b[],int);
void search(int a[],float b[],int);
void statistic(float a[],int);
int main()
{
	int n;
	cout << "Input student number(n<30):";
	cin >> n;
	int choice;
	int xvehao[30];
	float score[30];
	while (1)
	{
		cout << endl;
		cout << "Management for Students' scores" << endl;
		cout << "1.Input record" << endl;
		cout << "2.Caculate total and average score of course" << endl;
		cout << "3.Sort in descending order by score" << endl;
		cout << "4.Sort in ascending order by number" << endl;
		cout << "5.Search by number" << endl;
		cout << "6.Statistic analysis" << endl;
		cout << "7.List record" << endl;
		cout << "0.Exit" << endl;
		cout << "Please Input your choice:";
		cin >> choice;

		if (choice == 1)input(xvehao, score, n);
		else if (choice == 2)caculate(score, n);
		else if (choice == 3)sort_in_descending_order_by_score(xvehao, score, n);
		else if (choice == 4)sort_in_ascending_order_by_number(xvehao, score, n);
		else if (choice == 5)search(xvehao, score, n);
		else if (choice == 6)statistic(score, n);
		else if (choice == 7)sort_in_ascending_order_by_number(xvehao, score, n);
		else if (choice == 0)break;
		else
		{
			cout << "Please input any number from 0 to 7!"<<endl; continue;
		}
	}
	return 0;
}
void input(int a[], float b[],int n)
{
	int i;
	cout << "Input student's ID, name and score:" << endl;
	for (i = 1; i <= n; i++)
	{
		cin >> a[i] >> b[i];
	}
	
}
void caculate(float a[], int n)
{
	float sum=0,aver;
	int i;
	for (i = 1; i <= n; i++)
	{
		sum += a[i];
	}
	aver = sum / n;
	cout << "sum=" << sum << " , aver=" << fixed << setprecision(2) << aver;
	cout << endl;
}
void sort_in_descending_order_by_score(int a[], float b[], int n)
{
	int i, j,k;
	for (i = 1; i <= n; i++)
	{
		k = i;
		for (j = i+1; j <= n ; j++)
		{
			if (b[k] < b[j])k = j;
		}
		int x = a[i], y = b[i];
		a[i] = a[k]; b[i] = b[k];
		a[k] = x; b[k] = y;
	}
	for (i = 1; i <= n; i++)
	{
		cout << a[i] << " " << b[i] << endl;
	}
}
void sort_in_ascending_order_by_number(int a[], float b[], int n)
{
	int i, j,k;
	for (i = 1; i <= n; i++)
	{
		k = i;
		for (j = i + 1; j <= n; j++)
		{
			if (a[j] < a[k])k = j;
		}
		int x = a[i], y = b[i];
		a[i] = a[k]; b[i] = b[k];
		a[k] = x; b[k] = y;
	}
	for (i = 1; i <= n; i++)
	{
		cout << a[i] << " " << b[i] << endl;
	}
}
void search(int a[], float b[], int n)
{
	int number;
	cin >> number;
	int i,k;
	for (i = 1; i <= n; i++)
	{
		if (a[i] == number)
		{
			cout << a[i] << " " << b[i]<<endl;
			k = 1;
			break;
		}
		else k = 0;
	}
	if (k == 0)cout << "Can't find this student!"<<endl;
}
void statistic(float a[], int n)
{
	int i;
	int A = 0, B = 0, C = 0, D = 0, E = 0, F = 0;
	for (i = 1; i <= n; i++)
	{
		if (a[i] == 100)A++;
		else if (a[i] >= 90 && a[i] <= 99)B++;
		else if (a[i] >= 80 && a[i] <= 89)C++;
		else if (a[i] >= 70 && a[i] <= 79)D++;
		else if (a[i] >= 60 && a[i] <= 69)E++;
		else F++;
	}
	cout << "<60 "  << F<< " " <<fixed<<setprecision(2)<< ((float)F / n) * 100 << "%" << endl;
	cout << "60-69 "  << E<< " " << fixed << setprecision(2) << ((float)E / n) * 100 << "%" << endl;
	cout << "70-79 "  << D<< " " << fixed << setprecision(2) << ((float)D / n) * 100 << "%" << endl;
	cout << "80-89 "  << C<< " " << fixed << setprecision(2) << ((float)C / n) *100<< "%"<<endl;
	cout << "90-99 "  << B<< " " << fixed << setprecision(2) << ((float)B / n) * 100 << "%" << endl;
	cout << "100 "  << A<< " " << fixed << setprecision(2) << ((float)A / n) * 100 << "%" << endl;
}
相关推荐
杜子不疼.9 小时前
【C++ AI 大模型接入 SDK】 - DeepSeek 模型接入(上)
开发语言·c++·chatgpt
石山代码10 小时前
C++ 内存分区 堆区
java·开发语言·c++
心中有国也有家10 小时前
cann-recipes-infer:昇腾 NPU 推理的“菜谱集合”
经验分享·笔记·学习·算法
绝知此事10 小时前
【算法突围 01】线性结构与哈希表:后端开发的收纳术
java·数据结构·算法·面试·jdk·散列表
碧海银沙音频科技研究院11 小时前
通话AEC与语音识别AEC的软硬回采链路
深度学习·算法·语音识别
csdn_aspnet11 小时前
Python 算法快闪 LeetCode 编号 70 - 爬楼梯
python·算法·leetcode·职场和发展
张小姐的猫12 小时前
【Linux】多线程 —— 线程互斥
linux·运维·服务器·c++
m0_6294947314 小时前
LeetCode 热题 100-----26.环形链表 II
数据结构·算法·leetcode·链表
壹号用户14 小时前
用队列实现栈
数据结构·算法