poj 1004:Financial Management(水题,求平均数)

Financial Management










Time Limit: 1000MS   Memory Limit: 10000K
Total Submissions: 126087   Accepted: 55836

Description

Larry graduated this year and finally has a job.
He‘s making a lot of money, but somehow never seems to have enough. Larry has
decided that he needs to grab hold of his financial portfolio and solve his
financing problems. The first step is to figure out what‘s been going on with
his money. Larry has his bank account statements and wants to see how much money
he has. Help Larry by writing a program to take his closing balance from each of
the past twelve months and calculate his average account balance.

Input

The input will be twelve lines. Each line will
contain the closing balance of his bank account for a particular month. Each
number will be positive and displayed to the penny. No dollar sign will be
included.

Output

The output will be a single number, the average
(mean) of the closing balances for the twelve months. It will be rounded to the
nearest penny, preceded immediately by a dollar sign, and followed by the
end-of-line. There will be no other spaces or characters in the output.

Sample Input

100.00
489.12
12454.12
1234.10
823.05
109.20
5.27
1542.25
839.18
83.99
1295.01
1.75

Sample Output

$1581.42

Source

Mid-Atlantic
2001


  水题,求平均数

  题意:给你多个数,要求你输出他们的平均数。

  思路:没什么好说的……

  代码


 1 #include <iostream>
2 #include <stdio.h>
3 using namespace std;
4
5 int main()
6 {
7 double sum = 0,n;
8 int num=0;
9 //freopen("./a.txt","r",stdin);
10 while(cin>>n){ //输入
11 sum+=n;
12 num++;
13 }
14 printf("$%.2f\n",sum/num);
15 return 0;
16 }

Freecode : www.cnblogs.com/yym2013

时间: 2024-12-26 14:48:29

poj 1004:Financial Management(水题,求平均数)的相关文章

POJ 1004 Financial Management 水

 Financial Management Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 165700   Accepted: 61629 Description Larry graduated this year and finally has a job. He's making a lot of money, but somehow never seems to have enough. Larry has d

UVA 11945 Financial Management 水题

Financial Management Time Limit: 1 Sec  Memory Limit: 256 MB 题目连接 acm.hust.edu.cn/vjudge/problem/visitOriginUrl.action?id=20184 Description Michael graduated of ITESO this year and finally has a job. He's making a lot of money, but somehow never seem

POJ 1004 Financial Management

#include <stdio.h> #include <iostream> using namespace std; int main() { int n=12; float money,sum=0; for(int i=0;i<12;i++) { cin>>money; sum+=money; } printf("$%.2f", sum/12); return 0; }

poj 2369 Permutations 置换水题

找循环节求lcm就够了,若答案是12345应该输出1,被坑了下. #include<iostream> #include<cstdio> #include<cstring> #include<string> #include<algorithm> #include<cmath> using namespace std; #define INF 0x3FFFFFF #define MAXN 2222 #define eps 1e-6 i

poj 1006:Biorhythms(水题,经典题,中国剩余定理)

Biorhythms Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 110991   Accepted: 34541 Description Some people believe that there are three cycles in a person's life that start the day he or she is born. These three cycles are the physical,

poj 1003:Hangover(水题,数学模拟)

Hangover Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 99450   Accepted: 48213 Description How far can you make a stack of cards overhang a table? If you have one card, you can create a maximum overhang of half a card length. (We're as

poj 1002:487-3279(水题,提高题 / hash)

487-3279 Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 236746   Accepted: 41288 Description Businesses like to have memorable telephone numbers. One way to make a telephone number memorable is to have it spell a memorable word or phras

POJ 1488 Tex Quotes --- 水题

POJ 1488 题目大意:给定一篇文章,将它的左引号转成 ``(1的左边),右引号转成 ''(两个 ' ) 解题思路:水题,设置一个bool变量标记是左引号还是右引号即可 /* POJ 1488 Tex Quotes --- 水题 */ #include <cstdio> #include <cstring> int main() { #ifdef _LOCAL freopen("D:\\input.txt", "r", stdin); #

Poj 1094 拓扑排序 水题

Sad..这么水的题WA了无数发,题目要看仔细啊,留下来做个警告把 #include <cstdio> #include <cstring> #include <algorithm> #include <climits> #include <string> #include <iostream> #include <map> #include <cstdlib> #include <list> #i