| 网站首页 | 业界新闻 | 小组 | 威客 | 人才 | 下载频道 | 博客 | 代码贴 | 在线编程 | 编程论坛
欢迎加入我们,一同切磋技术
用户名:   
 
密 码:  
共有 333 人关注过本帖
标题:这个程序错在了那里.
取消只看楼主 加入收藏
kingsmiler
Rank: 1
等 级:新手上路
帖 子:9
专家分:0
注 册:2006-3-8
收藏
 问题点数:0 回复次数:0 
这个程序错在了那里.

#include <stdio.h>
#include "hotel.h"
int main(void)
{
int nights;
double hotel_rate;
int code;

while((code = menu())!=QUIT)
{
switch(code)
{
case 1: hotel_rate = HOTEL1;
break;
case 2: hotel_rate = HOTEL2;
break;
case 3: hotel_rate = HOTEL3;
break;
case 4: hotel_rate = HOTEL4;
break;
default: hotel_rate = 0.0;
printf("Oops!\n");
break;
}
nights = getnights();
showprice(hotel_rate, nights);
}
printf("Thank you and goodbye.");
}



#include <stdio.h>
#include "hotel.h"
int menu(void)
{
int code,status;

printf("\n%s%s\n",STARS,STARS);
printf("Enter the number of the desired hotel: \n");
printf("1) Fairfield Arms 2) Hotel Olympic\n");
printf("3) Chertworthy Plaza 4) The Stockton\n");
printf("5) quit\n");
printf("%s%s\n",STARS,STARS);
while ((status = scanf("%d",&code))!=1||(code<1||code>5))
{
if(status !=1)
{
scanf("%*s");
}
printf("Enter an integer from 1 to 5,please.\n");
}
return code;
}
int getnights(void)
{
int nights;
printf("How many nights are needed? ");
while (scanf("%d",&nights)!=1)
{
scanf("%*s");
printf("Please enter an integer,such as 2.\n");
}
return nights;
}
void showprice(double rate, int nights)
{
int n;
double total = 0.0;
double factor = 1.0;
for (n=1;n<=nights; n++,factor *=DISCOUNT)
{
total +=rate * factor;
}
printf("The total cost will be $%0.2f.\n",total);
}


#define QUIT 5
#define HOTEL1 80.00
#define HOTEL2 125.00
#define HOTEL3 155.00
#define HOTEL4 200.00
#define DISCOUNT 0.95
#define STARS "***********************************"

//给出选项列表
int menu(void);

//返回预定的天数
int getnights(void);

//返回的星级和预定的天数计算价格并显示出来
void showprice(void);

搜索更多相关主题的帖子: default include double 
2006-05-11 00:21
快速回复:这个程序错在了那里.
数据加载中...
 
   



关于我们 | 广告合作 | 编程中国 | 清除Cookies | TOP | 手机版

编程中国 版权所有,并保留所有权利。
Powered by Discuz, Processed in 0.016464 second(s), 8 queries.
Copyright©2004-2024, BCCN.NET, All Rights Reserved