c++//作业//20191207

实验二

#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;

class Array
{
public:
    Array();
    Array(int *arr);
    Array operator +(Array a);
    void show();
private:
    int x[5];
};

Array::Array()
{
    for(int i=0;i<5;i++)
    {
        x[i]=0;
    }
}

Array::Array(int arr[5])
{
    for(int i=0;i<5;i++)
    {
        x[i]=*arr++;
    }
}

Array Array::operator +(Array a)
{
    Array t;
    for(int i=0;i<5;i++)
    {
        t.x[i]=a.x[i]+x[i];
    }
    return t;
}

void Array::show()
{
    for(int i=0;i<5;i++)
    {
        cout<<x[i]<<' ';
    }
    cout<<endl;
}

int main()
{
    int a[5]={1,2,3,4,5};
    int b[5]={6,7,8,9,10};
    Array a1(a);
    Array b1(b);
    Array c1;
    c1=a1+b1;
    c1.show();
}

实验三

#include<iostream>
using namespace std;
class Student
{
private:
	int no;
	string name;
	double score;
	static int totalNumber;
	static double totalScore;
	static double higestScore;
public:
	Student(int a, string b, double c) :no(a), name(b), score(c) {
	}
	void sum(Student *arr);
	void max(Student *arr);
	int print_(Student *arr);
};
int Student::totalNumber = 0;
double  Student::totalScore =0;
double Student::higestScore =0;
void Student::sum(Student *arr) 
{
	
	for (int i = 0; i < 5; i++)
	{ 
		totalNumber++;
		totalScore+= arr[i].score;
	}
}
void Student::max(Student* arr)
{
	for (int i = 0; i < 5; i++)
	{
		if (higestScore < arr[i].score)higestScore = arr[i].score;
	}
}
int Student::print_(Student *arr)
{
	for (int i = 0; i < 5; i++)
	{
		cout << "学号:" << arr[i].no <<"\t"
			<< "姓名:" << arr[i].name <<"\t"
			<< "成绩:" << arr[i].score <<"\t"
			<< endl;
	}
	cout << "学生总数:" << totalNumber;
	cout << "总成绩:"<< totalScore;
	cout << "最高成绩:"<< higestScore;
	return 0;
}

int main()
{
	Student member[5] = { Student(1001,"张小",91.5),
						  Student(1002,"李大",81),
						  Student(1003,"王中",71.5),
						  Student(1004,"马东",61.5),
						  Student(1005,"张北",58) };
	member[0].sum(member);
	member[0].max(member);
	member[0].print_(member);
}




发布了38 篇原创文章 · 获赞 2 · 访问量 1192

猜你喜欢

转载自blog.csdn.net/weixin_44811068/article/details/103435386