C PRIME PLUS---------------------------------------第十章编程题

已于 2022-07-15 23:30:43 修改
阅读量300 收藏
点赞数
分类专栏： C语言学习 文章标签： c语言
于 2022-07-15 23:04:58 首次发布
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/m0_58378145/article/details/125808533
版权

10-1

#include <stdio.h>
#define MONTHS 12    // number of months in a year
#define YEARS   5    // number of years of data
int main(void)
{
    // initializing rainfall data for 2010 - 2014
    const float rain[YEARS][MONTHS] =
    {
        {4.3,4.3,4.3,3.0,2.0,1.2,0.2,0.2,0.4,2.4,3.5,6.6},
        {8.5,8.2,1.2,1.6,2.4,0.0,5.2,0.9,0.3,0.9,1.4,7.3},
        {9.1,8.5,6.7,4.3,2.1,0.8,0.2,0.2,1.1,2.3,6.1,8.4},
        {7.2,9.9,8.4,3.3,1.2,0.8,0.4,0.0,0.6,1.7,4.3,6.2},
        {7.6,5.6,3.8,2.8,3.8,0.2,0.0,0.0,0.0,1.3,2.6,5.2}
    };
    int year, month;
    float subtot, total;

    printf(" YEAR    RAINFALL  (inches)\n");
    for (year = 0, total = 0; year < YEARS; year++)
    {             // for each year, sum rainfall for each month
        for (month = 0, subtot = 0; month < MONTHS; month++)
            subtot += *((*rain + year)+ month) ;
        printf("%5d %15.1f\n", 2010 + year, subtot);
        total += subtot; // total for all years
    }
    printf("\nThe yearly average is %.1f inches.\n\n",
        total / YEARS);
    printf("MONTHLY AVERAGES:\n\n");
    printf(" Jan  Feb  Mar  Apr  May  Jun  Jul  Aug  Sep  Oct ");
    printf(" Nov  Dec\n");

    for (month = 0; month < MONTHS; month++)
    {             // for each month, sum rainfall over years
        for (year = 0, subtot = 0; year < YEARS; year++)
            subtot += *(*(rain + year) + month);
        printf("%4.1f ", subtot / YEARS);
    }
    printf("\n");

    return 0;
}

10-2

#include <stdio.h>
void copy_arr(double arr1[], double arr2[], int n);
void copy_ptr(double* pt1, double* pt2, int n);
void copy_ptrs(double* pt1, double* start, double* end);

int main(void)
{
    double source[5] = { 1.1,2.2,3.3,4.4,5.5 };
    double target1[5];
    double target2[5];
    double target3[5];

    copy_arr(target1, source, 5);
    copy_ptr(target2, source, 5);
    copy_ptrs(target3, source, source+5);
    return 0;
}
void copy_arr(double arr2[], double arr1[], int n)
{
    for (int i = 0; i < n; i++)
    {
        arr2[i] = arr1[i];
        printf("%4.1lf", arr2[i]);
    }
    printf("\n");
}

void copy_ptr(double *pt2, double *pt1, int n)
{
    for (int i = 0; i < n; pt1++, pt2++, i++)
    {
        *pt2 = *pt1;
        printf("%4.1lf", *pt2);
    }
    printf("\n");
}

void copy_ptrs(double* pt1, double* start, double * end)
{
    while (start < end)
    {
        *pt1 = *start;
        printf("%4.1lf", *pt1);
        pt1++;
        start++;
    }
    printf("\n");
}

10-3

#include <stdio.h>
void Find_Biggest(int arr[], int m);

int main(void)
{
    int digits[100] = { 2,4,12,65,34,1000 };
    Find_Biggest(digits,100);
    return 0;
}

void Find_Biggest(int arr[], int m)
{
    int biggest = arr[0];
    for (int i = 1; i < m; i++)
    {
        if (biggest < arr[i])
            biggest = arr[i];
    }
    printf("数组中最大的数为%d", biggest);
}

10-4

#include <stdio.h>
void Find_Biggest(double arr[], int m);

