#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <math.h>
#include <map>
#include <string.h>
#include <queue>
const int N = 0x3f3f3f;
using namespace std;
typedef struct
{
float Realpart;//实部
float Imagepart;//虚部
}Complex;
void Create(Complex &C,float x,float y)
{
C.Realpart=x;//获得实部
C.Imagepart=y;//获得虚部
}
float GetReal(Complex C)
{
return C.Realpart;//获得实部
}
float GetImag(Complex C)
{
return C.Imagepart;//获得虚部
}
Complex Add(Complex C1,Complex C2)//复数加法
{
Complex sum;
sum.Realpart=C1.Realpart+C2.Realpart;
sum.Imagepart=C1.Imagepart+C2.Imagepart;
return sum;
}
Complex Sub(Complex C1,Complex C2)//复数减法
{
Complex difference;
difference.Realpart=C1.Realpart-C2.Realpart;
difference.Imagepart=C1.Imagepart-C2.Imagepart;
return difference;
}
int main()
{
Complex C1,C2,C3,C4,C5;
float x1,x2,y1,y2;
printf("
数据结构,,,复数的表示及加减运算
最新推荐文章于 2021-05-23 17:20:55 发布