uva10135 the trip
来源:互联网 发布:年终奖数据表免费数据 编辑:程序博客网 时间:2024/03/29 02:47
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
310.0020.0030.00415.0015.013.003.010
Output for Sample Input
$10.00$11.99
#include<stdio.h>#include<math.h>#define min(x,y) x<y?x:yint main(){ int n; while(~scanf("%d",&n),n) { double a[1005],sum,ave; int i; sum=0; for(i=0;i<n;i++) { scanf("%lf",&a[i]); sum+=a[i]; } ave=round(sum/n*100)/100; double sum1=0,sum2=0; for(i=0;i<n;i++) { if(a[i]>ave) sum1=sum1+a[i]-ave; else sum2=sum2+ave-a[i]; } printf("$%.2lf\n",min(sum1,sum2)); } return 0;}
0 0
- uva10135 the trip
- The trip
- The Trip
- The Trip
- The first trip
- 10137 - The Trip
- UVa 10137 The Trip
- UVa 10137 The trip
- Uva 10137 - The Trip
- UVa 10137 - The Trip
- ZOJ 1847 The Trip
- 10137 - The Trip
- The Trip. 2007
- 11100 - The Trip, 2007
- UVA 10137 The Trip
- Uva 10137 the trip
- UVaOJ11100 - The Trip, 2007
- uva 10137 The trip
- 数字整除
- 为什么呢?
- iPhone开发笔记(22)-JSONValue Failed. Error is : Unescaped control character的解决方法
- java.sql.SQLException: [Microsoft][SQLServer 2000 Driver for JDBC]Error establishing socket
- Android假退出不是流氓行为
- uva10135 the trip
- C/C++ sort函数的用法
- WIN8 64位VS2010+cmake3.0编译OGRE1.8.1
- Remove Duplicates from Sorted List II
- 计数排序、桶排序python实现
- hdu1002A + B Problem II
- 大家好,新人报道!
- Oracle性能优化2- 依据场景选择技术
- 数组的归并排序(不使用辅助空间,递归)