PTA团体程序设计天梯赛-练习集L1(Python3实现)

​​​​​​​目录

L1-001 Hello World

L1-002 打印沙漏

L1-003 个位数统计

L1-004 计算摄氏温度

L1-005 考试座位号

L1-006 连续因子

L1-007 念数字

L1-008 求整数段和

L1-009 N个数求和

L1-010 比较大小

L1-011 A-B

L1-012 计算指数

L1-013 计算阶乘和

L1-014 简单题

L1-015 跟奥巴马一起画方块

L1-016 查验身份证

L1-017 到底有多二

L1-018 大笨钟

L1-019 谁先倒

L1-020 帅到没朋友

L1-021 重要的话说三遍

L1-022 奇偶分家

L1-023 输出GPLT

L1-024 后天

L1-025 正整数A+B

L1-026 I Love GPLT

L1-027 出租

L1-028 判断素数

L1-029 是不是太胖了

L1-030 一帮一

L1-031 到底是不是太胖了

L1-032 Left-pad

L1-033 出生年

L1-034 点赞

L1-035 情人节

L1-036 A乘以B

L1-037 A除以B

L1-038 新世界

L1-039 古风排版

L1-040 最佳情侣身高差

L1-041 寻找250

L1-042 日期格式化

L1-043 阅览室

L1-044 稳赢

L1-045 宇宙无敌大招呼

L1-046 整除光棍

L1-047 装睡

L1-048 矩阵A乘以B

L1-049 天梯赛座位分配

L1-050 倒数第N个字符串

L1-051 打折

L1-052 2018我们要赢

L1-053 电子汪

L1-054 福到了

L1-055 谁是赢家

L1-056 猜数字

L1-057 PTA使我精神焕发

L1-058 6翻了

L1-059 敲笨钟

L1-060 心理阴影面积

L1-061 新胖子公式

L1-062 幸运彩票

L1-063 吃鱼还是吃肉

L1-064 估值一亿的AI核心代码

L1-065 嫑废话上代码

L1-066 猫是液体

L1-067 洛希极限

L1-068 调和平均

L1-069 胎压监测

L1-070 吃火锅

L1-071 前世档案

L1-072 刮刮彩票

L1-073 人与神

L1-074 两小时学完C语言

L1-075 强迫症

L1-076 降价提醒机器人

L1-077 大笨钟的心情

L1-078 吉老师的回归

L1-079 天梯赛的善良

L1-080 乘法口诀数列

L1-081 今天我要赢

L1-082 种钻石

L1-083 谁能进图书馆

L1-084 拯救外星人

L1-085 试试手气

L1-086 斯德哥尔摩火车上的题

L1-087 机工士姆斯塔迪奥

L1-088 静静的推荐

L1-089 最好的文档

L1-090 什么是机器学习

L1-091 程序员买包子

L1-092 进化论

L1-093 猜帽子游戏

L1-094 剪切粘贴

L1-095 分寝室

L1-096 谁管谁叫爹

L1-097 编程解决一切

L1-098 再进去几个人

L1-099 帮助色盲

L1-100 四项全能

L1-101 别再来这么多猫娘了!

L1-102 兰州牛肉面

L1-103 整数的持续性

L1-104 九宫格


L1-001 Hello World

print("Hello World!")

L1-002 打印沙漏

n, m = input().split()
h = int(((int(n)+1)/2)**0.5)
sum_m = 0
for i in range(h,0,-1):
    print(" "*(h-i) + m*(2*i-1))
    sum_m += 2*i-1
for j in range(2,h+1):
    print(" "*(h-j) + m*(2*j-1))
    sum_m += 2 * j - 1
print(int(n)-sum_m)
n, m = input().split()
h = 0
sum_m = 0
while int(n) >= sum_m:
    h += 1
    sum_m = 2 * h**2 - 1
h -= 1
sum_m = 2 * h**2 - 1
for i in range(h,0,-1):
    print(" "*(h-i) + m*(2*i-1))
for j in range(2,h+1):
    print(" "*(h-j) + m*(2*j-1))
print(int(n)-sum_m)

L1-003 个位数统计

n = input()
s = {}
for i in n:
    if i in s:
        s[i] = s[i] + 1
    else:
        s[i] = 1
for i in sorted(s):
    print(i, s[i], sep=":")

L1-004 计算摄氏温度

F = eval(input())
C = 5*(F-32)/9
print(f"Celsius = {int(C)}")

L1-005 考试座位号

n = int(input())
lst1 = []
lst2 = []
lst3 = []
for _ in range(n):
    a, b, c = map(int, input().split())
    lst1.append(a)
    lst2.append(b)
    lst3.append(c)
m = int(input())
s = input().split()
for i in s:
    x = lst2.index(int(i))
    print(lst1[x],lst3[x])

L1-006 连续因子

import math

def func(a):
    if a == 1:
        return 1
    else:
        for i in range(2, int(math.sqrt(a))+1):
            if a % i == 0:
                return 0
        else:
            return 1

