【一眼秒杀】三道蓝桥杯真题（一）

小陈从不熬夜

已于 2024-07-17 23:15:05 修改

阅读量400

点赞数 6

分类专栏：蓝桥杯真题文章标签： python 开发语言算法逻辑回归

于 2024-07-16 14:10:45 首次发布

本文链接：https://blog.csdn.net/weixin_57467129/article/details/140463764

版权

蓝桥杯真题专栏收录该内容

5 篇文章 0 订阅

订阅专栏

一、奇怪的捐赠

#暴力算法
n = 1000000              
num=[7**i for i in range(10)]
# for m in num:
#   print(m)  100万以内7的若干次方数有几个，从而定义几个循环
for a in range(1,5):
    for b in range(1,5):
        for c in range(1,5):
            for d in range(1,5):
                for g in range(1,5):
                    for e in range(1,5):
                        for f in range(1,5):
                            for h in range(1,5):
                                if a*num[0]+b*num[1]+c*num[2]+d*num[3]+g*num[4]+e*num[5]+f*num[6]+h*num[7]==n:
                                    # print(a,b,c,d,g,e,f,h)  代表份数
                                    print(a+b+c+d+g+e+f+h)  
# 解法2
a=1000000
cut=0
for i  in range(7,-1,-1): #7的7次方不超过100w
  for j in range(5): #相同份数不超过5
    if (a-7**i)>=0:
      a-=7**i
      cut+=1
    else:
      break
print(cut)

二、IP 补充

print(255)
“∗”代表的数字最大可能是255，因为这是IP地址每个段可以取的最大值。

三、出现最多的字符

下面的矩阵中包含 ABCDEF 六种字符，请问出现最多的字符出现了几次?

FFEEFEAAECFFBDBFBCDA
DACDEEDCCFFAFADEFBBA
FDCDDCDBFEFCEDDBFDBE
EFCAAEECEECDCDECADDC
DFAEACECFEADCBFECADF
DFBAAADCFAFFCEADFDDA
EAFAFFDEFECEDEEEDFBD
BFDDFFBCFACECEDCAFAF
EFAFCDBDCCBCCEADADAE
BAFBACACBFCBABFDAFBE
FCFDCFBCEDCEAFBCDBDD
BDEFCAAAACCFFCBBAAEE
CFEFCFDEEDCACDACECFF
BAAAFACDBFFAEFFCCCDB
FADDDBEBCBEEDDECFAFF
CDEAFBCBBCBAEDFDBEBB
BBABBFDECBCEFAABCBCF
FBDBACCFFABEAEBEACBB
DCBCCFADDCACFDEDECCC
BFAFCBFECAACAFBCFBAF

#解法1
#将一个字符串赋值给变量a
a = "FFEEFEAAECFFBDBFBCDADACDEEDCCFFAFADEFBBAFDCDDCDBFEFCEDDBFDBEEFCAAEECEECDCDECADDCDFAEACECFEADCBFECADFDFBAAADCFAFFCEADFDDAEAFAFFDEFECEDEEEDFBDBFDDFFBCFACECEDCAFAFEFAFCDBDCCBCCEADADAEBAFBACACBFCBABFDAFBEFCFDCFBCEDCEAFBCDBDDBDEFCAAAACCFFCBBAAEECFEFCFDEEDCACDACECFFBAAAFACDBFFAEFFCCCDBFADDDBEBCBEEDDECFAFFCDEAFBCBBCBAEDFDBEBBBBABBFDECBCEFAABCBCFFBDBACCFFABEAEBEACBBDCBCCFADDCACFDEDECCCBFAFCBFECAACAFBCFBAF"
a = a.count(max(a))   #计算字符串a中出现次数最多的字符（通过max(a)找到）
print(a)              #然后计算这个字符在字符串a中出现的次数（通过a.count()方法）
                      #最后将这个次数赋值给变量a。

#解法2 循环遍历判断+1
matrix = "FFEEFEAAECFFBDBFBCDADACDEEDCCFFAFADEFBBAFDCDDCDBFEFCEDDBFDBEEFCAAEECEECDCDECADDCDFAEACECFEADCBFECADFDFBAAADCFAFFCEADFDDAEAFAFFDEFECEDEEEDFBDBFDDFFBCFACECEDCAFAFEFAFCDBDCCBCCEADADAEBAFBACACBFCBABFDAFBEFCFDCFBCEDCEAFBCDBDDBDEFCAAAACCFFCBBAAEECFEFCFDEEDCACDACECFFBAAAFACDBFFAEFFCCCDBFADDDBEBCBEEDDECFAFFCDEAFBCBBCBAEDFDBEBBBBABBFDECBCEFAABCBCFFBDBACCFFABEAEBEACBBDCBCCFADDCACFDEDECCBFAFCBFECAACAFBCFBAF"
count_A,count_B,count_C,count_D,count_E,count_F = 0,0,0,0,0,0
for zimu in matrix:
    if zimu == "A":
        count_A += 1
    elif zimu == "B":
        count_B += 1
    elif zimu == "C":
        count_C += 1
    elif zimu == "D":
        count_D += 1
    elif zimu == "E":
        count_E += 1
    elif zimu == "F":
        count_F += 1
print(max(count_A,count_B,count_C,count_D,count_E,count_F))

每天持续更新~