ZOJ Problem Set - 1847 The Trip
2014-04-06 18:11
337 查看
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.
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.
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
Sample Output
$10.00
$11.99
水题,四舍五入
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.
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.
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
Sample Output
$10.00
$11.99
#include<stdio.h> #include<math.h> int main() { int sum,i; double free[1001],ave,cost1,cost2,ave1,ave2; while(scanf("%d",&sum)!=EOF&&sum) { cost1=cost2=ave=0.0; for(i=1;i<=sum;i++) { scanf("%lf",&free[i]); ave+=free[i]; } ave/=sum; ave1=ave2=(int)(ave*100); ave1/=100.0; if(ave2<(ave*100)) ave2+=1; ave2/=100.0; for(i=1;i<=sum;i++) { if(free[i]>ave) cost1+=(free[i]-ave2); else cost2+=(ave1-free[i]); } printf("$%.2lf\n",cost1>cost2?cost1:cost2); } return 0; }
水题,四舍五入
相关文章推荐
- ZOJ Problem Set - 1002(DFS)
- ZOJ Problem Set–1970 All in All
- ZOJ Problem Set - 3758 月赛B题
- ZOJ Problem Set - 1016
- ZOJ Problem Set - 1078(Palindrom Numbers)
- ZOJ Problem Set - 1314 Uniform Generator(GCD)
- ZOJ Problem Set - 1188 DNA Sorting
- ZOJ Problem Set - 2723 Semi-Prime(ac,但有一点想不通)
- ZOJ Problem Set - 1093Monkey and Banana
- ZOJ Problem Set - 2176 Speed Limit
- ZOJ Problem Set - 1315 Excuses, Excuses!(字符串处理的好题)
- ZOJ Problem Set - 3822
- ZOJ Problem Set - 2972
- ZOJ Problem Set - 2850 Beautiful Meadow
- ZOJ Problem Set - 1831 Substitution Cypher
- ZOJ Problem Set - 1655
- ZOJ Problem Set - 1457 解题报告
- ZOJ Problem Set - 1456
- ZOJ Problem Set - 1115 Digital Roots
- ZOJ Problem Set - 1151 Word Reversal