test

最新推荐文章于 2022-08-22 08:59:05 发布

ThingsDone

最新推荐文章于 2022-08-22 08:59:05 发布

阅读量169

点赞数

分类专栏： PAT-乙级

本文链接：https://blog.csdn.net/welby_fight/article/details/80150460

版权

PAT-乙级专栏收录该内容

3 篇文章 0 订阅

订阅专栏

#include<stdio.h>
double result(double w[],double a[]);
int main()
{
    double w[9] = {0.268743,0.032687,0.115256,0.044407,0.049361,0.076748,0.104634,0.111857,0.196303}; //权值
    double b[9][3]; //9行3列;
    int i,j;
    double res[3];
    for(i = 0;i < 9;i++)
    {
        for(j = 0;j < 3;j++)
        {
            scanf("%lf",&b[i][j]);
        }
    }

    for(i = 0;i < 3;i++)
    {
        double t[9];
        for(j = 0;j < 9;j++)
        {
             t[j] = b[j][i];
        }
        res[i] = result(w,t);
    }

    printf("\nresult:");
    for(i = 0;i < 3;i++)
    {
        printf("%.6f ",res[i]);
    }
    printf("\n");

    return 0;
}

double result(double w[],double a[])
{

    int i = 0;
    double min[9];//两两比较，得到9个最小的数
    for(i = 0;i < 9;i++)
    {
        if(w[i] < a[i])
        {
            min[i] = w[i];
        }
        else
        {
            min[i] = a[i];
        }
    }

    double max = min[0]; //9个最小的数比较，得到一个最大值
    for(i = 0;i < 9;i++)
    {
        if(min[i] > max)
        {
            max = min[i];
        }
    }
    return max;
}