#include <stdio.h>?
struct complex?
{?
int re;?
int im;?
};?
void add(struct complex a, struct complex? b, struct complex *c)
{
c->re=a.re+b.re;
c->im=a.im+b.im;
}
void minus(struct complex a, struct complex? b, struct complex *c)
{
c->re=a.re-b.re;
c->im=a.im-b.im;
}
int main()?
{?
struct complex x,y,s,p;?
scanf("%d%d",&x.re,&x.im);?
scanf("%d%d",&y.re,&y.im);?
add(x,y,&s);?
printf(" sum=%5d+%5di\n",s.re,s.im);?
minus(x,y,&p);
printf(" product=%5d+%5di\n",p.re,p.im);?
}
擴展資料:
復數運算法則
1、加法交換律:z1+z2=z2+z1
2、乘法交換律:z1×z2=z2×z1
3、加法結合律:(z1+z2)+z3=z1+(z2+z3)
4、乘法結合律:(z1×z2)×z3=z1×(z2×z3)
5、分配律:z1×(z2+z3)=z1×z2+z1×z3