zoukankan      html  css  js  c++  java
  • 习题9-2 计算两个复数之积(15 分)

    本题要求实现一个计算复数之积的简单函数。

    函数接口定义:

    struct complex multiply(struct complex x, struct complex y);
    

    其中struct complex是复数结构体,其定义如下:

    struct complex{
        int real;
        int imag;
    };
    

    裁判测试程序样例:

    #include <stdio.h>
    
    struct complex{
        int real;
        int imag;
    };
    
    struct complex multiply(struct complex x, struct complex y);
    
    int main()
    {
        struct complex product, x, y;
    
        scanf("%d%d%d%d", &x.real, &x.imag, &y.real, &y.imag);
        product = multiply(x, y);
        printf("(%d+%di) * (%d+%di) = %d + %di
    ", 
                x.real, x.imag, y.real, y.imag, product.real, product.imag);
    
        return 0;
    }
    
    /* 你的代码将被嵌在这里 */
    

    输入样例:

    3 4 5 6
    

    输出样例:

    (3+4i) * (5+6i) = -9 + 38i
    
    #include <stdio.h>
    
    struct complex{
        int real;
        int imag;
    };
    
    struct complex multiply(struct complex x, struct complex y);
    
    int main()
    {
        struct complex product, x, y;
    
        scanf("%d%d%d%d", &x.real, &x.imag, &y.real, &y.imag);
        product = multiply(x, y);
        printf("(%d+%di) * (%d+%di) = %d + %di
    ", 
                x.real, x.imag, y.real, y.imag, product.real, product.imag);
    
        return 0;
    }
    
    /* 你的代码将被嵌在这里 */
    
    struct complex multiply(struct complex x, struct complex y)
    {
        struct complex result;//struct complex相当于int 
        result.real=x.real*y.real-x.imag*y.imag;
        result.imag=x.real*y.imag+x.imag*y.real;
        return result;
    } 
  • 相关阅读:
    二逼平衡树(树套树)
    NOI2010 超级钢琴
    SDOI2011 消耗战
    HNOI2013 游走
    [SDOI2010]外星千足虫
    [UVA 11374]Airport Express
    [Luogu P1354]房间最短路问题
    [Luogu P2296][NOIP 2014]寻找道路
    高精度算法
    洛谷红名+AC150祭
  • 原文地址:https://www.cnblogs.com/2228212230qq/p/9268731.html
Copyright © 2011-2022 走看看