int main(void)
{
    double digits[50] = { 2,4,12,65,34,1000 };
    Find_Biggest(digits,50);
    return 0;
}

void Find_Biggest(double arr[], int m)
{
    double biggest = arr[0];
    int flag = 0;
    for (int i = 1; i < m; i++)
    {
        if (biggest < arr[i])
        {
            biggest = arr[i];
            flag = i;
        }
    }
    printf("数组中最大值的下标为%d",flag);
}

10-5

#include <stdio.h>
void Find_Biggest_Dvalue(double arr[], int m);

int main(void)
{
    double digits[6] = { 2,4,12,65,34,1000 };
    Find_Biggest_Dvalue(digits,6);
    return 0;
}

void Find_Biggest_Dvalue(double arr[], int m)
{
    double biggest = arr[0];
    double smallest = arr[0];
  
    for (int i = 1; i < m; i++)
    {
        if (biggest < arr[i])
        {
            biggest = arr[i];
           
        }
        if (smallest > arr[i])
        {
            smallest = arr[i];
        }
    }
    printf("数组中最大值和最小值的差值为%.1lf",biggest-smallest);
}

10-6

#include <stdio.h>
void Reverse_Order(double arr[], int m);

int main(void)
{
    double digits[6] = { 2,4,12,65,34,1000 };
     Reverse_Order(digits,6);
    return 0;
}

 void Reverse_Order(double arr[], int m)
{
    
    for (int i = m-1; i>=0; i--)
    {
        printf("%5.1lf", arr[i]);
    }
   
}

10-7

#include <stdio.h>
void copy_ptrs(double* pt1, double* start, double* end);
void copy_2D(double(*pt1)[4], double(*pt2)[4], int m);

int main(void)
{
    double source[6][4] = { {2,4,12,65},
                            {1,2,3,4},
                            {5,6,7,8},
                            {9,10,11,12},
                            {13,14,15,16},
                            {17,18,19,20}
    };
    double target[6][4];
    copy_2D(target, source, 6);
    return 0;
}

void copy_2D(double(*pt1)[4],double(*pt2)[4],int m)
{
    for (int i = 0; i < m; i++)
    {
        copy_ptrs(pt1+i, pt2+i, *(pt2+i) + 4);
    }
}

void copy_ptrs(double* pt1, double* start, double* end)
{
    while (start < end)
    {
        *pt1 = *start;
        printf("%5.1lf", *pt1);
        pt1++;
        start++;
    }
    printf("\n");
}

10-8

#include <stdio.h>
void copy_ptrs(double* pt1, double* start, double* end);

int main(void)
{
    double source[7] = {1,2,3,4,5,6,7};
    double target[3];
    copy_ptrs(target, source + 2, source + 5);
    return 0;
}



void copy_ptrs(double* pt1, double* start, double* end)
{
    while (start < end)
    {
        *pt1 = *start;
        printf("%5.1lf", *pt1);
        pt1++;
        start++;
    }
    printf("\n");
}

10-9 ----------无法编译变长数组，只能用处理N*5的数组。

#include <stdio.h>
void copy(double source[][5], double target[][5], int m);
void show(double ar1[][5], double ar2[][5], int m);

int main(void)
{
    double source[3][5] = {
                             {1,2,3,4,5},
                             {6,7,8,9,10},
                             {11,12,13,14,15}
    };
    double target[3][5];
    copy(source,target,3);
    show(source, target, 3);
    return 0;
}

void copy( double source[ ][5],double target[][5],int m)
{
    for (int i = 0; i < m; i++)
    {
        for (int j = 0; j < 5; j++)
            target[i][j] = source[i][j];
    }
}

void show(double ar1[][5], double ar2[][5], int m)
{
    printf("第一个数组为：\n");
    for (int i = 0; i < m; i++)
    {
        for (int j = 0; j < 5; j++)
            printf("%5.1lf", ar1[i][j]);
        printf("\n");
    }
    printf("第二个数组为：\n");
    for (int i = 0; i < m; i++)
    {
        for (int j = 0; j < 5; j++)
            printf("%5.1lf", ar1[i][j]);
        printf("\n");
    }
}