n = int(input())
if func(n) == 1:
    print("1", n, sep='\n')
else:
    begin = 0
    max_length = 0
    for i in range(2, int(math.sqrt(n))+1):
        N = n
        j = i
        length = 0
        while N % j == 0:
            N = N / j
            j += 1
            length += 1
        if length > max_length :
            begin = i
            max_length = length
    print(max_length, '*'.join(str(k) for k in range(begin, begin+max_length)), sep='\n')

L1-007 念数字

dict1 = {'-':'fu','0':'ling','1':'yi','2':'er','3':'san','4':'si',
         '5':'wu','6':'liu','7':'qi','8':'ba','9':'jiu'}
s = input()
for i in range(len(s)-1):
    print(dict1[s[i]],end=" ")
print(dict1[s[-1]])

L1-008 求整数段和

a, b = map(int, input().split())
sum1 = 0
cnt = 0
for i in range(a, b+1):
    sum1 = i + sum1
    if cnt % 5 == 0 and cnt != 0:
        print()
    print(f'{i: >5}', end="")
    cnt = cnt + 1
print(f'\nSum = {sum1}')

L1-009 N个数求和

from fractions import Fraction

n = int(input())
nums = list(input().split())
s = Fraction('0')
for i in range(n):
    num = Fraction(nums[i])
    s += num
numerator = s.numerator
denominator = s.denominator
if numerator / denominator > 1:
    x = numerator // denominator
    res = s - x
    if res != 0:
        print(f"{x} {res}")
    else:
        print(x)
else:
    print(s)

L1-010 比较大小

a,b,c = map(int,input().split())
list1 = [a,b,c]
list2 = sorted(list1)
print(f"{list2[0]}->{list2[1]}->{list2[2]}")

L1-011 A-B

a = input()
b = input()
for i in b:
    a = a.replace(i,'')
print(a)

L1-012 计算指数

n = int(input())
print(f"2^{n} = {2 ** n}")

L1-013 计算阶乘和

n = int(input())
sum1 = 0
for i in range(1, n+1):
    t = 1
    for j in range(1, i+1):
        t *= j
    sum1 += t
print(sum1)

L1-014 简单题

print("This is a simple problem.")

L1-015 跟奥巴马一起画方块

n, c = input().split()
s = int(n)/2 + 0.5
for _ in range(int(s)):
    print(c*int(n))

L1-016 查验身份证

n = int(input())
M = ['1', '0', 'X', '9', '8', '7', '6', '5', '4', '3', '2']
num = [7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7, 9, 10, 5, 8, 4, 2]
true_id = 0
arror_id = []

for _ in range(n):
    id = input()
    sum1 = 0
    cnt = 0
    flag = True
    if id[:-1].isdigit():
        for i in range(17):
            sum1 += int(id[i]) * num[i]
    else:
        flag = False
    if flag == True and M[sum1%11] == id[-1]:
        true_id += 1
    else:
        arror_id.append(id)

if true_id == n:
    print("All passed")
else:
    for j in arror_id:
        print(j)

L1-017 到底有多二

n = input()
a = n.count("2")
c = 1
if int(n) < 0:
    b = len(n) - 1
    c = 1.5
else:
    b = len(n)
d = 1
if int(n) % 2 == 0:
    d = 2
else:
    pass
res = a / b * c * d * 100
print(f"{res:.2f}%")

L1-018 大笨钟

s = input().split(':')
t = 0
if int(s[1]) > 0:
    t += 1
if int(s[0]) > 12:
    sum1 = int(s[0]) - 12 + t
    for _ in range(sum1):
        print("Dang",end="")
else:
    print(f"Only {s[0]}:{s[1]}.  Too early to Dang.")

L1-019 谁先倒

a, b = map(int, input().split())
a_end = a
b_end = b
n = int(input())
for _ in range(n):
    num = list(map(int, input().split()))
    if num[0] + num[2] == num[1] and num[0] + num[2] != num[3]:
        a_end -= 1
    elif num[0] + num[2] != num[1] and num[0] + num[2] == num[3]:
        b_end -= 1
    if a_end < 0:
        print("A")
        print(b - b_end)
        break
    if b_end < 0:
        print("B")
        print(a - a_end)
        break

L1-020 帅到没朋友

n = int(input())
friend_ID = set()
handsome_ID = []
for _ in range(n):
    k_id = list(input().split())
    if k_id[0] != '1':
        for i in range(1,len(k_id)):
            friend_ID.add(k_id[i])
m = int(input())
check_ID = list(input().split())
for j in check_ID:
    if j not in friend_ID:
        handsome_ID.append(j)
        friend_ID.add(j)
if handsome_ID:
    print(' '.join(handsome_ID))
else:
    print("No one is handsome")

L1-021 重要的话说三遍

for _ in range(3):
    print("I'm gonna WIN!")

L1-022 奇偶分家

n = int(input())
s = list(map(int, input().split()))
a = 0
b = 0
for i in s:
    if i%2 == 0:
        b += 1
    else:
        a += 1
