zoukankan      html  css  js  c++  java
  • 代码复查

    我复审的是胡新宇的代码,我参考了教材的内容,根据教材一步一步地进行了复审,我首先通过VS2015进行了运行,程序可以运行出来,通过测试四则运算程序也没有发生乱码或者闪退等bug。然后我又一步一步地分析他每一行代码的内容和含义,可以很清楚明白的看出他的思想还有要完成的内容。通过对他的代码复审发现其中有很多值得我学习的地方,就如同作业第一道题是一样的,他有着非常严格的代码规范,每一行都可以清楚的看出他思想,而 且代码也没有出现繁复。以后要向他学习。

    附其部分代码以便日后学习参考:

    #include<stdio.h>
    #include<stdlib.h>
    #include<time.h>
    #include<math.h>
    void Shengcheng();
    void Simple();
    void real();
    void result();
    int MaxGYS(int a, int b);
    int system(const char *string);

    int main(void)
    {
        int n;
    Loop1: printf(" 耿丹13计科-1胡新宇 [1] 小学数学无分数十道四则运算练习题 [2]小学数学分数四则运算练习题 [3] 退出程序 请输入相应的选项,按回车键确定:");
        scanf_s("%d", &n);
        system("cls");
        if (n == 1)
            Shengcheng();//到整数十道题界面
        else
            if (n == 2)
                result();//分数界面
        else
            if (n == 3)
            {
                printf(" 再见 ");//退出界面
                return 0;
            }
            else
                printf("输入错误请重新输入");//错误提示
        goto Loop1;//回到主界面
        return 0;
    }

    void Shengcheng()//整数十道运算随机题
    {
        int i, a, b, p, q, r, c, sum = 0, d = 0, e = 0;
        srand((unsigned)time(NULL));
        printf("请做下面十道四则运算题,加油哦! ");
        for (i = 0; i < 10; i++)
       {
            a = rand() % 50;
            b = rand() % 50;
            p = rand() % 50;
            q = rand() % 50;
            r = rand() % 50;
            while (r == 0)
            {
                i--;
            }
            while (r != 0)
            {
                printf("请输入你的答案:%d+%d-%d*%d/%d=", a, b, p, q, r);
                scanf_s("%d", &c);
                printf(" ");
                if ((a + b - p*q / r) == c)

                {
                    printf("恭喜你答对了!干的不错! ");
                    sum = sum + 10;
                    e = e + 1;
                }
                else
                {
                    printf("答案错误!请继续努力! ");
                    d = d + 1;
                }
                break;//返回
            }
            continue;
        }
        printf("你总共答对了%d道题,答错了%d道题。 ", e, d);

        printf("你的得分为:%d分继续努力哟! ", sum);
        return ;
    }

    void Simple()
    {
        int m, b, c, d, t;
        m = rand() % 3 + 1;
        b = rand() % 20 + 1;
        c = rand() % 20 + 1;
        switch (m)
        {
        case 1: {
            d = b + c;
            printf("%d+%d= %d ", b, c, d);
        }break;
        case 2: {
            if (b>c)
            {
                t = b;
                b = c;
                c = t;
            }
            d = b - c;
            printf("%d-%d= %d ", b, c, d);
        }break;
        case 3: {
            d = b*c;
            m = rand() % 2 + 1;
            if (m == 1)
                printf("%d*%d= %d ", b, c, d);
            else
                printf("%d/%d= %d ", d, b, c);
        } break;
        }
        return;
    }
    void real()//分子分母
    {
        int a, b, c, d, e, f, g, h, t;
        a = rand() % 4 + 1;
        b = rand() % 9 + 1;//第一个数字分子
        c = rand() % 9 + 1;//第一个数字分母
        d = rand() % 9 + 1;//第二个数字分子
        e = rand() % 9 + 1;//第二个数字分母
        if (b>c)
        {
            t = b;
            b = c;
            c = t;
        }
        if (d>e)
        {
            t = d;
            d = e;
            e = t;
        }
        switch (a)
        {
        case 1: {
            f = c*e;
            g = b*e + d*c;
            h = MaxGYS(g, f);
            f = f / h;
            g = g / h;
            printf("(%d/%d)+(%d/%d)= (%d/%d) ", b, c, d, e, g, f);
        }break;
        case 2: {
            f = c*e;
            g = b*e - d*c;
            if (g>0)
            {
                h = MaxGYS(g, f);
                f = f / h;
                g = g / h;
                printf("(%d/%d)-(%d/%d)= (%d/%d) ", b, c, d, e, g, f);
            }
            else
            {
                g = abs(g);
                h = MaxGYS(g, f);
                f = f / h;
                g = g / h;
                printf("(%d/%d)-(%d/%d)= (%d/%d) ", d, e, b, c, g, f);
            }
        }break;
        case 3: {
            f = c*e;
            g = b*d;
            h = MaxGYS(g, f);
            f = f / h;
            g = g / h;
            printf("(%d/%d)*(%d/%d)= (%d/%d) ", b, c, d, e, g, f);
        }break;
        case 4: {
            f = b*e;
            g = c*d;
            h = MaxGYS(g, f);
            f = f / h;
            g = g / h;
            printf("(%d/%d)/(%d/%d)= (%d/%d) ", b, c, d, e, g, f);
        }
        default:break;
        }
        return;
    }
    int MaxGYS(int a, int b)//定义a,b中的最大值为整型变量
    {
        int c, t;
        if (a<b)
        {
            t = a;
            a = b;
            b = t;
        }
        while (b != 0)
        {
            c = a%b;
            a = b;
            b = c;
        }
        return a;
    }
    void result()//分数四则随机题
    {
        int m, i;
        for (i = 0; i<30; i++)
        {
            m = rand() % 2 + 1;
            if (m == 1)
                Simple();
            else
                real();
        }
        system("pause");
        system("cls");
        system("pause");
        system("cls");
        return  ;

    }

  • 相关阅读:
    STM32使用定时器实现输入捕获
    Leetcode#101 Symmetric Tree
    Leetcode#100 Same Tree
    Leetcode#26 Remove Duplicates from Sorted Array
    Leetcode#27 Remove Element
    Leetcode#83 Remove Duplicates from Sorted List
    Leetcode#70 Climbing Stairs
    Leetcode#66 Plus One
    Leetcode#36 Valid Sudoku
    Leetcode#67 Add Binary
  • 原文地址:https://www.cnblogs.com/HAOZHE/p/5308336.html
Copyright © 2011-2022 走看看