10-10

#include <stdio.h>
void sum(int arr1[], int arr2[], int arr3[], int m);
int main(void)
{
    int arr1[5] = { 1,2,3,4,5 };
    int arr2[5] = { 1,2,3,4,5 };
    int arr3[5];
    sum(arr1, arr2, arr3, 5);
    return 0;
}
void sum(int arr1[], int arr2[], int arr3[], int m)
{
    for (int i = 0; i < m; i++)
    {
        arr3[i] = arr1[i] + arr2[i];
        printf("%3d", arr3[i]);
    }
}

10-11

#include <stdio.h>
void show(int arr1[][5], int m);
void Two_Times(int source[][5], int target[][5], int m);
int main(void)
{
    int arr1[3][5] = {
                        {1,2,3,4,5},
                        {6,7,8,9,10},
                        {11,12,13,14,15}
    };
    int arr2[3][5];
    printf("原数组为：\n");
    show(arr1, 3);
    Two_Times(arr1,arr2,3);
    printf("变换后的数组为：\n");
    show(arr2, 3);
    return 0;
}

void show(int arr1[][5], int m)
{
    for (int i = 0; i < m; i++)
    {
        for (int j = 0; j < 5; j++)
            printf("%3d", arr1[i][j]);
        printf("\n");
    }
}

void Two_Times(int source[][5],int target [][5],int m)
{
    for (int i = 0; i < m; i++)
    {
        for (int j = 0; j < 5; j++)
           target[i][j]= 2* source[i][j];
    }
}

10-12

#include <stdio.h>

void Average_year(double arr[][12], int m);
void Average_month(double arr[][12], int m);
int main(void)
{
    double rain[5][12] =
    {
        {4.3,4.3,4.3,3.0,2.0,1.2,0.2,0.2,0.4,2.4,3.5,6.6},
        {8.5,8.2,1.2,1.6,2.4,0.0,5.2,0.9,0.3,0.9,1.4,7.3},
        {9.1,8.5,6.7,4.3,2.1,0.8,0.2,0.2,1.1,2.3,6.1,8.4},
        {7.2,9.9,8.4,3.3,1.2,0.8,0.4,0.0,0.6,1.7,4.3,6.2},
        {7.6,5.6,3.8,2.8,3.8,0.2,0.0,0.0,0.0,1.3,2.6,5.2}
    };
     Average_year(rain,5);
    Average_month(rain,5);
    return 0;
}

void Average_year( double arr[][12],int m)
{
    double average = 0;
    double total = 0;
   
    for (int i = 0; i < m; i++)
    {
        double sum = 0;
        for (int j = 0; j < 12; j++)
        {
            sum += arr[i][j];
            total += arr[i][j];
        }
        printf("%d的年降雨量为%lf\n", i + 2010, sum);
    }
    printf("年平均降雨量为%lf.\n", total / 5);
}

void Average_month(double arr[][12],int m)
{

    for (int i = 0; i < 12; i++)
    {
        double sum = 0;
        for (int j = 0; j < m; j++)
        {
            sum += arr[j][i];
        }
        printf("%d月的平均降雨量为%lf\n",1+i, sum/5);
    }
}

