蓝桥杯第十二届青少年Python组国赛试题

一、选择题

选择题答案：ABADC
1

二、编程题

nums = list(map(float,input().split(',')))
print(max(nums))
1
2

n=int(input())
cnt=0
def find(n):
    global cnt
    for i in range(2,n):
        if n%i==0:
            cnt+=1
            find(n//i)
            return 
find(n)
print(cnt+1)
1
2
3
4
5
6
7
8
9
10
11

s=input()
for i in range(len(s)):
    if 'a'<=s[i]<='z':
        s=s.replace(s[i],' ')
ls=[len(n) for n in s.split()]
print(max(ls))
1
2
3
4
5
6

n=int(input())
ls=[]
def check(c):
    mark=True
    for i in range(2,c):
        if c%i==0:
            mark=False
            break
    return mark
for i in range(2,n//2+1):
    j=n-i
    if check(i) and check(j):
        ls.append(j-i)
print(min(ls))
1
2
3
4
5
6
7
8
9
10
11
12
13
14

ns=list(map(int,input().split(',')))
cnt=0
def bian(ns):
    global cnt
    if max(ns)==min(ns):
        return cnt
    else:
        max_i=ns.index(max(ns))
        for i in range(len(ns)):
            if i != max_i:
                ns[i]+=1
        cnt+=1
        return bian(ns)
print(bian(ns))
1
2
3
4
5
6
7
8
9
10
11
12
13
14

s=input().split()
s=[tuple(map(int,n.split(','))) for n in s]
ls=[]
def find(t):
    global s
    column=row=slash=backslash=0
    for tt in s:
        if t[0]==tt[0]:  # 列相等
            column+=1
        if t[1]==tt[1]:  # 行相等
            row+=1
        if t[0]-t[1]==tt[0]-tt[1]:  # 斜线/横纵之差相等
            slash+=1
        if t[0]+t[1]==tt[0]+tt[1]:  # 反斜线\横纵之和相等
            backslash+=1
    return max([column,row,slash,backslash])

for t in s:
    ls.append(find(t))
print(max(ls))
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20