print(f'{a} {b}')

L1-023 输出GPLT

s = list(input().upper())
G_sum = s.count('G')
P_sum = s.count('P')
L_sum = s.count('L')
T_sum = s.count('T')
while G_sum > 0 or P_sum > 0 or L_sum > 0 or T_sum > 0:
    if G_sum != 0:
        print('G', end='')
        G_sum -= 1
    if P_sum != 0:
        print('P', end='')
        P_sum -= 1
    if L_sum != 0:
        print('L', end='')
        L_sum -= 1
    if T_sum != 0:
        print('T', end='')
        T_sum -= 1

L1-024 后天

D = int(input())
s = D + 2
if s > 7:
    s = s - 7
print(s)
D = int(input())
s = D + 2
if s == 7:
    print(s)
else:
    print(s%7)

L1-025 正整数A+B

s = input().split(' ',1)
flag = True
if s[0].isdigit() and s[0].count(".") == 0 and int(s[0]) > 0 and int(s[0]) <= 1000:
    a = int(s[0])
else:
    a = "?"
    flag = False
if s[1].isdigit() and s[1].count(".") == 0 and int(s[1]) > 0 and int(s[1]) <= 1000:
    b = int(s[1])
else:
    b = "?"
    flag = False
if flag:
    res = a + b
else:
    res = "?"
print(f"{a} + {b} = {res}")

L1-026 I Love GPLT

print("I\n \nL\no\nv\ne\n \nG\nP\nL\nT")

L1-027 出租

t = input()
arr = list(sorted(set(t), reverse=True))
ID = []
for i in t:
    idx = arr.index(i)
    ID.append(idx)

print("int[] arr = new int[]{", end='')
for i in range(len(arr)-1):
    print(arr[i], end=',')
print(arr[-1], "};", sep='')

print("int[] index = new int[]{", end='')
for j in range(len(ID)-1):
    print(ID[j], end=',')
print(ID[-1], "};", sep='')
t = input()
arr = list(sorted(set(t), reverse=True))
ID = [arr.index(i) for i in t]

def print_lst(name_lst, lst):
    lst = [str(i) for i in lst]
    print(f"int[] {name_lst} = new int[]", '{', ','.join(lst), "};", sep='')

print_lst("arr", arr)
print_lst("index", ID)

L1-028 判断素数

import math

n = int(input())
for _ in range(n):
    x = int(input())
    if x == 1:
        print("No")
    else:
        for i in range(2, int(math.sqrt(x))+1):
            if x % i == 0:
                print("No")
                break
        else:
            print("Yes")

L1-029 是不是太胖了

h = float(input())
res = (h-100) * 0.9 * 2
print('{:.1f}'.format(res))

L1-030 一帮一

n = int(input())
girl = []
boy = []
student = []
for _ in range(n):
    s = list(input().split())
    student.append(s)
    if s[0] == "0":
        girl.append(s[1])
    else:
        boy.append(s[1])