10-13--------输出函数不是一个

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
void storage(double arr[][5], int m);
double Average_row(double arr[], int m);
void Average(double arr[][5], int m);
double Find_max(double arr[][5], int m);
void show_result(double arr[][5], int m);
int main(void)
{
    double source[3][5];
    storage(source,3);
    for (int i = 0; i < 3; i++)
    {
        Average_row(source[i], 5);
    }
    Average(source, 3);
    Find_max(source, 3);
    show_result(source, 3);
    return 0;
}
void storage(double arr[][5], int m)
{
    for (int i = 0; i < m; i++)
    {
        printf("请输入1组数，每组数包含5个double类型的数：\n");
        for (int j = 0; j < 5; j++)
            scanf("%lf", &arr[i][j]);
    }
}
double Average_row(double arr[], int m)
{
    double sum = 0;
    for (int i = 0; i < m; i++)
    {
        sum += arr[i];
    }   
    printf("每行的平均值为%lf.\n", sum / m);
    return sum / 5;
}
void Average(double arr[][5], int m)
{
    double sum = 0;
    for (int i = 0; i < m; i++)
    {
        for (int j = 0; j < 5; j++)
        {
            sum += arr[i][j];
        }
    }
    printf("所有数据平均值为%lf.\n", sum /(m*5) );
}
double Find_max(double arr[][5], int m)
{
    double max = arr[0][0];
    for(int i = 0;i< m;i++)
        for (int j = 0; j < 5; j++)
        {
            if (max < arr[i][j])
                max = arr[i][j];
        }
    printf("所有数据的最大值为%lf.\n",max);
    return max;
}
void show_result(double arr[][5], int m)
{
    printf("let us check the arreys:\n");
    printf("the arrey you input is ;\n");
    for (int i = 0; i < m; i++)
    {
        for (int j = 0; j < 5; j++)
            printf("%lf", arr[i][j]);
        printf("\n");
    }
}

10-13---输出函数是一个

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
void storage(double arr[][5], int m);
double Average_row(double arr[], int m);
double Average(double arr[][5], int m);
double Find_max(double arr[][5], int m);
void show_result(double arr[][5], int m);
int main(void)
{
    double source[3][5];
    storage(source, 3);
    show_result(source, 3);
    return 0;
}
void storage(double arr[][5], int m)
{
    for (int i = 0; i < m; i++)
    {
        printf("请输入1组数，每组数包含5个double类型的数：\n");
        for (int j = 0; j < 5; j++)
            scanf("%lf", &arr[i][j]);
    }
}
double Average_row(double arr[], int m)
{
    double sum = 0;
    for (int i = 0; i < m; i++)
    {
        sum += arr[i];
    }
   // printf("每行的平均值为%lf.\n", sum / m);
    return sum / 5;
}
double  Average(double arr[][5], int m)
{
    double sum = 0;
    for (int i = 0; i < m; i++)
    {
        for (int j = 0; j < 5; j++)
        {
            sum += arr[i][j];
        }
    }
    //printf("所有数据平均值为%lf.\n", sum / (m * 5));
    return (sum / (m * 5));
}
double Find_max(double arr[][5], int m)
{
    double max = arr[0][0];
    for (int i = 0; i < m; i++)
        for (int j = 0; j < 5; j++)
        {
            if (max < arr[i][j])
                max = arr[i][j];
        }
    //printf("所有数据的最大值为%lf.\n", max);
    return max;
}
void show_result(double arr[][5], int m)
{
    printf("let us check the arreys:\n");
    printf("the arrey you input is ;\n");
    for (int i = 0; i < m; i++)
    {
        for (int j = 0; j < 5; j++)
            printf("%5.1lf", arr[i][j]);
        printf("\n");
    }
    //  最大值
    printf("所有数据的最大值%3.1lf\n", Find_max(arr, 3));
    //平均值
    printf("每组的平均值%3.1lf\n", Average(arr, 3));
    //每组平均值
    for (int i = 0; i < 3; i++)
    {
        printf("第%d行的平均值为%3.1lf\n", i + 1, Average_row(arr[i], 5));
    }
}

