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

    四则运算终极版要求:

    1、生成的题目中计算过程不能产生负数,也就是说算术表达式中如果存在e1-e2的子表达式,那么结果大于等于0;

    2、生成的题目中如果存在形式如e1/e2的子表达式,那么其结果应该是真分数。

    3、每道题目中出现的运算符个数不超过3个,括号不做详细要求。

    <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
    <html xmlns="http://www.w3.org/1999/xhtml">
     <head>
      <title> new document </title>
      <meta http-equiv="Content-Type" content="text/html; charset=utf-8">
      <meta name="generator" content="editplus" />
      <meta name="author" content="" />
      <meta name="keywords" content="" />
      <meta name="description" content="" />
     </head>
    
     <body>
     <button type='button' onclick="play_all()">开始生成题目</button>
     <font face="宋体">
     <font size="5">
     <font color="#FF0000">
     <body background="imagescute.jpg">
     <span id="text"></span>
     <span id="text2"></span>
     </body>
     <script>
      function GetRandomNum(Min,Max)
        {   
            var Range = Max - Min;   
            var Rand = Math.random();   
            return(Min + Math.round(Rand * Range));   
        }
        function max_num(x,y) {
            var t;
            while (y) {
                t = x%y;
                x = y;
                y = t;
            }
            return x;
        }
        function fenshu(a,b,p) {
            if (p==1) {
                if (a>b) {
                    return a+"/"+b;
                }else if(a<b){
                    return a+"/"+b;
                }else {
                    return 1;
                }
            }else {
                var x=a/p;
                var y=b/p;
                if(y==1){
                    return x;
                }else{
                    return x+"/"+y;
                }
            }
        }
        function f_count(a,b,c,d) {
                var Arr = ["+","-","*","/"];  
                var n = GetRandomNum(0,3);
                switch(Arr[n]){
                    case "+":{
                    var sum_x=(a*d)+(b*c);
                    var sum_y=b*d;
                    max_x=max_num(sum_x,sum_y);
                    max_y=max_num(sum_x,sum_y);
                    var N=fenshu(sum_x,sum_y,max_x);
                    return a+"/"+b+"+"+c+"/"+d+"="+N;
                    break;
                    }
                    case "-":{
                    var sum_x=(a*d)-(b*c);
                        while (sum_x<0) {
                            var a = GetRandomNum(1,30);    
                            var b = GetRandomNum(1,30);
                            var c = GetRandomNum(1,30);    
                            var d = GetRandomNum(1,30);
                            var sum_x=(a*d)-(b*c);
                        }
                    var sum_y=b*d;
                    max_x=max_num(sum_x,sum_y);
                    max_y=max_num(sum_x,sum_y);
                    var N=fenshu(sum_x,sum_y,max_x);
                    return a+"/"+b+"-"+c+"/"+d+"="+N;
                    break;
                    }
                    case "*":{
                    var sum_x=a*c;
                    var sum_y=b*d;
                    max_x=max_num(sum_x,sum_y);
                    max_y=max_num(sum_x,sum_y);
                    var N=fenshu(sum_x,sum_y,max_x);
                    return a+"/"+b+"*"+c+"/"+d+"="+N;
                    break;
                    }
                    case "/":{
                    var sum_x=a*d;
                    var sum_y=b*c;
                    max_x=max_num(sum_x,sum_y);
                    max_y=max_num(sum_x,sum_y);
                    var N=fenshu(sum_x,sum_y,max_x);
                    return a+"/"+b+"÷"+c+"/"+d+"="+N;
                    break;
                    }
                }
        }
        function count(a,b){
                var Arr = ["+","-","*","/"];  
                var n = GetRandomNum(0,3);
                switch(Arr[n]){
                    case "+":{
                    var sum=a+b;
                    return a+"+"+b+"="+sum;
                    break;
                    }
                    case "-":{
                    var sum=a-b;
                    while(sum<0){
                        var a = GetRandomNum(1,30);
                        var b = GetRandomNum(1,30);
                        var sum=a-b;
                    }
                    return a+"-"+b+"="+sum;
                    break;
                    }
                    case "*":{
                    var sum=a*b;
                    return a+"*"+b+"="+sum;
                    break;
                    }
                    case "/":{
                    var sum=a/b;
                    while(a%b!==0){
                        var max_x=max_num(a,b);
                        var N=fenshu(a,b,max_x);
                        return a+"÷"+b+"="+N;
                    }
                    return a+"÷"+b+"="+sum;
                    break;
                    }
                }
        }
        function pl_f() {
            var son_a = GetRandomNum(1,30);    
            var par_b = GetRandomNum(1,30);
            var son_c = GetRandomNum(1,30);    
            var par_d = GetRandomNum(1,30);
            var suma=f_count(son_a,par_b,son_c,par_d);
            return suma;
        }
        function pl() {
                var a = GetRandomNum(1,30);   
                var b = GetRandomNum(1,30);
                var sumb=count(a,b);
                return sumb;
        }
        function play_all() {
                for (i = 1; i <=30; i++) {
                    var a = GetRandomNum(0,1);
                    document.getElementById("text").innerHTML+=("<br>"+"第"+i+"题:");
                    switch (a) {
                        case 0:
                            var A=pl();
                            var strs = A.split("=");
                            document.getElementById("text").innerHTML+=(strs[0]+"="+"<br>");
                            document.getElementById("text2").innerHTML+=("<br>"+"第"+i+"题答案:"+strs[1]);
                            break;
                        case 1:
                            var B=pl_f();
                            var strs = B.split("=");
                            document.getElementById("text").innerHTML+=(strs[0]+"="+"<br>");
                            document.getElementById("text2").innerHTML+=("<br>"+"第"+i+"题答案:"+strs[1]);
                            break;
                    }
                }
        }
     </script>
    </html>

  • 相关阅读:
    JAVA的反射理解
    网络编程-小结
    JAVA多线程的总结
    Mysql基本语句的总结
    IO流
    JAVA集合介绍
    时间复杂度
    JAVA面向对象-多态的理解
    求A的B次方
    最大公约数
  • 原文地址:https://www.cnblogs.com/liyan-luckygirl/p/5358548.html
Copyright © 2011-2022 走看看