OFORTUNE - Ohgas' Fortune
The Ohgas are a prestigious family based on Hachioji. The head of the family, Mr. Nemochi Ohga, a famous wealthy man, wishes to increase his fortune by depositing his money to an operation company. You are asked to help Mr. Ohga maximize his profit by operating the given money during a specified period.
From a given list of possible operations, you choose an operation to deposit the given fund to. You commit on the single operation throughout the period and deposit all the fund to it. Each operation specifies an annual interest rate, whether the interest is simple or compound, and an annual operation charge. An annual operation charge is a constant not depending on the balance of the fund. The amount of interest is calculated at the end of every year, by multiplying the balance of the fund under operation by the annual interest rate, and then rounding off its fractional part. For compound interest, it is added to the balance of the fund under operation, and thus becomes a subject of interest for the following years. For simple interest, on the other hand, it is saved somewhere else and does not enter the balance of the fund under operation (i.e. it is not a subject of interest in the following years). An operation charge is then subtracted from the balance of the fund under operation. You may assume here that you can always pay the operation charge (i.e. the balance of the fund under operation is never less than the operation charge). The amount of money you obtain after the specified years of operation is called ``the final amount of fund.'' For simple interest, it is the sum of the balance of the fund under operation at the end of the final year, plus the amount of interest accumulated throughout the period. For compound interest, it is simply the balance of the fund under operation at the end of the final year.
Operation companies use C, C++, Java, etc., to perform their calculations, so they pay a special attention to their interest rates. That is, in these companies, an interest rate is always an integral multiple of 0.0001220703125 and between 0.0001220703125 and 0.125 (inclusive). 0.0001220703125 is a decimal representation of 1/8192. Thus, interest rates' being its multiples means that they can be represented with no errors under the double-precision binary representation of floating-point numbers.
For example, if you operate 1000000 JPY for five years with an annual, compound interest rate of 0.03125 (3.125 %) and an annual operation charge of 3000 JPY, the balance changes as follows.
The balance of the fund under operation(at the beginning of year) | Interest | The balance of the fund under operation (at the end of year) |
A | B = A × 0.03125 (and rounding off fractions) | A + B - 3000 |
1000000 | 31250 | 1028250 |
1028250 | 32132 | 1057382 |
1057382 | 33043 | 1087425 |
1087425 | 33982 | 1118407 |
1118407 | 34950 | 1150357 |
After the five years of operation, the final amount of fund is 1150357 JPY.
If the interest is simple with all other parameters being equal, it looks like:
The balance of the fund under operation (at the beginning of year) | Interest | The balance of the fund under operation (at the end of year) | Cumulative interest |
A | B = A × 0.03125 (and rounding off fractions) | A - 3000 | |
1000000 | 31250 | 997000 | 31250 |
997000 | 31156 | 994000 | 62406 |
994000 | 31062 | 991000 | 93468 |
991000 | 30968 | 988000 | 124436 |
988000 | 30875 | 985000 | 155311 |
In this case the final amount of fund is the total of the fund under operation, 985000 JPY, and the cumulative interests, 155311 JPY, which is 1140311 JPY.
Input
The input consists of datasets. The entire input looks like:
- the number of datasets (=m)
1st dataset
2nd dataset
...
m-th dataset
The number of datasets, m, is no more than 100. Each dataset is formatted as follows.
- the initial amount of the fund for operation
the number of years of operation
the number of available operations (=n)
operation 1
operation 2
...
operation n
The initial amount of the fund for operation, the number of years of operation, and the number of available operations are all positive integers. The first is no more than 100000000, the second no more than 10, and the third no more than 100.
- Each ``operation'' is formatted as follows.
simple-or-compound annual-interest-rate annual-operation-charge
where simple-or-compound is a single character of either '0' or '1', with '0' indicating simple interest and '1' compound. annual-interest-rate is represented by a decimal fraction and is an integral multiple of 1/8192. annual-operation-charge is an integer not exceeding 100000.
Output
For each dataset, print a line having a decimal integer indicating the final amount of fund for the best operation. The best operation is the one that yields the maximum final amount among the available operations. Each line should not have any character other than this number.
You may assume the final balance never exceeds 1000000000. You may also assume that at least one operation has the final amount of the fund no less than the initial amount of the fund.
Example
Input: 4 1000000 5 2 0 0.03125 3000 1 0.03125 3000 6620000 7 2 0 0.0732421875 42307 1 0.0740966796875 40942 39677000 4 4 0 0.0709228515625 30754 1 0.00634765625 26165 0 0.03662109375 79468 0 0.0679931640625 10932 10585000 6 4 1 0.0054931640625 59759 1 0.12353515625 56464 0 0.0496826171875 98193 0 0.0887451171875 78966 Output: 1150357 10559683 50796918 20829397
hide comments
niveth_saran:
2017-09-26 17:28:57
it would be nice if someone can explain the program in short to me |
|
kira28:
2016-12-17 13:25:03
LOL!!!
|
|
abinator_1308:
2016-05-29 10:04:47
use comments in the program |
|
raghav151997:
2016-01-27 15:12:05
don't directly multiply the amount with input interest....instead multiply with k/8192. where(k=interest*8192)..Also use double.
|
|
rahul_verma:
2015-09-17 19:41:43
AC. in first go........ |
|
Shivam Singh:
2015-08-19 08:34:16
take initial fund,annual charge and the variables in between which you operate upon in long long, else it won't give AC. |
|
Vars:
2015-08-15 21:33:58
reading question was bit difficult then solving it... ;)
|
|
Bhuvnesh Jain:
2015-06-02 13:02:06
too easy....you can gain a lot of points |
|
Animesh Lal:
2015-01-10 12:59:34
AC in 1 go :) Very easy ! |
|
ওয়াসী (Wasi):
2013-04-11 10:49:42
Oh man! after a lot of WA in C and python.
|
Added by: | Camilo Andrés Varela León |
Date: | 2007-07-26 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ERL JS-RHINO NODEJS PERL6 VB.NET |
Resource: | Japan Domestic, 2005 |