zoukankan      html  css  js  c++  java
  • 复利计算

    #include<stdio.h>
    #include<math.h>
    
    double principal=0,mount=0;
    int year=0;
    int n=1;
    double rate;
    
    void danli(){
        printf("请输入的本金:");
        scanf("%lf",&principal);
        printf("请输入年限:");
        scanf("%d",&year);
    
        printf("请输入年利率:");
        scanf("%lf",&rate);
        mount=principal+principal*rate*year;
        printf("本息为:%.2lf
    ",mount);
    
    
    }
    
    void fuli(){
    
        printf("请输入本金:");
        scanf("%lf",&principal);
        printf("请输入年限:");
        scanf("%d",&year);
        printf("请输入年利率:");
        scanf("%lf",&rate);
        printf("请输入年复利次数:");
        scanf("%d",&n);
        rate=pow((1+rate/n),n)-1;
        mount=principal*pow((1+rate),year);
        printf("本息为:%.2lf
    ",mount);
    
    }
    
    void principaljisuan(){
        printf("请输入期望的收益:");
        scanf("%lf",&mount);  
        printf("请输入年限:");
        scanf("%d",&year);
        printf("请输入年利率:");
        scanf("%lf",&rate);
        printf("请输入年复利次数:");
        scanf("%d",&n);
        rate=pow((1+rate/n),n)-1;
        principal=mount/pow((1+rate),year);
        printf("输出所需本金为:%.2lf
    ",principal);
    
    }
    
    main(){
        int num=0;
    printf("|----------------------------------------------------------|
    ");
    printf("|      1.复利计算                                      |
    ");
    printf("|      2.单利计算                                      |
    ");
    printf("|      3.计算本金                                      |
    ");
    printf("|----------------------------------------------------------|
    ");
    printf("请输入选择:");
    scanf("%d",&num);
    switch(num){
    case 1:
        fuli(); 
        break;
    case 2:
       danli();
        break;
    case 3:
        principaljisuan();
    default:
        return 0;
    
    }
    
    }
    

      

  • 相关阅读:
    Uva1595 对称轴
    Uva712 S树
    Uva673 平衡的括号
    leetcode102 二叉树的层次遍历
    Uva10191 复合词
    C++ multimap的用法
    Uva1103 古代象形符号
    UVa10763 交换学生
    C++ 优先级队列 priority_queue
    ios,zepto穿透解决方案
  • 原文地址:https://www.cnblogs.com/7763255qw/p/5268745.html
Copyright © 2011-2022 走看看