原题链接:蓝桥杯算法训练-P1103
解题思路:
注意事项:
参考代码:
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
typedef struct complex
{
double re;
double im;
}complex;
enum Option
{
ADD = 43,
SUB=45,
MUL=42,
DIV=47
};
complex* Add(complex* ret,complex c1, complex c2)
{
ret->re = c1.re + c2.re;
ret->im = c1.im + c2.im;
return ret;
}
complex* Sub(complex* ret, complex c1, complex c2)
{
ret->re = c1.re - c2.re;
ret->im = c1.im - c2.im;
return ret;
}
complex* Mul(complex* ret, complex c1, complex c2)
{
ret->re = c1.re*c2.re -c1.im*c2.im ;
ret->im = c1.re*c2.im+ c1.im*c2.re;
return ret;
}
complex* Div(complex* ret, complex c1, complex c2)
{
ret->re = (c1.re * c2.re +c1.im * c2.im)/(c2.re*c2.re+c2.im*c2.im);
ret->im = (c1.im * c2.re- c1.re * c2.im)/(c2.re * c2.re + c2.im * c2.im);
return ret;
}
int main()
{
complex* ret = (complex*)malloc(1 * sizeof(complex));
if (ret == NULL)
{
return;
}
char x = 0;
complex c1;
complex c2;
scanf("%c %lf %lf %lf %lf", &x, &c1.re, &c1.im, &c2.re, &c2.im);
switch (x)
{
case ADD:
ret = Add(ret,c1, c2);
break;
case SUB:
ret = Sub(ret,c1, c2);
break;
case MUL:
ret = Mul(ret,c1, c2);
break;
case DIV:
ret = Div(ret,c1, c2);
break;
}
printf("%0.2lf+%0.2lfi", ret->re, ret->im);
free(ret);
ret = NULL;
return 0;
}0.0分
2 人评分
C语言网提供由在职研发工程师或ACM蓝桥杯竞赛优秀选手录制的视频教程,并配有习题和答疑,点击了解:
一点编程也不会写的:零基础C语言学练课程
解决困扰你多年的C语言疑难杂症特性的C语言进阶课程
从零到写出一个爬虫的Python编程课程
只会语法写不出代码?手把手带你写100个编程真题的编程百练课程
信息学奥赛或C++选手的 必学C++课程
蓝桥杯ACM、信息学奥赛的必学课程:算法竞赛课入门课程
手把手讲解近五年真题的蓝桥杯辅导课程
发表评论 取消回复