codeforces 143B Help Kingdom of Far Far Away 2

本文介绍了一个用于将任意数值转换为特定财务格式的程序设计方法。该程序能够处理带有小数点和负号的大规模数值,并按照规定格式进行展示,便于银行交易等应用场景。

For some time the program of rounding numbers that had been developed by the Codeforces participants during one of the previous rounds, helped the citizens of Far Far Away to convert numbers into a more easily readable format. However, as time went by, the economy of the Far Far Away developed and the scale of operations grew. So the King ordered to found the Bank of Far Far Away and very soon even the rounding didn't help to quickly determine even the order of the numbers involved in operations. Besides, rounding a number to an integer wasn't very convenient as a bank needed to operate with all numbers with accuracy of up to0.01, and not up to an integer.

The King issued yet another order: to introduce financial format to represent numbers denoting amounts of money. The formal rules of storing a number in the financial format are as follows:

  • A number contains the integer part and the fractional part. The two parts are separated with a character "." (decimal point).
  • To make digits in the integer part of a number easier to read, they are split into groups of three digits, starting from the least significant ones. The groups are separated with the character "," (comma). For example, if the integer part of a number equals 12345678, then it will be stored in the financial format as 12,345,678
  • In the financial format a number's fractional part should contain exactly two digits. So, if the initial number (the number that is converted into the financial format) contains less than two digits in the fractional part (or contains no digits at all), it is complemented with zeros until its length equals 2. If the fractional part contains more than two digits, the extra digits are simplydiscarded (they are not rounded: see sample tests).
  • When a number is stored in the financial format, the minus sign is not written. Instead, if the initial number had the minus sign, the result is written in round brackets.
  • Please keep in mind that the bank of Far Far Away operates using an exotic foreign currency — snakes ($), that's why right before the number in the financial format we should put the sign "$". If the number should be written in the brackets, then the snake sign should also be inside the brackets.

For example, by the above given rules number 2012 will be stored in the financial format as "$2,012.00" and number -12345678.9 will be stored as "($12,345,678.90)".

The merchants of Far Far Away visited you again and expressed much hope that you supply them with the program that can convert arbitrary numbers to the financial format. Can you help them?

Input

The input contains a number that needs to be converted into financial format. The number's notation length does not exceed100 characters, including (possible) signs "-" (minus) and "." (decimal point). The number's notation is correct, that is:

  • The number's notation only contains characters from the set {"0" – "9", "-", "."}.
  • The decimal point (if it is present) is unique and is preceded and followed by a non-zero quantity on decimal digits
  • A number cannot start with digit 0, except for a case when its whole integer part equals zero (in this case the integer parts is guaranteed to be a single zero: "0").
  • The minus sign (if it is present) is unique and stands in the very beginning of the number's notation
  • If a number is identically equal to 0 (that is, if it is written as, for example, "0" or "0.000"), than it is not preceded by the minus sign.
  • The input data contains no spaces.
  • The number's notation contains at least one decimal digit.

Output

Print the number given in the input in the financial format by the rules described in the problem statement.

Sample test(s)
Input
2012
Output
$2,012.00
Input
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
using namespace std;
void dao(char a[])
{
    int i,n=strlen(a);
    char t;
    for(i=0; i<n/2; i++)
    {
        t=a[i];
        a[i]=a[n-1-i];
        a[n-1-i]=t;
    }
}


int main()
{
    char a[110],b[110],bb[220],c[10];
    while(scanf("%s",a)!=EOF)
    {
        memset(b,0,sizeof(b));
        memset(c,0,sizeof(c));
        memset(bb,0,sizeof(bb));
        int i,j,n=strlen(a),tu=0;
        if(a[0]=='-')
        {
            printf("(");
            i=1;
            tu=1;
        }
        else
            i=0;
        for( j=0; i<n&&a[i]!='.'; i++)
            b[j++]=a[i];

        if(i==n)
        {
            c[0]='0';
            c[1]='0';
        }
        else
        {
            strcpy(c,&a[i]+1);
        }
        int m=strlen(c);
        if(m==0)
        {
            c[0]='0';
            c[1]='0';
        }
        else if(m==1) c[1]='0';
        printf("$");
        dao(b);                                         //添加“,”,这样做比较简单了
        for(i=0,j=0; i<strlen(b); i++)
        {
            bb[j++]=b[i];
            if((i+1)%3==0&&i!=strlen(b)-1) bb[j++]=',';
        }
        dao(bb);
        
        printf("%s",bb);                    //输出部分
        printf(".%c%c",c[0],c[1]);

        if(tu) printf(")");               //用的tu判断是否为负数,开始用if(a[0]=='-'),测试数据都是对的,竟然过不了.....
        printf("\n");
    }


    return 0;
}

 
### 关于 Codeforces 1853B 的题解与实现 尽管当前未提供关于 Codeforces 1853B 的具体引用内容,但可以根据常见的竞赛编程问题模式以及相关算法知识来推测可能的解决方案。 #### 题目概述 通常情况下,Codeforces B 类题目涉及基础数据结构或简单算法的应用。假设该题目要求处理某种数组操作或者字符串匹配,则可以采用如下方法解决: #### 解决方案分析 如果题目涉及到数组查询或修改操作,一种常见的方式是利用前缀和技巧优化时间复杂度[^3]。例如,对于区间求和问题,可以通过预计算前缀和数组快速得到任意区间的总和。 以下是基于上述假设的一个 Python 实现示例: ```python def solve_1853B(): import sys input = sys.stdin.read data = input().split() n, q = map(int, data[0].split()) # 数组长度和询问次数 array = list(map(int, data[1].split())) # 初始数组 prefix_sum = [0] * (n + 1) for i in range(1, n + 1): prefix_sum[i] = prefix_sum[i - 1] + array[i - 1] results = [] for _ in range(q): l, r = map(int, data[2:].pop(0).split()) current_sum = prefix_sum[r] - prefix_sum[l - 1] results.append(current_sum % (10**9 + 7)) return results print(*solve_1853B(), sep='\n') ``` 此代码片段展示了如何通过构建 `prefix_sum` 来高效响应多次区间求和请求,并对结果取模 \(10^9+7\) 输出[^4]。 #### 进一步扩展思考 当面对更复杂的约束条件时,动态规划或其他高级技术可能会被引入到解答之中。然而,在没有确切了解本题细节之前,以上仅作为通用策略分享给用户参考。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值