UVA 10137
来源:互联网 发布:小草 淘宝客 编辑:程序博客网 时间:2024/05/16 11:26
Problem A: 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
310.0020.0030.00415.0015.013.003.010
Output for Sample Input
$10.00$11.99
严重BS这种卡精度的题 , 害的我WA都不好改。
看了网上一个大神的代码 , 觉得他的处理方式很好。
#include <iostream>#include <cstdio>#include <cstring>#include <cmath>using namespace std;double a[1005];int main(){ int n ; //freopen("in.txt" , "r" , stdin); while(cin >> n , n) { double sum = 0; for(int i = 0 ; i < n ; i++) { cin >> a[i]; sum += a[i]; } double ave = sum / n + 0.005; ave = floor(ave * 100) / 100; //这个写法真心赞 , 取2位小数 , floor向下取整 double ans = 0; double ans2 = 0; for(int i = 0 ; i < n ; i++) { if(a[i] < ave) { ans += ave - a[i]; } else { ans2 += a[i] - ave; } } printf("$%.2lf\n",ans < ans2 ? ans : ans2); } return 0;}/**/
- UVA 10137
- UVA 10137
- UVA 10137
- UVa 10137 The Trip
- UVa 10137 The trip
- Uva 10137 - The Trip
- UVa 10137 - The Trip
- UVA 10137 旅行
- UVA 10137 The Trip
- Uva 10137 the trip
- uva 10137 The trip
- uva 10137 The Trip
- UVa 10137 - The Trip
- UVa:10137 The Trip
- UVa 10137 The Trip
- UVa 10137 The Trip
- uva 10137 the trip
- UVA 10137 The Trip
- POJ3104 Drying
- usaco 3.1 Contact
- Ural 1117
- 关于linux中的实际用户,有效用户,设置-用户-ID位
- ARP缓存表
- UVA 10137
- archlinux 2013-01-04版,最完整的个性化安装与配置大全
- 一些鲜为人知的但却很有趣的Unix/Linux命令
- CSDN的博客搜索功能太弱,教你怎么搜索自己博客的文章
- RGB和YUV之比较
- linux中程序/脚本启动方式小结
- iphone QQ协议,andriodQQ协议,安卓QQ协议
- HDU 1007 (最近点对问题)
- 【易语言】易语言loder补丁工具 by xiaoH