zoukankan      html  css  js  c++  java
  • Bank Interest

    Bank Interest

    Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 131072/65536K (Java/Other)
    Total Submission(s) : 45   Accepted Submission(s) : 18
    Problem Description
    Farmer John made a profit last year! He would like to invest it well but wonders how much money he will make. He knows the interest rate R (an integer between 0 and 20) that is compounded annually at his bank. He has an integer amount of money M in the range 100..1,000,000. He knows how many years Y (range: 0..400) he intends to invest the money in the bank. Help him learn how much money he will have in the future by compounding the interest for each year he saves. Print an integer answer without rounding. Answers for the test data are guaranteed to fit into a signed 32 bit integer.
     
    Input
    * Line 1: Three space-separated integers: R, M, and Y
     
    Output
    * Line 1: A single integer that is the number of dollars FJ will have after Y years.
     
    Sample Input
    5 5000 4
     
    Sample Output
    6077
     
    Source
    PKU
     
     1 #include <stdio.h>
     2 #include <stdlib.h>
     3 
     4 int main()
     5 {
     6     double SUM,r,R,M,Y,i;
     7     while(scanf("%lf%lf%lf",&R,&M,&Y)!=EOF)
     8     {
     9         SUM=M;
    10         for(i=0,r=0;i<Y;i++)
    11         {
    12             r=SUM*(0.01*R);
    13             SUM=SUM+r;
    14         }
    15         printf("%ld
    ",(long)SUM);
    16     }
    17     return 0;
    18 }
    View Code
    转载请备注:
    **************************************
    * 作者: Wurq
    * 博客: https://www.cnblogs.com/Wurq/
    * Gitee: https://gitee.com/wurq
    **************************************
  • 相关阅读:
    golang的并行快速排序
    深信服面试
    一道算法题-勇敢的牛牛
    一道算法题-打车
    一道算法题-最少需要换掉的瓷砖数量
    《C++ Primer Plus》读书笔记之二—复合类型
    图解:TCP协议中的三次握手和四次挥手
    一道算法题-不用加减乘除做加法
    OSI七层模型与TCP/IP五层模型
    Socket编程
  • 原文地址:https://www.cnblogs.com/Wurq/p/3750273.html
Copyright © 2011-2022 走看看