• 3/9


    作业(必做题):

    1. 使用while循环输出1 2 3 4 5 6 8 9 10

    n = 1
    while n < 11:
    if n == 7:
    n += 1
    continue
    else:
    print(n)
    n += 1

    2. 求1-100的所有数的和

    sum = 0
    n = 1
    while n <= 100:
    sum += n
    n += 1
    print(sum)

    3. 输出 1-100 内的所有奇数

    n = 1
    while n <= 100:
    if n % 2 == 1:
    print(n)
    n += 1
    else:
    n += 1

    4. 输出 1-100 内的所有偶数

    n = 1
    while n <= 100:
    if n % 2 != 1:
    print(n)
    n += 1
    else:
    n += 1

    5. 求1-2+3-4+5 ... 99的所有数的和

    sum1 = 0
    sum2 = 0
    n = 1
    i = 1
    while n <= 99:
    if n % 2 == 1:
    sum1 += n
    n += 1
    else:
    n += 1
    while i <= 99:
    if i % 2 != 1:
    sum2 += i
    i += 1
    else:
    i += 1
    print(sum1 - sum2)

    6. 用户登陆(三次机会重试)

    name = '123'
    pwd = '456'
    n = 0
    while n < 3:
    user_name = input('请输入id:')
    user_pwd = input('请输入密码:')
    if user_name == name and user_pwd == pwd:
    print('登录成功')
    break
    else:
    print('登录失败')
    n += 1
    else:
    print('登录失败,请稍后再试。')

    7:猜年龄游戏

    要求:
    允许用户最多尝试3次,3次都没猜对的话,就直接退出,如果猜对了,打印恭喜信息并退出
    

    age = '1111'
    chance = 0
    while chance < 3:
    guess_age = input('快来猜一猜:')
    if guess_age == age:
    print('牛逼猜对了')
    break
    else:
    print('错了再猜')
    chance += 1

    8:猜年龄游戏升级版(选做题)

    要求:
    允许用户最多尝试3次
    每尝试3次后,如果还没猜对,就问用户是否还想继续玩,如果回答Y或y, 就继续让其猜3次,以此往复,如果回答N或n,就退出程序
    如何猜对了,就直接退出
    age = '1111'
    yes = ['y', 'Y']
    no = ['n', 'N']
    tag = True
    chance = 0
    while tag:
    guess_age = input('快来猜一猜:')
    if guess_age == age:
    print('猜对了恭喜你')
    tag = False
    else:
    print('猜错了')
    chance += 1
    if chance == 3:
    answer = input('继续请输入y/Y,退出请输入n/N:')
    if answer in yes:
    tag = True
    chance = 0
    elif answer in no:
    print('欢迎下次使用!')
    tag = False
    else:
    print('输入错误 程序结束!')
    tag = False

  • 相关阅读:
    Saltstack module acl 详解
    Saltstack python client
    Saltstack简单使用
    P5488 差分与前缀和 NTT Lucas定理 多项式
    CF613D Kingdom and its Cities 虚树 树形dp 贪心
    7.1 NOI模拟赛 凸包套凸包 floyd 计算几何
    luogu P5633 最小度限制生成树 wqs二分
    7.1 NOI模拟赛 dp floyd
    springboot和springcloud
    springboot集成mybatis
  • 原文地址:https://www.cnblogs.com/bailongcaptain/p/12450576.html
Copyright © 2020-2023  润新知