1:运算符重载之Complex
查看提交统计提问
总时间限制: 1000ms 内存限制: 10000kB
描述
使用友元函数方法定义复数类Complex的加减运算符重载函数。
#include
using namespace std;
class Complex
{
private:
double real,imag;
public:
// 在此处补充你的代码
};
int main()
{
double d1,d2,b1,b2;
cin>>d1>>d2>>b1>>b2;
Complex c1(d1,d2),c2(b1,b2),c3;
c3 = c1+c2;
print(c3);
c3 = c1-c2;
print(c3);
c3 = 3.5+c2;
print(c3);
return 0;
}
输入
两个复数的实部和虚部,共四个double数字
输出
三行,加法和减法计算结果以及3.5与复数对象加法的结果
样例输入
3 4
7 6
样例输出
10+10i
-4-2i
10.5+6i
#include<iostream>
using namespace std;
class Complex {
private:
double real,imag;
public:
Complex() {
real = imag = 0;
}
Complex(double r) {
real = r;
imag = 0;
}
Complex(double r,double i) {
real = r;
imag = i;
}
friend Complex operator + (const Complex &c1,const Complex &c2) {
return Complex(c1.real + c2.real,c1.imag + c2.imag);
}
friend Complex operator - (const Complex &c1,const Complex &c2) {
return Complex(c1.real - c2.real,c1.imag - c2.imag);
}
friend void print(const Complex &c) {
if(c.imag<0) {
cout<<c.real<<c.imag<<"i"<<endl;
} else {
cout<<c.real<<"+"<<c.imag<<"i"<<endl;
}
}
};
int main() {
double d1,d2,b1,b2;
cin>>d1>>d2>>b1>>b2;
Complex c1(d1,d2),c2(b1,b2),c3;
c3 = c1+c2;
print(c3);
c3 = c1-c2;
print(c3);
c3 = 3.5+c2;
print(c3);
return 0;
}
2:运算符重载之Matrix
查看提交统计提问
总时间限制: 10000ms 内存限制: 10000kB
描述
定义矩阵类Matrix的加减运算符重载函数。矩阵为2行3列整型矩阵。
#include
using namespace std;
class Matrix{
private:
int M[4][4];
public:
Matrix()
{int i,j;
for(i=0;i<4;i++)
for(j=0;j<4;j++)
M[i][j]=0; }
Matrix(int a,int b)
{
int i,j;
for(i=0;i<a;i++)
for(j=0;j<b;j++)
cin>>M[i][j];
}
// 在此处补充你的代码
};
int main()
{
Matrix x1(2,3),x2(2,3),x3;
x3 = x1+x2;
Print(x3);
x3 = x1-x2;
Print(x3);
return 0;
}
输入
两个矩阵
输出
两个矩阵加减运算结果
样例输入
6 7 8
4 5 6
2 2 2
3 3 3
样例输出
8 9 10
7 8 9
4 5 6
1 2 3
#include<iostream>
using namespace std;
class Matrix{
private:
int M[4][4];
public:
Matrix()
{int i,j;
for(i=0;i<4;i++)
for(j=0;j<4;j++)
M[i][j]=0; }
Matrix(int a,int b)
{
int i,j;
for(i=0;i<a;i++)
for(j=0;j<b;j++)
cin>>M[i][j];
}
friend Matrix operator + (const Matrix &m1,const Matrix &m2)
{
Matrix m3;
for(int i=0;i<2;i++)
{
for(int j=0;j<3;j++)
{
m3.M[i][j]= m1.M[i][j] + m2.M[i][j];
}
}
return m3;
}
friend Matrix operator - (const Matrix &m1,const Matrix &m2)
{
Matrix m3;
for(int i=0;i<2;i++)
{
for(int j=0;j<3;j++)
{
m3.M[i][j]= m1.M[i][j] - m2.M[i][j];
}
}
return m3;
}
friend void Print(const Matrix &m3)
{
for(int i=0;i<2;i++)
{
for(int j=0;j<3;j++)
{
cout<<m3.M[i][j]<<" ";
}
cout<<endl;
}
}
};
int main()
{
Matrix x1(2,3),x2(2,3),x3;
x3 = x1+x2;
Print(x3);
x3 = x1-x2;
Print(x3);
return 0;
}
#include<iostream>
using namespace std;
class Matrix
{
private:
int num[10][10];
public:
Matrix(int n[][10]);
Matrix()
{
num[3][10] = 0;
}
void show();
friend Matrix operator+(Matrix &c1, Matrix &c2);
};
Matrix::Matrix(int n[][10])
{
int i,j;
for( i = 0;i<3;i++)
{
for(j = 0;j<2;j++)
num[i][j] = n[i][j];
}
}
Matrix operator+(Matrix &c1, Matrix &c2)
{
int i ,j ;
Matrix c3;
for( i = 0;i<3;i++)
{
for(j = 0;j<2;j++)
{
c3.num[i][j] = c1.num[i][j] + c2.num[i][j];
}
}
return c3;
}
void Matrix::show()
{
int i ,j ;
for( i = 0;i<3;i++)
{
for( j = 0;j<1;j++)
cout << num[i][j] << " ";
cout << num[i][j] << endl;
}
cout <<endl;
}
int main()
{
int i , j;
int s1[10][10],s2[10][10];
for(i = 0 ;i<3;i++)
{
for( j = 0;j<2;j++)
cin >> s1[i][j];
}
Matrix c1(s1);
for( i = 0;i<3;i++)
{
for( j = 0;j<2;j++)
cin >> s2[i][j];
}
Matrix c2(s2);
Matrix c3;
c3 = c1 + c2;
c3.show();
return 0;
}
3:运算符重载之Vector
查看提交统计提问
总时间限制: 10000ms 内存限制: 65535kB
描述
定义向量类Vector的乘法(内积)运算符重载函数。
#include
using namespace std;
class Vector{
private:
int v[100]={0};
public:
Vector()
{ }
Vector(int a)
{
for(int i=0;i<a;i++)
cin>>v[i];
}
// 在此处补充你的代码
};
int main()
{
Vector v1(10),v2(10);
cout<<v1*v2<<endl;
return 0;
}
输入
两个向量
输出
两个向量内积结果
样例输入
1 1 1 1 1 1 1 1 1 1
2 2 2 2 2 2 2 2 2 2
样例输出
20
#include<iostream>
using namespace std;
class Vector {
private:
int v[100]= {0};
public:
Vector() {
}
Vector(int a) {
for(int i=0; i<a; i++)
cin>>v[i];
}
// 在此处补充你的代码
friend int operator *(const Vector &v1,const Vector &v2) {
Vector v3;
int number=0;
for(int i=0; i<100; i++)
v3.v[i] = v1.v[i]*v2.v[i];
for(int i=0; i<100; i++)
number+=v3.v[i];
return number;
}
};
int main() {
Vector v1(10),v2(10);
cout<<v1*v2<<endl;
return 0;
}