C语言程序设计现代方法第二版第十一章答案

最新推荐文章于 2024-06-25 11:21:01 发布

一剑如鸿影-

最新推荐文章于 2024-06-25 11:21:01 发布

阅读量2.8k

点赞数 3

本文链接：https://blog.csdn.net/qq_29445129/article/details/105265119

版权

本文提供C语言程序设计现代方法第二版第十一章的习题解答，涵盖函数指针、动态内存分配等核心概念，帮助读者深入理解C语言高级特性。

摘要由CSDN通过智能技术生成

1：

#include<stdio.h>
void pay_amonut(int dollars,int*twenties,int *tens,int *fives,int *ones);
int main(void)
{
   
	int x;
	printf("Enter a dollar amount:");
	scanf("%d",&x);
	int twenties,tens,fives,ones;
	 pay_amonut(x,&twenties,&tens,&fives,&ones);
	 return 0;
}
void pay_amonut(int dollars,int *twenties,int *tens,int *fives,int *ones){
   
	
	
	
	printf("\n\n");
	*twenties=dollars/20;
	printf("$20 bills: %d\n",*twenties);
	dollars=dollars-20*(*twenties);
	*tens=dollars/10;
	printf("$10 bills: %d\n",*tens);
	dollars=dollars-10*(*tens);
	*fives=dollars/5;
	printf("$5 bills: %d\n",*fives);

	dollars=dollars-5*(*fives);
	*ones=dollars;
	printf("$1 bills: %d\n",*ones);
}

2：

#include<stdio.h>
#include<math.h>
void find_closest_flight(int desired_time,int *departure_time,int *arrival_time);
int main(void)
{
   
	int x[8]={
   480,583,679,767,840,945,1140,1305};
	int y[8]={
   616,712,811,900,968,1075,1280,1438};
	int *time1,*time2;
	time1=x;
	time2=y;
	printf("Enter a 24-hour time:");
	int desired_time;
	scanf("%d",&desired_time);
	find_closest_flight(desired_time,time1,time2);
	return 0;
}
void find_closest_flight