m0_58378145
关注
专栏目录
MyBatis-Plus 入门与实践
.G();的博客
06-27 1117
MyBatis-Plus入门与实践
MyBatis-Plus数据安全保护(加密解密)
tongxin_tongmeng的博客
01-16 3823
项目创建、POM依赖、YML配置、SQL脚本、代码生成、加密算法、字段加密、加密测试、自定义算法
hive-site.xml 参数设置
遥望......
03-26 3721
<?xml version="1.0"?> <?xml-stylesheet type="text/xsl" href="configuration.xsl"?> <!-- Licensed to the Apache Software Foundation (ASF) under one or more contributor license agre...
C++ prime plus-4-编程练习
m0_52484587的博客
09-19 244
【代码】C++ prime plus-4。
mybatis-plus无spring框架
like_wen的博客
12-02 3298
mybatis-plus无spring框架 非spring使用mybatis-plus 无springboot mybatis
UTF-8 常用标点
geng1025的博客
07-09 1346
Chrome 和 Opera 的支持是很好的，而 IE 11+ 和 Firefox 35+ 支持所有实体。如果字符没有 HTML 实体，则可以使用十进制（dec）或十六进制（hex）引用。如果您希望在 HTML 中显示特殊字符，可以使用下表中的 HTML 实体。较老的浏览器可能不支持下表中的所有 HTML5 实体。
C-study(七)
tyj98的博客
07-05 683
C_primer_plus study 分支
c-prime-plus 函数探幽
技术宅拯救世界
09-24 111
c++c++c++c++
LangChain - Chain
AI + 工程
04-09 1354
1、概览 为什么我们需要链? 2、快速入门 (Get started) - Using `LLMChain` 多个变量 使用字典输入 在 `LLMChain` 中使用聊天模型： 3、异步 API 4、不同的调用方法 `__call__`调用 仅返回输出键值 return_only_outputs 只有一个输出键 run 只有一个输入键 5、自定义chain 6、调试链 (Debugging chains) 7、从 LangChainHub 加载 8、添加记忆（state） 9、序列化 将chain 保存到
C - 数组与指针
如图所示
07-26 178
对 C prime plus 一书 ，第十章指针与数组的笔记
E15233_PRIME_B365-PLUS_UM_WEB.pdf
05-14
B365M-A采用4+2相供电设计，CPU采用单8pin供电，提供了四条DDR4内存插槽，一个有金属装甲保护的PCI-E 3.0 x16插槽和两个PCI-E 3.0 x1插槽，M.2接口有两个，SATA 6Gbps...C，两个PS/2，视频接口包括DVI-D、VGA、HDMI。
C++-primer-plus(第6版)中文版-编程练习答案(word版).doc
11-09
C++ Primer Plus 第6版 编程练习答案 C++ 是一门功能强大且灵活的编程语言，本资源提供的是 C++ Primer Plus 第6版 的编程练习答案，涵盖了多个章节和练习题。下面是对每个练习的详细解释和知识点总结： 第二章：...
肝细胞癌miR-516a-3p的致瘤机制和代谢影响
工程16（2022）162研究肝细胞癌-文献miR-516 a-3 p是一种新的肝癌致瘤活性和细胞代谢的陶瑞a，张学友b，c，石峰b，c，黄海涛b，c，詹少伟b，c，谢海洋b，c，周林b，c，郑树森b，c，刘晓波，齐玲b，c，刘a浙江大学...
[循环和关系表达式]——C++ Prime Plus-ch5
m0_58378145的博客
10-03 301
学习记录
[分支语句和逻辑运算符]——C++ Prime Plus-ch6
m0_58378145的博客
10-06 321
学习
细究C/C++函数指针
sun_0228的博客
10-07 828
C/C++函数指针，std::function用法
【C语言刷力扣】1678.设计Goal解析器
2301_76779875的博客
10-08 382
【C语言刷力扣】1678.设计Goal解析器
C语言-文件IO
m0_69032433的博客
10-08 1289
linux操作系统把对文件的操作封装成了多个函数，统称为linux系统IO。文件描述符(File descirptor) 是一个用来访问文件的抽象化概念文件描述符是一个正整数(进程文件表项下标)，一个被打开的文件对应着一个文件描述符linux中，每个进程(暂时理解程序)都会自动打开3个文件：功能 文件描述符 对应的宏。
Windows10的MinGW安装和VS Code配置C/C++编译环境
最新发布
weixin_41011452的博客
10-09 1264
在VS Code上配置gcc编译链
C++ Prime Plus学习笔记：从基础到进阶
"C++ Prime Plus个人学习笔记"是一份由某位程序员在学习C++ Prime Plus教材时整理的学习资料。这份文档主要涵盖了C++语言的基础概念和重要特性，包括C++的历史、语言特性、编译器使用以及基本编程技巧。 首先，C++...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值