• 加减法的生成


    #include <stdio.h>
    #include<stdlib.h>
    #include<time.h>
    #include<math.h>

    int multiplication(long num) //有乘除法
    {
    int a,b,c,p,i;
    int x = num+1;
    a=rand()%x;
    b=rand()%x;
    p=rand()%4;
    if(p==0)
    {
    if(a<b)
    {
    c=a;
    a=b;
    b=c;
    }
    printf(" %d-%d= ",a,b);
    }
    if(p==1)
    printf(" %d+%d= ",a,b);
    if(p==2)
    printf(" %d×%d= ",a,b);
    if(p==3)
    printf(" %d÷%d= ",a,b);
    }

    void no_multiplication(long num) //无乘除法
    {
    int a,b,c,p,i;
    int x = num+1;
    a=rand()%x;
    b=rand()%x;
    p=rand()%2;
    if(p==1)
    printf(" %d+%d= ",a,b);
    if(p==0)
    {
    if(a<b)
    {
    c=a;
    a=b;
    b=c;
    }
    printf(" %d-%d= ",a,b);
    }
    }

    int main()
    {
    int i; /极限/计数器

    long num; //数据范围
    char IsMul[5];
    srand(time(0));
    printf("请输入算数题目范围(即所允许的最大值) ");
    scanf("%ld",&num);
    printf("请输入是否加入乘除法,‘yes’ OR ‘no’ ");
    scanf("%s",IsMul);
    printf("***********************题目为:*********************** ");
    if(strcmp(IsMul,"yes")==0)
    {
    for(i=0;i<20;i++)
    multiplication(num);
    }
    else {
    for(i=0;i<20;i++)
    no_multiplication(num);
    }


    return 0;
    }

  • 相关阅读:
    字符串对比
    时间转换
    fJ字符串
    Codeforces 1526D
    HDU
    树链剖分入门
    AcWing 252. 树(点分治模版题)
    HDU-4487 Maximum Random Walk(概率dp)
    acwing 316 减操作(dp)
    CodeForces
  • 原文地址:https://www.cnblogs.com/wsndlzl/p/5356474.html
Copyright © 2020-2023  润新知