zoukankan      html  css  js  c++  java
  • 计应193第一组个人流程——康帅

    from fractions import Fraction
    def newint():
        opr = ['', '', '×', '÷']
        fh = random.randint(0, 3)
        n1 = random.randint(1, 20)
        n2 = random.randint(1, 20)
        rjg = 0
        if fh == 0:
            rjg = n1 + n2
        elif fh == 1:
            n1, n2 = max(n1, n2), min(n1, n2)
            rjg = n1 - n2
        elif fh == 2:
            rjg = n1 * n2
        elif fh == 3:
            n1, n2 = max(n1, n2), min(n1, n2)
            while n1 % n2 != 0:
                n1 = random.randint(1, 10)
                n2 = random.randint(1, 10)
                n1, n2 = max(n1, n2), min(n1, n2)
            rjg = int(n1 / n2)
        print(n1, opr[fh], n2, '= ', end='')
        return rjg
    def newfra():
        opr = ['', '', '×', '÷']
        fh = random.randint(0, 3)
        t1 = random.randint(1, 10)
        t2 = random.randint(t1, 10)
        n1 = Fraction(t1, t2)
        t1 = random.randint(1, 10)
        t2 = random.randint(t1, 10)
        n2 = Fraction(t1, t2)
        rjg = 0
        if fh == 0:
            rjg = n1 + n2
        elif fh == 1:
            n1, n2 = max(n1, n2), min(n1, n2)
            rjg = n1 - n2
        elif fh == 2:
            rjg = n1 * n2
        elif fh == 3:
            n1, n2 = max(n1, n2), min(n1, n2)
            rjg = n1 / n2
        print(n1, opr[fh], n2, '= ', end='')
        return rjg
    def newtest():
        opr = ['', '', '×', '÷']
        print('输入题库所需要的题目数量')
        n=int(input())
        rjg=[]
        m=0
        while m<=(n-1):
            fh = random.randint(0, 4)
            if fh==0:
                print(m+1,end='')
                rjg.append(newfra())
                print(' ')
            else:
                print(m+1,end='')
                rjg.append(newint())
                print(' ')
            m=m+1
        m=0
        print('答案:')
        while m<=(n-1):
            print(m+1,'',rjg[m])
            m=m+1
    print('1、四则运算')
    print('2、制作题库')
    n=int(input())
    if n==1:
        print('input "0000" to Quit')
        while True:
            fh = random.randint(0, 4)
            if fh == 0:
                rjg = newfra()
                jg = input()
                if jg == '0000':
                    break;
                sr = Fraction(jg)
                if sr == rjg:
                    print('right')
                else:
                    print('error. the Tight answer is', rjg)
            else:
                rjg = newint()
                jg = input()
                if jg == '0000':
                    break;
                sr = int(jg)
                if sr == rjg:
                    print('right')
                else:
                    print('error. the Tight answer is', rjg)
    if n==2:
        newtest()
  • 相关阅读:
    Mapreduce实例-Top Key
    Mapreduce实例-分组排重(group by distinct)
    storm0.9.0.1升级安装
    mysql配置文件my.cnf详解
    MYSQL管理之主从同步管理
    一个经典实用的iptables shell脚本
    sed实例精解--例说sed完整版
    常用的主机监控Shell脚本
    Python(九)Tornado web 框架
    缓存、队列(Memcached、redis、RabbitMQ)
  • 原文地址:https://www.cnblogs.com/bladepoint/p/14645140.html
Copyright © 2011-2022 走看看