HDU-1064-Financial Management(水题测试......真无双-大水果)

原创 2015年07月10日 16:24:06

Financial Management

Time Limit: 400/200 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 10333    Accepted Submission(s): 6400


Problem 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
 

Recommend
PrincetonBoy   |   We have carefully selected several similar problems for you:  1076 1070 1056 1090 1062 

好久没来做题了,今天回家测试一下......来一个大大的水题!顺便好好翻译一下......(求平均数)

题目翻译:
劳瑞在今年毕业的最后得到了一个工作,赚了很多钱,但是无论怎么看都不够。(谁会觉得钱够?)劳瑞决定抓住他整体的财政并且解决他的经济问题。这个第一步就是弄清楚他的钱去哪里了。劳瑞有他自己的银行账户,并且想要看他自己有多少钱。通过写一个程序获取他过去每12个月的经济,并计算他们的平均值。

输入:
输入将有12行,每一行都是劳瑞每个月的银行经济值。每个数字都是精确的并且以便士的形式表现出来。并不是美元。

输出:
这个输出将只有一个数字,就是他12个月的平均经济,它将最接近分钱(就是保留两位小数)。是在美元注册之前。并且在最后一行没有空格或者其他字符!



#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
    double a,sum=0;
    for(int i=0;i<12;i++)
    {
        scanf("%lf",&a);
        sum+=a;
    }
    printf("$%.2lf\n",sum/12);
    return 0;
}


 

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

hdu 1064 Financial Management

Financial Management Time Limit: 400/200 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/...

hdu 1878 欧拉回路 水题。测试数据貌似有点问题

Problem Description 欧拉回路是指不令笔离开纸面,可画过图中每条边仅一次,且可以回到起点的一条回路。现给定一个图,问是否存在欧拉回路? Input 测试输入包含若干测试用例。每...

每天一道算法_5_Financial Management

今天的题目更简单,在考虑是不是应该有挑选性的选题目做。 题目是Financial Management,如下:   Description Larry graduated this year and ...

poj 1004 Financial Management

Financial Management Time Limit: 1000MS Memory Limit: 10000K Total Submissi...

Financial Management UVA - 11945

问题类型:字符串,有限状态自动机 03pie’s solution for [UVA-11945] #include #include #include u...

【HDU5718 BestCoder 2nd AnniversaryA】【水题 高精度拆数相加】Oracle 正整数拆2正整数使得和最大

Oracle Time Limit: 8000/4000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others) Total...

【HDU5719 BestCoder 2nd AnniversaryB】【模拟水题 范围更新】Arrange 已知最大最小值前缀和求全排列方案数

Arrange Time Limit: 8000/4000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others) Tota...

hdu 1678(Shopaholic )(最大折扣)(水题,cheapest)

Shopaholic Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) ...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)