牛客pat乙级真题Python代码

养兔子

l, index = [1, 2], 2
while True:
    l.append(l[index - 1] + l[index - 2])
    index += 1
    if index > 93: break
try:
    while True:
        print(l[eval(input()) - 1])
except EOFError:
    pass

客似云来

l = [1]
a, b, T, i = 1, 0, 1, 0
while True:
    a, b = b, b + a
    T = a + b
    l.append(T)
    i += 1
    if i > 90: break
try:
    while True:
        f, t = map(int, input().split())
        print(sum(l[f - 1:t]))
except EOFError:
    pass

星际密码

l = [1, 2]
for i in range(2, 10000):
    l.append(l[i - 1] + l[i - 2])
try:
    while True:
        n = eval(input())
        n = list(map(int, input().split(" ")))
        for x in n:
            x = l[x - 1] % 10000
            print("{:0>4}".format(x), end="")
        print()
except EOFError:
    pass

直方图

try:
    while True:
        x = input()
        l = []
        for i in range(10):
            l.append(x.count(str(i)))
        for i in range(10):
            if i+max(l)<10:continue
            for j in range(10):
                if i+l[j] < 10:
                    print(" ", end="")
                else:
                    print("*", end="")
            print()
        print("0123456789")
except EOFError:
    pass

母牛的故事

采用了一种模拟的方式，其实可以用动态规划来做。

o, n, l = 1, [0, 0, 0, 0], [0, 1]  # 成熟母牛
for i in range(56):
    o += n[2]
    n[2], n[1], n[0] = n[1], n[0], o
    l.append(sum(n) + o)
try:
    while True:
        print(l[eval(input())])
except EOFError:
    pass

童年生活二三事

其实就是个极其典型的动态规划问题

l = [0, 1, 2]
for i in range(3, 91):
    l.append(l[i - 1] + l[i - 2])
try:
    while True:
        print(l[eval(input())])
except EOFError:
    pass

蜜蜂寻路

l = [0, 1, 2]
for i in range(3, 1000):
    l.append(l[i - 1] + l[i - 2])
x = eval(input())
for i in range(x):
    k, b = map(int, input().split(" "))
    print(l[b - k])

骨牌铺方格

l = [0, 1, 2]
for i in range(3, 1000):
    l.append(l[i - 1] + l[i - 2])
try:
    while True:
        print(l[eval(input())])
except EOFError:
    pass