天天看點

HDU 4493 Tutor

連結: http://acm.hdu.edu.cn/showproblem.php?pid=4493

中文翻譯

Tutor

Time Limit: 2000/1000 MS (Java/Others)

Memory Limit: 65535/65535 K (Java/Others)

Total Submission(s): 4265 Accepted Submission(s): 1118

關鍵詞:模拟

Description

Lilin was a student of Tonghua Normal University. She is studying at University of Chicago now. Besides studying, she worked as a tutor teaching Chinese to Americans. So, she can earn some money per month. At the end of the year, Lilin wants to know his average monthly money to decide whether continue or not. But she is not good at calculation, so she ask for your help. Please write a program to help Lilin to calculate the average money her earned per month.

Input

The first line contain one integer T, means the total number of cases. Every case will be twelve lines. Each line will contain the money she earned per 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 of money she earned for the twelve months. It will be rounded to the nearest penny, preceded immediately by a dollar sign without tail zero. There will be no other spaces or characters in the output.

SampleInput

SampleOutput

$1581. 
$100
           

Hint

Source

2013 ACM-ICPC吉林通化全國邀請賽——題目重制

Analyze

大緻題意:給出12個浮點正數,要求這12個數的平均值。(忽略無效0).比如1.90,就要輸出1.9. 注意一點就是:結果要求四舍五入到最接近的美分。坑點在這裡。。。。

100美分 = 1美元, 換句話說就是保留兩位小數了。。。

大緻思路:運用sprintf()函數将平均值sum,保留兩位小數輸入到一個字元串中,進行處理。

Code

#include <cstdio>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <fstream>
#include <map>
#include <vector>
#include <cmath>
#include <limits.h>
using namespace std;

char ans[];

int main()
{
    int n;

    cin >> n;

    while(n--)
    {
        double sum = ;
        double num = ;
        for(int i=; i<; i++)
        {
            cin >> num;
            sum += num;
        }
        sum /= ;
        sprintf(ans, "%.2f", sum);
        for(int i=strlen(ans)-; i>=; i--)
        {
            if(ans[i] == '.')
            {
                ans[i] = '\0';
                break;
            }
            if(ans[i] != '0' )
            {
                ans[i+] = '\0';
                break;
            }
        }

        printf("$");
        puts(ans);
    }



    return ;
}