• ZOJ Problem Set – 1048 Financial Management


    Financial Management


    Time Limit: 1 Second      Memory Limit: 32768 KB


    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 Format:
    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 Format:
    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 USA 2001
      1: #include<iostream>
    
      2: #include<iomanip>
    
      3: 
    
      4: using namespace std;
    
      5: 
    
      6: int main(void)
    
      7: {
    
      8:     double money;
    
      9:     double sum = 0.0;
    
     10:     double average = 0.0;
    
     11: 
    
     12:     for(int i = 1; i <= 12; i++)
    
     13:     {
    
     14:         cin>>money;
    
     15:         sum += money;
    
     16:     }
    
     17: 
    
     18:     //Calculate the average value
    
     19:     average = sum/12;
    
     20:         
    
     21:     //format the output 
    
     22:     average = static_cast<double>( static_cast<int>( average * 100 + 0.5 ) )/100;
    
     23: 
    
     24:     cout<<"$"<<fixed<<setprecision(2)<<average<<endl;
    
     25: 
    
     26:     return 0;
    
     27: }
  • 相关阅读:
    ZOJ 3954 Seven-Segment Display
    ZOJ 3955 Saddle Point
    ZOJ 3950 How Many Nines
    ZOJ 3957 Knuth-Morris-Pratt Algorithm
    PAT L2-018. 多项式A除以B
    hihocoder 1500 EL SUENO
    hihocoder 1498 Diligent Robots
    hihocoder 1497 Queen Attack
    hihocoder 1490 Tree Restoration
    SCU 4443 Range Query
  • 原文地址:https://www.cnblogs.com/malloc/p/1671515.html
Copyright © 2020-2023  润新知