zoukankan      html  css  js  c++  java
  • 四则运算

    #include <stdlib.h>
    #include<stdio.h>
    #include <iostream.h>
    #include <conio.h>
    #include <time.h>
    int main()

      int a = 0;
      int b = 0;
      int mode = 0;
      int c=0;
      int result = 0;
      int score = 0;
      int i = 0;
      int n;
      int x;
      for(i=0;i<30;i++)
      {
         a = rand() % 100;
         b = rand() % 100;  
         mode = rand() % 4;      
         printf("%d", a);   
         switch(mode)        
      {          
             case 0:
        printf("+ ");               
                 result= a + b;         
              break;          
             case 1:
        printf("- ");               
                 result= a - b;               
              break;
       case 2:
        printf("x ");               
                 result= a * b;              
              break;          
             case 3:               
                 printf("÷ ");               
                 result= a / b;
              break;          
              default:              
                 printf("somethingis wrong!\n");               
              break;         
      }
         printf("%d = ", b);
         if(result==a/b&&a!=4&&b!=2)
      {
       scanf("%d/%d",&n,&x);
          getchar();
          if(n/x==a/b)
       {
        score+= 10;            
                 printf("Right\n\n");
       }
             else       
       { 
                 printf("Wrong\n\n");
                 getchar();       
       }
      }
        else
     {
      scanf("%d",&c);
            getchar();
            if(c==result)         
      {
       score+= 10;            
                printf("Right\n\n"); 
      }
      else       
      { 
       printf("Wrong\n\n");
                getchar();
      }
     }
     }
       printf("Yourscore is: %d\n\n\n", score);   
       return 1;
    }

  • 相关阅读:
    word无法启动转换器RECOVR32.CNV
    win10致远OA显示正在转换。请稍等,不能获取office文件转换服务
    视频编辑剪辑软件
    软件质量属性——可修改性
    《架构之美》阅读笔记五
    架构漫谈一
    《架构之美》阅读笔记三
    《架构之美》阅读笔记二
    机器学习七讲——最优化
    机器学习六讲——降维
  • 原文地址:https://www.cnblogs.com/hcwys/p/7608837.html
Copyright © 2011-2022 走看看