Uva 10137 the trip
来源:互联网 发布:linux服务器重启日志 编辑:程序博客网 时间:2024/04/28 10:01
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
#include <stdio.h>#define maxsize 1000int main (int argc, const char * argv[]) {
long numOfStudents; double total; double exchange; double equalizedAmount; double diff; double negativeSum; double positiveSum; double amountSpent[maxsize]; int i;while(scanf("%ld", &numOfStudents), numOfStudents) { total =0; negativeSum = 0; positiveSum = 0; for (i = 0; i < numOfStudents; i++) { scanf("%lf", &amountSpent[i]); total += amountSpent[i]; } getchar(); equalizedAmount = total / numOfStudents; for (i = 0; i < numOfStudents; i++) {
diff = (double) (long) ((amountSpent[i] - equalizedAmount) * 100.0) / 100.0; if (diff < 0) { negativeSum += diff; } else { positiveSum += diff; } } exchange = (-negativeSum > positiveSum)? -negativeSum : positiveSum; printf("$%.2lf\n", exchange);}
return 0;
}
- 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
- 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(旅行)
- linux shell脚本调试技术
- 关于Matlab坐标轴的Position
- ios各种动画效果
- c++文件处理
- ZOJ 2404 Going Home(最小费用最大流)
- Uva 10137 the trip
- 获取当前文件目录shell
- 【转】预处理器的预定义宏大全
- session_set_save_handler函数控制session有效期问题
- chrome 浏览器浏览网页(html)乱码
- iphone5 适配
- 给PDF文件加个真正的书签
- CSharp Tools - Compiler
- JAVA容器类解析——小白白