第十届蓝桥杯大赛PythonB组

---

A:组队


这个可以自己手算一下，在多种方案里面选最大的就行了：490

B:不同子串

s="0100110001010001"

paths= []

for i in range(len(s)):
    for j in range(i+1,len(s)+1):
        if s[i:j] not in paths:
            paths.append(s[i:j])
print(len(paths))
print(paths)

100
采用切片的方法，原来是想的把字符串转为列表再用回溯，子集和这种题不一样：子集不必连续，这个题必须要连续所以好写太麻烦了，看了别人的解答感觉很简单5555555555555

C:数列求值

dp =[0 for i in range(20190324)]
dp[0]=1
dp[1]=1
dp[2]=1
for i in range(3,20190324):
    dp[i]= (dp[i-1]%10000+dp[i-2]%10000+dp[i-3]%10000)%10000
    print(dp[i])
print(dp[20190324])

没什么好说的，还是暴力，太费时间了

D:数的分解

count = 0
for i in range(1,700):
    if ("2"  in str(i)) or ("4" in str(i)):
        continue
    for j in range(i+1,2019):
        if ("2"  in str(j)) or ("4" in str(j)):
            continue
        z = 2019-i-j
        if ("2"  in str(z)) or ("4" in str(z)):
            continue
        if z >i and z>j:
            count += 1
##            print(i,j,z)
print(count)

答案：40785注意审题！不能有4和2
思路：纯纯的暴力

E:迷宫

01010101001011001001010110010110100100001000101010
00001000100000101010010000100000001001100110100101
01111011010010001000001101001011100011000000010000
01000000001010100011010000101000001010101011001011
00011111000000101000010010100010100000101100000000
11001000110101000010101100011010011010101011110111
00011011010101001001001010000001000101001110000000
10100000101000100110101010111110011000010000111010
00111000001010100001100010000001000101001100001001
11000110100001110010001001010101010101010001101000
00010000100100000101001010101110100010101010000101
11100100101001001000010000010101010100100100010100
00000010000000101011001111010001100000101010100011
10101010011100001000011000010110011110110100001000
10101010100001101010100101000010100000111011101001
10000000101100010000101100101101001011100000000100
10101001000000010100100001000100000100011110101001
00101001010101101001010100011010101101110000110101
11001010000100001100000010100101000001000111000010
00001000110000110101101000000100101001001000011101
10100101000101000000001110110010110101101010100001
00101000010000110101010000100010001001000100010101
10100001000110010001000010101001010101011111010010
00000100101000000110010100101001000001000000000010
11010000001001110111001001000011101001011011101000
00000110100010001000100000001000011101000000110011
10101000101000100010001111100010101001010000001000
10000010100101001010110000000100101010001011101000
00111100001000010000000110111000000001000000001011
10000001100111010111010001000110111010101101111000

看到一个大哥用excel表写的！大家快去围观！点这里！
代码写了一个小时感觉还是不对，思路不是很情绪！感觉我这个阶段不合适写5555555555

F:特别数的和

n = int(input())
summ  = 0
for i in range(1,n+1):
    s = str(i)
    if ("1" in s) or ("2" in s) or ("9" in s)or ("0" in s):
        summ += i

       
print(summ)

思路：暴力

G:外卖店优先级

难点：同一时刻不止一个店铺可以收到订单
解决：采用二维数组来存放订单数【累加】

num,hang,time = [int(i) for i in input().split()]#获取店数目，行数，总时间数
times=[[0]*num for i in range(time)]#创建一个数组，用来接收,每个店铺的订单数其中time[i],i表示时间，time[i]=[0,0,,,0]表示的店铺的订单数

for i in range(hang):
    m,n=[int(i) for i in input().split()]
    times[m-1][n-1]+=1#累加
summ = 0#优先级队列中的总数目
for i in range(n):#遍历每家店再遍历时间比遍历时间再遍历店要好，省了一次for
    cnt =0#优先级数
    for j in range(time):
##        print(times[j][i],cnt)
        if times[j][i] >0:#有订单
            cnt+=2*times[j][i]
        if (cnt >0) and (times[j][i]==0) :#没有订单，并且优先级数不为0
            cnt-=1
##    print(cnt)
    if cnt >5:#大于5加入队列，，第八行的好处体现在这，否者还要创建一个数组来存放每个店铺的优先级。再for循环遍历大于5的
        summ += 1
print(summ)

服了，老是过一个样例

H:人物相关性分析

k = int(input())
s=input()
count = 0
def fin(s,ss,begin):
    index = s.find(ss,begin)
    while s[index-1].isalpha() or s[index+len(ss)].isalpha():
        if index == -1:
            break
        index = s.find(ss,index+1)
        if index == -1:
            break
    return index

index1=fin(s,"Alice",0)
index2=fin(s,"Bob",0)
a = []
b =[]
while index1!=-1:
    a.append(index1)
    index1=fin(s,"Alice",index1+1)
while index2!=-1:
    b.append(index2)
    index2=fin(s,"Bob",index2+1)

if not a or not b:
    print(0)
else:
    left = 0
    right =0
    while (left<len(a)) and (right<len(b)):
        
        if a[left]<b[right]:
            if b[right]-5-a[left]<=k:
               count+=1
            left+=1
        else:
            if a[left]-3-b[right]<=k:
                count+=1
            right+=1
    print(count)

有没有人知道哪错了无语死了直接通过0
发现还是有错，只是通过了样例…等我有空再写一遍，实在改不动了

I:后缀表达式

昨天没有思路，看了其他博主的，今天来写下
易错点：直接排序，将大数排在前面，小数排在后面，大数相加减去小数。没有考虑括号和负数的问题，把这题当成了力扣1005题
eg：1，2，3，-，-
错：3-2-1=0
对：2-（1-3）=4
总结：可以将减号看作负符号，每个数相加（2+（-（1+（-3）））），分两种情况：
①负号个数>负数个数 ：
余数为奇数：把全部负数变为正数，再将最小的数变为负数，注意变一个就足够了，因为- - -1=-1
为偶数：负数全变正
②负号个数＜负数个数，将最小的负数们变为正数

jia,jian=map(int,input().split(" "))
num = list(map(int,input().split(" ")))
num.sort()#排序，后面变号会用到
fu = 0#负数个数
for i in num:
    if i <0:
        fu+=1
        
def change(num,ge):
    ge = abs(ge)#当得到是负数的情况，fu=0
    if ge == 0:
        return sum(num)
    for i in range(jian+jia+1):
        num[i] =0 - num[i]
        ge -= 1
        if ge==0:
            break
    return sum(num)
if jian>fu:
    if (jian-fu)%2==0:
        print(change(num,fu))
    else:
        print(change(num,fu-1))
else:
    print(change(num,jian))

还行，应该还是有没有考虑到的地方

一个满分答案：发现是自己思路错了。
2 1
-3 -2 1 5
最大值5+1-((-2)+(-3))=11，不是5+1+3-2
只要有一个负号，就可以使所有负号变号

jia,jian = map(int,input().split())
num = list(map(int,input().split()))
num.sort(reverse=True)#倒叙[5,4,3,2,1,-1,-2,-3,-4,-5]
if m == 0: #没有减号
    print(sum(lt))
else:#有负号
    max = lt[0]
    min = lt[-1]
    out = max-min
    for i in range(1,n+m):
        out += abs(lt[i])
    print(out)

J:灵能传输

看不懂