for i in range(n//2):
    print(student[i][1], end=' ')
    if student[i][0] == "0":
        print(boy.pop())
    else:
        print(girl.pop())

L1-031 到底是不是太胖了

n = int(input())
for _ in range(n):
    h, w = map(int, input().split())
    s = (h - 100) * 0.9 * 2
    if abs(w - s) < s * 0.1:
        print("You are wan mei!")
    elif w <= s * 0.9:
        print("You are tai shou le!")
    else:
        print("You are tai pang le!")

L1-032 Left-pad

n, m= input().split()
s = input()
if len(s) < int(n):
    print(m*(int(n)-len(s)), s, sep='')
else:
    print(s[-int(n):])

L1-033 出生年

y, n =map(int, input().split())
age = 0
while True:
    year = y + age
    year_str = str(year).zfill(4)
    if len(set(year_str)) == n:
        print(age, year_str, sep=' ')
        break
    age += 1

L1-034 点赞

n = int(input())
tags_count = {}
for _ in range(n):
    tags = list(map(int, input().split()))[1:]
    for i in tags:
        tags_count[i] = tags_count.get(i, 0) + 1

sorted_tags = sorted(tags_count.items(), key=lambda x: (-x[1], -x[0]))

max_tag, max_count = sorted_tags[0]
print(max_tag, max_count)

L1-035 情人节

person = []
while True:
    n = input()
    if n != ".":
        person.append(n)
    else:
        break
if len(person) < 2:
    print("Momo... No one is for you ...")
elif 2 <= len(person) < 14:
    print(f"{person[1]} is the only one for you...")
else:
    print(f"{person[1]} and {person[13]} are inviting you to dinner...")

L1-036 A乘以B

A,B = map(int,input().split())
print(A * B)

L1-037 A除以B

a,b = map(int,input().split())
if b > 0:
    res = float(a)/float(b)
    print(f"{a}/{b}={(res):.2f}")
elif b < 0:
    res = float(a)/float(b)
    print(f"{a}/({b})={(res):.2f}")
else:
    print(f"{a}/{b}=Error")

L1-038 新世界

print("Hello World")
print("Hello New World")

L1-039 古风排版

n = int(input())
s = input()
for i in range(n):
    print(''.join(reversed(s[i::n])).rjust(len(s[0::n]),' '))

L1-040 最佳情侣身高差

n = int(input())
for _ in range(n):
    sex, height = input().split()
    if sex == "F":
        res = float(height) * 1.09
    else:
        res = float(height) / 1.09
    print("{:.2f}".format(res))

L1-041 寻找250

num = input().split()
res = 0
for i in num:
    if int(i) == 250:
        print(res+1)
        break
    res += 1

L1-042 日期格式化

date = input()
print(date[6:] + date[2] + date[0:2] + date[5] + date[3:5])

L1-043 阅览室

n = int(input())
book_records = {}
day_time = 1
while day_time <= n:
    total_borrow_time = 0
    borrow_count = 0
    average_borrow_time = 0
    while True:
        record = input().split()
        book_number, action, time = int(record[0]), record[1], record[2]
        if book_number == 0:
            break
        if action == 'S':
            book_records[book_number] = time
        elif action == 'E':
            borrow_time = book_records.get(book_number)
            if borrow_time is not None:
                borrow_hour, borrow_minute = map(int, borrow_time.split(':'))
                return_hour, return_minute = map(int, time.split(':'))
                total_borrow_time += (return_hour - borrow_hour) * 60 + (return_minute - borrow_minute)
                del book_records[book_number]
                borrow_count += 1
    day_time += 1
    book_records.clear()

    if borrow_count > 1:
        average_borrow_time = (total_borrow_time + 1) // borrow_count
        print(borrow_count, average_borrow_time)
    elif borrow_count == 1:
        print(borrow_count, total_borrow_time)
    else:
        print(borrow_count, average_borrow_time)

L1-044 稳赢

def win(a):
    if a == "ChuiZi":
        return "Bu"
    elif a == "JianDao":
        return "ChuiZi"
    else:
        return "JianDao"

k = int(input())
cnt = 0
while True:
    s = input()
    cnt += 1
    if s != "End":
        if cnt % (k+1) != 0:
            print(win(s))
        else:
            print(s)
    else:
        break
k = int(input())
win={"JianDao":"ChuiZi","ChuiZi":"Bu","Bu":"JianDao"}
cnt=0
while True:
    s=input()
    cnt=cnt+1
    if s != "End":
        if cnt % (k+1) != 0:
            print(win[s])
        else:
            print(s)
    else:
        break

L1-045 宇宙无敌大招呼

s = input()
print(f"Hello {s}")

L1-046 整除光棍

x = int(input())
y = 1
while True:
    if y % x == 0:
        print(y // x, end=' ')
        print(len(str(y)))
        break
    y = 10 * y + 1

L1-047 装睡

n = int(input())
for _ in range(n):
    a = input().split()
    if int(a[1]) < 15 or int(a[1]) >20 or int(a[2]) > 70 or int(a[2]) < 50:
        print(a[0])

L1-048 矩阵A乘以B

def dot(M, N):
    X = []
    for i in range(0, len(M)):
        temp = []
        for j in range(0, len(N[0])):
            s = 0
            for k in range(0, len(M[0])):
                s += M[i][k] * N[k][j]
            temp.append(s)
        X.append(temp)
    return X

A = []
B = []
r_A, c_A = map(int, input().split())
for _ in range(r_A):
    a = list(map(int, input().split()))
    A.append(a)
r_B, c_B = map(int, input().split())
for _ in range(r_B):
    b = list(map(int, input().split()))
    B.append(b)
if c_A == r_B:
    AB = dot(A, B)
    print(f"{r_A} {c_B}")
    for i in AB:
        print(" ".join(str(num) for num in i))
else:
    print(f"Error: {c_A} != {r_B}")

L1-049 天梯赛座位分配

n = int(input())
a = list(map(int, input().split()))
num = 10 * sum(a)
ans = [[] for _ in range(n)]
li = [i for i in range(n)]
j = 0
i = 1
while i <= num:
    if len(li) == 1:
        num += num - i
        while i <= num:
            k = li[0]
            ans[k].append(i)
            i+=2
        break
    k = li[j]
    ans[k].append(i)
    i += 1
    if len(ans[k]) == a[k]*10:
        li.remove(k)
        if j >= len(li):
            j = 0
        continue
    if j >= len(li) - 1:
        j = 0
    else:
        j += 1

for i in range(n):
    print(f"#{i+1}")
    m = ans[i]
    for j in range(len(m)):
        print(m[j], end='')
        if j % 10 == 9:
            print()
        else:
            print(' ', end='')

L1-050 倒数第N个字符串

l, n = map(int, input().split())
sum = n - 1
s = ""
for i in range(l-1,0,-1):
    k = sum // pow(26,i)
    s = s + chr(ord("z")-k)
    sum = sum % pow(26,i)
s = s + chr(ord("z")-sum)
print(s)

L1-051 打折

a, b = map(eval, input().split())
s=a * (b/10)
print("{:.2f}".format(s))

L1-052 2018我们要赢

print("2018\nwo3 men2 yao4 ying2 !")

L1-053 电子汪

A, B = map(int, input().split())
s = A + B
print("Wang!"*s)

L1-054 福到了

def get_reverse(a):
    b=[]
    a.reverse()
    for i in a:
        b.append(i[::-1])
    return b

x, n = input().split()
s = []
for _ in range(int(n)):
    s.append(input())
s_reversed = get_reverse(s)
if s == s_reversed:
    print("bu yong dao le")
for i in s_reversed:
    for j in i:
        if j == '@':
            print(x,end='')
        else:
            print(' ',end='')
    print()

L1-055 谁是赢家

pa,pb = map(int,input().split())
pc0 = input().split()
pc1 = 0
pc2 = 0
for i in pc0:
    if i == "0":
        pc1 += 1
    else:
        pc2 += 1
if pa > pb and pc1 >= 1:
    print(f'The winner is a: {pa} + {pc1}')
elif pa < pb and pc2 >= 1:
    print(f'The winner is b: {pb} + {pc2}')
elif pa < pb and pc1 == 3:
    print(f'The winner is a: {pa} + {pc1}')
else:
    print(f'The winner is b: {pb} + {pc2}')

L1-056 猜数字

n = int(input())
name = []
num1 = []
num2 = []
for _ in range(n):
    s = input().split()
    name.append(s[0])
    num1.append(int(s[1]))
res = sum(num1) // (n * 2)
for i in num1:
    num2.append(abs(i - res))
winner = name[num2.index(min(num2))]
print(f"{res} {winner}")

L1-057 PTA使我精神焕发

print("PTA shi3 wo3 jing1 shen2 huan4 fa1 !")

L1-058 6翻了

s = input()
for i in range(len(s),9,-1):
    if '6'*i in s:
        s = s.replace('6'*i,'27')
for j in range(9,3,-1):
    if '6'*j in s:
        s = s.replace('6'*j,'9')
print(s)

L1-059 敲笨钟

n = int(input())
for _ in range(n):
    s = list(input().split(','))
    s1 = list(s[0].split())
    s2 = list(s[1].split())
    if s1[-1][-3:] == "ong" and s2[-1][-4:-1] == "ong":
        print(' '.join(s1),end=', ')
        if len(s2) > 3:
            print(' '.join(s2[:-3]), "qiao ben zhong.")
        else:
            print("qiao ben zhong.")
    else:
        print("Skipped")

L1-060 心理阴影面积

x, y = map(int, input().split())
res = 5000 - 50*y - 50*(100-x)
print(res)

L1-061 新胖子公式

a, b =map(eval, input().split())
s = a / (b**2)
print('{0:<.1f}'.format(s))
if s > 25:
    print("PANG")
else:
    print("Hai Xing")

L1-062 幸运彩票

n = int(input())
for _ in range(n):
    a = input()
    if int(a[0:1]) + int(a[1:2]) + int(a[2:3]) == int(a[3:4]) +int(a[4:5]) + int(a[5:6]):
        print("You are lucky!")
    else:
        print("Wish you good luck.")

L1-063 吃鱼还是吃肉

def check(sex,height,weight):
    s = ""
    if sex == 1:
        if height > 130:
            s = s + "ni li hai!"
        elif height < 130:
            s = s + "duo chi yu!"
        else:
            s = s + "wan mei!"
        if weight > 27:
            s = s + " shao chi rou!"
        elif weight < 27:
            s = s + " duo chi rou!"
        else:
            s = s + " wan mei!"
    else:
        if height > 129:
            s = s + "ni li hai!"
        elif height < 129:
            s = s + "duo chi yu!"
        else:
            s = s + "wan mei!"
        if weight > 25:
            s = s + " shao chi rou!"
        elif weight < 25:
            s = s + " duo chi rou!"
        else:
            s = s + " wan mei!"
    return s

n = int(input())
for _ in range(n):
    sex, height, weight= map(int, input().split())
    print(check(sex, height, weight))

L1-064 估值一亿的AI核心代码

import re

n = int(input())
for _ in range(n):
    s = input()
    print(s)
    s = re.sub(r"(\s+)", ' ', s)
    s = re.sub(r"(^\s+|\s+$|\s+(?=\W))", "", s)
    a = list(s)
    for i in range(len(a)):
        if a[i] != 'I':
            a[i] = a[i].lower()
    s = ''.join(a)
    s = re.sub(r"\bI\b", "@", s)
    s = re.sub(r"\bme\b", "@", s)
    s = re.sub(r"\bcan you\b", "I can", s)
    s = re.sub(r"\bcould you\b", "I could", s)
    s = re.sub(r"@", "you", s)
    s = re.sub(r"\?", '!', s)
    print("AI: " + s)

L1-065 嫑废话上代码

print("Talk is cheap. Show me the code.")

L1-066 猫是液体

a, b, c = map(int, input().split())
v = a * b * c
print(v)

L1-067 洛希极限

a,b,c = map(float,input().split())
x0 = 2.455
x1 = 1.26
if b == 0:
    res = a * x0
else:
    res = a * x1
if res > c:
    print(f'{res:.2f} T_T')
else:
    print(f'{res:.2f} ^_^')

L1-068 调和平均

n = int(input())
print(f'{(1/(sum([1/float(i) for i in input().split()])/n)):.2f}')

L1-069 胎压监测

n = list(map(int, input().split()))
p = n[0:4]
p_max = max(p)
error = 0
error_id = 0
for i in p:
    if p_max - i > n[-1] or i < n[-2]:
        error += 1
        error_id = p.index(i) + 1
if error == 0:
    print("Normal")
elif error == 1:
    print(f"Warning: please check #{error_id}!")
else:
    print("Warning: please check all the tires!")

L1-070 吃火锅

message = []
res = []
while True:
    n = input()
    if n != ".":
        message.append(n)
    else:
        break
print(len(message))
for i in message:
    if "chi1 huo3 guo1" in i:
        res.append(i)
if len(res) != 0:
    print(f"{message.index(res[0])+1} {len(res)}")
else:
    print("-_-#")

L1-071 前世档案

n, m = map(int, input().split())
for _ in range(m):
    anwer = input()
    res = 1
    for i in anwer:
        if i == "y":
            res = res * 2 - 1
        else:
            res = res * 2
    print(res)

L1-072 刮刮彩票

dict1 = {'6': 10000, '7': 36, '8': 720, '9': 360, '10': 80,
         '11': 252, '12': 108, '13': 72, '14': 54, '15': 180,
         '16': 72, '17': 180, '18': 119, '19': 36, '20': 306,
         '21': 1080, '22': 144, '23': 1800, '24': 3600}
matrix = []
num = [i for i in range(1, 10)]

for _ in range(3):
    l = list(map(int, input().split()))
    for i in l:
        if i in num:
            num.remove(i)
    matrix.append(l)

for i in range(3):
    for j in range(3):
        if matrix[i][j] == 0:
            matrix[i][j] = num[0]

x1, y1 = map(int, input().split())
x2, y2 = map(int, input().split())
x3, y3 = map(int, input().split())
d = int(input())

print(matrix[x1-1][y1-1])
print(matrix[x2-1][y2-1])
print(matrix[x3-1][y3-1])

res = 0
if d == 1:
    res += sum(matrix[0])
elif d == 2:
    res += sum(matrix[1])
elif d == 3:
    res += sum(matrix[2])
elif d == 4:
    for i in range(3):
        res += matrix[i][0]
elif d == 5:
    for i in range(3):
        res += matrix[i][1]
elif d == 6:
    for i in range(3):
        res += matrix[i][2]
elif d == 7:
    res = matrix[0][0] + matrix[1][1] + matrix[2][2]
else:
    res = matrix[0][2] + matrix[1][1] + matrix[2][0]
print(dict1[str(res)])

L1-073 人与神

print("To iterate is human, to recurse divine.")

L1-074 两小时学完C语言

N, K, M = map(int, input().split())
result= N - M * K
print(result)

L1-075 强迫症

t = input()
if len(t) == 4:
    if float(t[:2]) < 22:
        print(f'20{t[:2]}-{t[2:4]}')
    else:
        print(f'19{t[:2]}-{t[2:4]}')
else:
    print(f'{t[:4]}-{t[4:6]}')

L1-076 降价提醒机器人

n, m = map(int, input().split())
for _ in range(n):
    p = float(input())
    if p < m:
        print(f"On Sale! {p:.1f}")
    else:
        pass

L1-077 大笨钟的心情

t = list(map(int, input().split()))
while True:
    n = int(input())
    if 0 <= n <= 23:
        if t[n] > 50:
            print(f"{t[n]} Yes")
        else:
            print(f"{t[n]} No")
    else:
        break

L1-078 吉老师的回归

n, m = map(int, input().split())
T0 = []
T1 = []
for _ in range(n):
    t = input()
    T0.append(t)
for i in T0:
    if "qiandao"  not in i and "easy" not in i:
        T1.append(i)
if len(T1) > m:
    print(T1[m])
else:
    print("Wo AK le")

L1-079 天梯赛的善良

n = int(input())
num = list(map(int, input().split()))
num_min = min(num)
num_max = max(num)
m1 = 0
m2 = 0
for i in num:
    if i == num_min:
        m1 += 1
    if i == num_max:
        m2 += 1
print(num_min, m1, sep=' ')
print(num_max, m2, sep=' ')

L1-080 乘法口诀数列

a1, a2, n = map(int, input().split())
res = [a1,a2]
cnt = 1
while len(res) <= n:
    if a1 * a2 <= 9:
        res.append(a1 * a2)
    else:
        res.append(a1*a2 // 10)
        res.append(a1*a2 % 10)
    a1 = res[cnt]
    a2 = res[cnt+1]
    cnt += 1
print(' '.join(map(str, res[:n])))

L1-081 今天我要赢

print("I'm gonna win! Today!")
print("2022-04-23")

L1-082 种钻石

n, v = map(int, input().split())
t = n / v
print(int(t))

L1-083 谁能进图书馆

a, b, c, d = map(int, input().split())
if c >= b and d < a:
    print(f'{c}-Y {d}-Y\nqing 1 zhao gu hao 2')
elif d >= b and c < a:
    print(f'{c}-Y {d}-Y\nqing 2 zhao gu hao 1')
elif c >= a and d >= a:
    print(f'{c}-Y {d}-Y\nhuan ying ru guan')
elif c >= a and d < a:
    print(f'{c}-Y {d}-N\n1: huan ying ru guan')
elif d >= a and c < a:
    print(f'{c}-N {d}-Y\n2: huan ying ru guan')
else:
    print(f'{c}-N {d}-N\nzhang da zai lai ba')

L1-084 拯救外星人

def factorial(n):
    if n == 0 or n == 1:
        return 1
    else:
        return n*factorial(n-1)

A, B = map(int, input().split())
n = A + B
print(factorial(n))

L1-085 试试手气

num_begin = list(map(int, input().split()))
num = num_begin[:]
n = int(input())
for i in range(6):
    if num[i] < 6:
        num[i] = 6
    else:
        num[i] -= 1
for _ in range(n-1):
    for j in range(6):
        num[j] -= 1
        if num[j] == num_begin[j]:
            num[j] -= 1
print(*num)

L1-086 斯德哥尔摩火车上的题

s1 = str(input())
s2 = str(input())
x = ""
y = ""
for i in range(1, len(s1)):
    if int(s1[i]) % 2 == int(s1[i-1]) % 2:
        x += str(max(s1[i], s1[i-1]))
for j in range(1, len(s2)):
    if int(s2[j]) % 2 == int(s2[j-1]) % 2:
        y += str(max(s2[j], s2[j-1]))
if x == y:
    print(x)
else:
    print(x)
    print(y)

L1-087 机工士姆斯塔迪奥

n, m, q = map(int, input().split())
map_nm = [[0 for _ in range(m)] for _ in range(n)]
for _ in range(q):
    t, c = list(map(int, input().split()))
    if t == 0:
        for j in range(m):
            map_nm[c-1][j] = 1
    else:
        for i in range(n):
            map_nm[i][c-1] = 1
count = 0
for i in range(n):
    for j in range(m):
        if map_nm[i][j] == 0:
            count += 1
print(count)

L1-088 静静的推荐

n, k, s = map(int ,input().split())
dict1 = {}
count = 0
for _ in range(n):
    d = list(map(int, input().split()))
    if d[0] >= 175:
        if d[1] >= s:
            count += 1
        else:
            if d[0] in dict1.keys():
                dict1[d[0]] += 1
            else:
                dict1[d[0]] = 1
for i in dict1.keys():
    if dict1[i] > k:
        count += k
    else:
        count += dict1[i]
print(count)

L1-089 最好的文档

print("Good code is its own best documentation.")

L1-090 什么是机器学习

A, B = map(int, input().split())
s = A + B
print(s - 16)
print(s -3)
print(s - 1)
print(s)

L1-091 程序员买包子

n, x, m, k = input().split()
if int(k) == int(n):
    print(f'mei you mai {x} de')
elif int(k) == int(m):
    print(f'kan dao le mai {x} de')
else:
    print(f'wang le zhao mai {x} de')

L1-092 进化论

n = int(input())
for _ in range(n):
    a, b, c = map(int, input().split())
    if c == a * b:
        print("Lv Yan")
    elif c == a + b:
        print("Tu Dou")
    else:
        print("zhe du shi sha ya!")

L1-093 猜帽子游戏

n = int(input())
x = list(map(int, input().split()))
k = int(input())
for _ in range(k):
    y = list(map(int, input().split()))
    num1 = 0
    num2 = 0
    num3 = 0
    for i in range(n):
        if x[i] == y[i]:
            num1 += 1
        elif x[i] != y[i] and y[i] != 0:
            num2 += 1
        else:
            num3 += 1
    if num1 != 0 and num2 == 0:
        print("Da Jiang!!!")
    else:
        print("Ai Ya")

L1-094 剪切粘贴

s = input()
n = int(input())
for _ in range(n):
    m1, m2, a, b = input().split()
    cut = s[int(m1)-1:int(m2)]
    s = s[:int(m1)-1] + s[int(m2):]
    s1 = a + b
    if s1 not in s:
        s = s + cut
    else:
        s = s.replace(s1, a+cut+b, 1)
print(s)
s = input()
n = int(input())
for _ in range(n):
    m1, m2, a, b = input().split()
    cut = s[int(m1)-1:int(m2)]
    s = s[:int(m1)-1] + s[int(m2):]
    s1 = a + b
    if s1 not in s:
        s = s + cut
    else:
        c = s.index(s1)
        s = s[:c+len(a)] + cut + s[c+len(a):]
print(s)

L1-095 分寝室

n0, n1, n = map(int, input().split())
l=[]
for i in range(1, n0):
    if n0 % i == 0 and n1 % (n-i) == 0 and n1 // i > 0 and n1 // (n-i) > 0:
        l.append([i, n-i, abs((n0//i)-(n1//(n-i)))])
if len(l) == 0:
    print('No Solution')
else:
    l.sort(key=lambda x:x[2], reverse=False)
    print(l[0][0], l[0][1])

L1-096 谁管谁叫爹

n = int(input())
for _ in range(n):
    a, b = map(int, input().split())
    s_a = sum(list(map(int, list(str(a)))))
    s_b = sum(list(map(int, list(str(b)))))
    if a % s_b == 0 and b % s_a == 0:
        if a > b:
            print('A')
        else:
            print('B')
    elif a % s_b == 0:
        print('A')
    elif b % s_a == 0:
        print('B')
    else:
        if a > b:
            print('A')
        else:
            print('B')

L1-097 编程解决一切

print("Problem? The Solution: Programming.")

L1-098 再进去几个人

a, b = map(int, input().split())
print(b-a)

L1-099 帮助色盲

a, b = map(int, input().split())
if b == 1:
    print("-")
else:
    if a == 0:
        print("biii")
    elif a == 1:
        print("dudu")
    else:
        print("-")
if a == 0 or a == 2:
    print("stop")
else:
    print("move")

L1-100 四项全能

n, m = map(int ,input().split())
skill = list(map(int, input().split()))
sum_skill = sum(skill)
if sum_skill // n < m - 1:
    print(0)
elif sum_skill // n == m -1:
    print(sum_skill % n)
else:
    print(n)

L1-101 别再来这么多猫娘了!

n = int(input())
error = [input() for _ in range(n)]
k = int(input())
words = input()
for i in error:
    if i in words:
        words = words.replace(i, "/")
cnt = words.count("/")
if cnt < k:
    print(words.replace("/", "<censored>"))
else:
    print(f"{cnt}\nHe Xie Ni Quan Jia!")

L1-102 兰州牛肉面

n = int(input())
price = list(map(float, input().split()))
dict1 = {}
for i in range(1, n+1):
    dict1[str(i)] = 0
while True:
    a, b = input().split()
    if a == '0':
        break
    if a in dict1:
        dict1[a] += int(b)
    else:
        dict1[a] = int(b)
res = 0
for i in range(n):
    print(dict1[str(i+1)])
    res += dict1[str(i+1)] * price[i]
print(f"{res:.2f}")

L1-103 整数的持续性

a, b = map(int, input().split())
num_dict = {}
for i in range(a, b+1):
    num = i
    cnt = 0
    while len(str(num)) != 1:
        x = 1
        for j in str(num):
            x *= int(j)
        num = x
        cnt += 1
    num_dict[i] = cnt
cnt_max = max(num_dict.values())
print(cnt_max)
result = []
for key, value in num_dict.items():
    if value == cnt_max:
        result.append(key)
print(*result)

L1-104 九宫格

def check(lst):
    flag = True
    for i in range(1, 10):
        if lst.count(i) == 1:
            flag = True
        else:
            flag = False
            break
    return flag

n = int(input())
for _ in range(n):
    matrix = [list(map(int, input().split())) for i in range(9)]
    flag = True
    for i in range(9):
        row = matrix[i]
        col = [matrix[j][i] for j in range(9)]
        if not check(row) or not check(col):
            flag = False
            break
    for x in range(3):
        for y in range(3):
            jiu = [matrix[a][b] for a in range(3*x, 3*(x+1)) for b in range(3*y, 3*(y+1))]
            if not check(jiu):
                flag = False
                break
    if flag:
        print("1")
    else:
        print("0")

根据提供的引用内容,这段代码是用来统计输入数字奇数和偶数的个数的。代码使用循环遍历输入的数字,通过对2取模运算来判断数字是奇数还是偶数,然后分别对奇数和偶数的计数变量进行加一操作。循环结束后,输出奇数计数变量和偶数计数变量的值,间用空格隔开。\[1\]\[2\]\[3\] 这段代码可以用来解决团体程序设计天梯赛-练习 L1-022 奇偶分家的问题。 #### 引用[.reference_title] - *1* [PTA团队天梯赛L1-022 奇偶分家](https://blog.csdn.net/m0_46492118/article/details/114481127)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v91^insert_down1,239^v3^insert_chatgpt"}} ] [.reference_item] - *2* [PAT团队程序设计天梯赛-习题L1-022 奇偶分家](https://blog.csdn.net/qq_38234015/article/details/81291913)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v91^insert_down1,239^v3^insert_chatgpt"}} ] [.reference_item] - *3* [团体程序设计天梯赛-练习 L1-022 奇偶分家 (10分)(C语言)](https://blog.csdn.net/Baridhu/article/details/109899606)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v91^insert_down1,239^v3^insert_chatgpt"}} ] [.reference_item] [ .reference_list ]
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值