• sicily 1017. Rate of Return


    Description

    Jill has been investing in a mutual fund for a while. Since her income has varied, the amount of money she has added to the investment has varied, and she hasn’t always added to the investment at regular intervals. Nevertheless, she does have a complete record of the amounts she has invested, and the dates of those investments.

     

    Periodically Jill gets a report that indicates the total value of her investment. She wonders if she would have done better by investing her money in a savings account that pays a fixed interest rate. But to determine the answer to this question, she needs to know what the equivalent interest rate would have been paid on the mutual fund, had it paid a fixed rate. You are going to help her.

     

    For simplicity we will assume that Jill added money to her mutual fund only at the beginning of a month, and that all months have the same length. We will further assume that the interest she would have been paid had she invested in a savings account would have been paid at the end of the month, and would have been compounded monthly.

     

    Let’s consider a simple example. Suppose Jill invested $100 at the beginning of January and another $100 in March. At the end of April she finds that the value of her mutual fund is $210. If the equivalent fixed monthly interest rate was i, then we know that at the end of January the value would have been 100 × (1 + i). At the end of February the value would have been 100 × (1 + i) × (1 + i), or 100 × (1 + i)2. At the end of March, the value would have been 100 × (1 + i)+ 100 × (1 + i), and at the end of April, the value would have been 100 × (1 + i)4 + 100 × (1 + i)2. So the question to be answered in this case is this: what is the value of i such that 100 × (1 + i)+ 100 × (1 + i)= 210? The answer for this case is close to 0.016351795234.

    Input
    The input from file i.in will contain multiple cases. The input for each case will begin with an integer N (no larger than 12) that indicates the number of times Jill invested in her mutual fund. This will be followed by N + 1 pairs, each pair containing an integer and a real number. The integer represents a month number (1 or larger) and the real number represents a dollar amount. The first N pairs give the month and amount of each of Jill’s N investments in the mutual fund, and the last pair indicates the value of the investment at the end of the specified month. There will be one or more whitespace characters (blanks, tabs, and/or ends of lines) between the input numbers. You may assume that the month numbers are given in ascending order. Input for the last case will be followed by a single integer –1. 
    Output
    For each case, display the case number (they start with 1 and increase sequentially) and the equivalent fixed monthly interest rate Jill’s mutual fund would have paid. Display this number with five fractional digits, rounded to the nearest decimal place. You may assume the interest rate will be no less than 0 and no larger than 1. Separate the output for consecutive cases by a blank line. 
    Sample Input
     Copy sample input to clipboard 
    2   1   100.00    3
    100.00    4   210.00
    
    3
    1 100.00
    2 50.00
    5 200.00
    7 358.41
    
      -1
    Sample Output
    Case 1: 0.01635
    
    Case 2: 0.00520
    这题用二分法求解就很简单,但是有一点要注意,就是它的输入是升序的,但不是单调增的,因为我的代码在直接用month做下标的时候是错的,然后改用数组储存月份就过了,说明它的月份是有重复的,也就是一个人在同一个月储存了几次。
    #include <iostream>
    #include <cstdio>
    #include <cmath>
    #include <cstring>
    using namespace std;
    
    const double eps = 1e-6;
    
    int dcmp(double x){
        return (x > -eps && x < eps) ? 0 : 1;
    }
    
    int main(int argc, char const *argv[])
    {
        int N, month[14];
        double moneyIn[14], lastMoney, lastMonth;
        int testNum = 0;
    
        while (cin >> N && N != -1) {
            memset(moneyIn, 0.0, sizeof(moneyIn));
            for (int i = 0; i < N; ++i) {
                cin >> month[i];
                cin >> moneyIn[i];
            }
    
            cin >> lastMonth >> lastMoney;
            double lastMoneyT = 0.0, rateE = 2.0, rateB = 1.0, rate = 1.5;
    
            lastMoneyT = 0.0;
            for (int i = 0; i < N; ++i)
                lastMoneyT += moneyIn[i] * pow(rate, lastMonth - month[i] + 1);
    
            while (dcmp(lastMoneyT - lastMoney) != 0 && rateE - rateB >= 1e-6) {
                if (lastMoneyT > lastMoney)
                    rateE = rate;
                else
                    rateB = rate;
                
                rate = (rateE + rateB) / 2;
                lastMoneyT = 0.0;
                for (int i = 0; i < N; ++i)
                    lastMoneyT += moneyIn[i] * pow(rate, lastMonth - month[i] + 1);
            }
    
            if (++testNum > 1)
                cout << endl;
            printf("Case %d: %.5lf
    ", testNum, rate - 1);
        }
        return 0;
    }
  • 相关阅读:
    小总结
    使用Bind提供域名解析服务(正向解析)
    在虚拟机上的NFS网络文件系统
    在虚拟机上的FTP FTP访问模式(虚拟用户模式)
    在虚拟机上的FTP FTP访问模式(本地用户模式)
    在虚拟机上的FTP,FTP访问模式(匿名)
    在虚拟机上的关于Apache(阿帕奇)(5)基于端口访问网站
    在虚拟机上的关于Apache(阿帕奇)(4)基于域名访问网站
    在虚拟机上的关于Apache(阿帕奇)(3)基于IP访问网站
    在虚拟机上的关于Apache(阿帕奇)(2)开启个人用户主页功能
  • 原文地址:https://www.cnblogs.com/xiezhw3/p/4067546.html
Copyright © 2020-2023  润新知