UVA 10137 The Trip

     每次小练习都有收获,今天强化了一下精度控制这一块,

 The Trip

A number of students are members of a club that travels annually to exotic locations. Their destinations in the past have included Indianapolis, Phoenix, Nashville, Philadelphia, San Jose, and Atlanta. This spring they are planning a trip to Eindhoven.

The group agrees in advance to share expenses equally, but it is not practical to have them share every expense as it occurs. So individuals in the group pay for particular things, like meals, hotels, taxi rides, plane tickets, etc. After the trip, each student's expenses are tallied and money is exchanged so that the net cost to each is the same, to within one cent. In the past, this money exchange has been tedious and time consuming. Your job is to compute, from a list of expenses, the minimum amount of money that must change hands in order to equalize (within a cent) all the students' costs.

The Input

Standard input will contain the information for several trips. The information for each trip consists of a line containing a positive integer, n, the number of students on the trip, followed by n lines of input, each containing the amount, in dollars and cents, spent by a student. There are no more than 1000 students and no student spent more than $10,000.00. A single line containing 0 follows the information for the last trip.

The Output

For each trip, output a line stating the total amount of money, in dollars and cents, that must be exchanged to equalize the students' costs.

Sample Input

3
10.00
20.00
30.00
4
15.00
15.01
3.00
3.01
0

Output for Sample Input

$10.00
$11.99
                     思路很简单 ,求出总钱数的平均值,再计算要转移的钱数,但要注意钱数的最小单位是0.01,所以对于对平均值的处理显得很重要,

                      sum=sum/per+0.005;这是四舍五入的方法,加0.005,若是小数点后第三位有进位 ,表明第三位>5,

                     sum=floor(sum*100)/100.0;    floor(sum*100)是舍弃原sum小数点第三位及其以后的位数,

                    还有一个要注意的地方是求转移的钱数的时应该 有两个变量,一个记录比平均值大的,一个记录比平均值小的,因为之前对平均值做了处理,所以这样个变量未必                                 相等。

代码:

#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
int main()
{


    int per=10,i;
    double num[1010],sum,a,b;
    while(scanf("%d",&per)!=EOF&&per)
    {
        sum=0;
        for(i=0; i<per; i++)
        {
            scanf("%lf",&num[i]);
            sum+=num[i];
        }
        sum=sum/per+0.005;
        sum=floor(sum*100)/100.0;
        a=0;b=0;
        for(i=0;i<per;i++)
        {
            if(num[i]-sum>1e-12)
            a+=num[i]-sum;
            else  b+=sum-num[i];
        }
        if(a>b)
        printf("$%.2lf\n",b);
        else  printf("$%.2lf\n",a);
    }
    return 0;
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值