UVa 10137 The Trip (小数四舍五入&需要注意的地方)
来源:互联网 发布:hadoop做数据分析 编辑:程序博客网 时间:2024/05/17 22:06
10137 - The Trip
Time limit: 3.000 seconds
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=29&page=show_problem&problem=1078
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
完整代码:
/*0.019s*/#include<cstdio>#include<cmath>#include<algorithm>using namespace std;double x[1005];int main(){int n;double sum, sum2, ave;while (scanf("%d", &n), n){sum = 0.0;for (int i = 0; i < n; ++i){scanf("%lf", &x[i]);sum += x[i];}ave = round(sum / n * 100) / 100;///保留小数点后2位sum = sum2 = 0.0;for (int i = 0; i < n; ++i)if (x[i] < ave) sum += ave - x[i];else sum2 += x[i] - ave;///虽然分析上面的四舍五入可以知道选哪个,但那样编程复杂度略高printf("$%.2f\n", min(sum, sum2));}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
- hdu4203 Doubloon Game
- 剑指offer-4/题目1510:替换空格
- hdu 4107 Gangster(线段树。时间卡的很紧)
- 好记星不如烂笔头之new的操作
- sql查询语句
- UVa 10137 The Trip (小数四舍五入&需要注意的地方)
- 适配器模式
- 监听返回键并退出所有Activity示例
- 伸展树
- Treap(树堆)
- Apache的OpenOffice
- SkipList 跳表
- c primer读书笔记 第一章
- eclipse的vi插件:viPlugin的安装和破解方法