• 四则运算程序


    题目
    1.除了整数以外,还要支持真分数的四则运算,真分数的运算,例如:1/6 + 1/8 = 7/24 2.运算符为 +, −, ×, ÷ 3.并且要求能处理用户的输入,并判断对错,打分统计正确率。 4.要求能处理用户输入的真分数, 如 1/2, 5/12 等 5.使用 -n 参数控制生成题目的个数,例如执行下面命令将生成10个题目 Myapp.exe -n 10

    分析
    1.能够自动生成四则运算;
    2.随机生成分数运算或整数运算;
    3.用户自定义题目生成的数量;
    4.程序判断对错并给出正确答案;
    5.答完题后给出正确率。

    思路
    1.通过定义四个整数,来组合成两个分数,并且通过简单的替换函数来确保生成的分数为真分数。
    2.能够通过用户输入的答案判断对错,并统计正确率。

    代码
    #include<iostream.h>
    #include<stdlib.h>
    #include<time.h>
    void boom()
    {
        float x,y;
        int z,t;        //x,y分别表示所产生的两个数,z来控制做加减乘除
        int first_num,second_num,third_num,fourth_num;
        srand(time(NULL));
        int n;
        float k;
        float d;//代表输入的答案
        float daan[100];//代表正确答案
        int zq=0;//用来表示正确答案的个数
        int cw=0;//用来表示错误答案的个数
        cout<<"需要列出多少到数学题?"<<endl;
        cin>>n; 
        cout<<"********************************"<<endl;
        for(int i=0;i<n;i++)
        {
            z=rand()%4;
            first_num=rand()%10;
            second_num=rand()%10;
            third_num=rand()%10;
            fourth_num=rand()%10;
            if (second_num==1)
            {
                x=(float)first_num;
            }
            else if(first_num>second_num)
                {
                    t=first_num;
                    first_num=second_num;
                    second_num=t;        
                }
                x=(float)first_num/second_num;
            if (fourth_num==1)
            {
                y=(float)third_num;
            }
            else if(third_num>fourth_num)
                {
                    t=third_num;
                    third_num=fourth_num;
                    fourth_num=t;                
                }
                y=(float)third_num/fourth_num;
            z=rand()%4;
            switch(z)
            {
            case 0:
                cout<<i+1<<"、 "<<first_num<<"/"<<second_num<<"+"<<third_num<<"/"<<fourth_num<<"="<<"     ";
                daan[i+1]=x+y;
                break;
                
            case 1:
                cout<<i+1<<"、 "<<first_num<<"/"<<second_num<<"-"<<third_num<<"/"<<fourth_num<<"="<<"     ";        
                daan[i+1]=x-y;
                break;
            case 2:
                cout<<i+1<<"、 "<<first_num<<"/"<<second_num<<"*"<<third_num<<"/"<<fourth_num<<"="<<"     ";
                daan[i+1]=x*y;
                break;
            case 3:
                if(y!=0)
                {
                cout<<i+1<<"、 "<<first_num<<"/"<<second_num<<"÷"<<third_num<<"/"<<fourth_num<<"="<<"     ";
                }
                else
                {
                    i=i-1;
                }
                daan[i+1]=(float)x/y;
                break;
            }
            if((i+1)%3==0)
            {
                for(int c=0;c<=1;c++)
                {
                    cout<<endl;
                }
            }
            if((i+1)==n)
            {
                cout<<endl;
            }
        }
        for(i=1;i<=n;i++)
        {
            cout<<"请作答:"<<endl;
            cout<<i<<"、";
            cin>>d;
            if(d==daan[i])
            {
                cout<<"恭喜您,回答正确!"<<endl;
                cout<<endl;
                zq=zq+1;
            }
            else
            {
                cout<<"回答错误,正确答案为:"<<"  "<<daan[i]<<endl;
                cout<<endl;
                cw=cw+1;
            }
        }
        k=(float)zq/n;
        cout<<"回答正确的数量为:"<<" "<<zq<<"个"<<endl;
        cout<<"回答错误的数量为:"<<" "<<cw<<"个"<<endl;
        cout<<"正确率为:"<<" "<<k<<endl;
    }
    int main()
    {
        boom();    
        int c;//c代表输入是否继续的数字
        cout<<"要继续答题吗?(0:继续  1:退出)"<<endl;
        cin>>c;
        if(c==0)
        {
            cout<<endl;
            main();
        }
        else
        {
            cout<<endl;
            return 0;
        }
        
        return 0;
    }
  • 相关阅读:
    [UVA 10603]Fill
    [BZOJ 4152][AMPPZ 2014]The Captain
    P4779单源最短路径(标准版)
    P3372 线段树模版1
    P1776宝物筛选
    最长上升子序列模版
    01背包问题
    SHOI2008 汉诺塔
    log P1080国王游戏
    最小生成树模版 Kruskal
  • 原文地址:https://www.cnblogs.com/XGQXGQ/p/7613229.html
Copyright © 2020-2023  润新知