开学备赛蓝桥杯Python组训练题三

目录

1.最优包含

2.罗马数字

3.波动数列

4.数字统计

5.密码脱落

6.谈判

7.排列序数

---

1.最优包含

考点：最长公共子序列

import os
import sys

s1=input()
s2=input()
n=len(s1)
m=len(s2)
dp=[[0] *(m+1) for i in range(n+1)]
for j in range(1,m+1):
  for i in range(j,n+1):
    if s1[i-1]==s2[j-1]:
      dp[i][j]=dp[i-1][j-1]+1
    else:
      dp[i][j]=max(dp[i-1][j-1],dp[i-1][j])
print(m-dp[n][m])
 

2.罗马数字

考点：字典存储 相邻字母左大右小 加   左小右大 减

import os
import sys

# 请在此输入您的代码
n=int(input())
nums=[input() for i in range(n)]
dicts={'I':1,'V':5,'X':10,'L':50,'C':100,'D':500,'M':1000}

for i in nums: 
  if len(i)==1:
    print(dicts[nums[i]])
    continue

  res=dicts[i[-1]]
  for j in range(len(i)-2,-1,-1):
    if dicts[i[j]]<dicts[i[j+1]]:
      res-=dicts[i[j]]
    else:
      res+=dicts[i[j]]
  print(res)

3.波动数列

考点：数学公式推理 两边公式同时取模

import os
import sys

n, s, a, b = map(int, input().split())
f = [[0] * n for _ in range(n)]
f[0][0] = 1
MOD = 100000007
for i in range(1, n):
    for j in range(n):
        f[i][(j + (n - i) * a) % n] += f[i - 1][j]
        f[i][(j - (n - i) * b) % n] += f[i - 1][j]
print(f[n - 1][s % n] % MOD)

4.数字统计

简单统计题

import os
import sys

# 请在此输入您的代码
l,r=map(int,input().split())
ans=0
for i in range(l,r+1):
  if '2' in str(i):
    ans+=str(i).count('2')
print(ans)

5.密码脱落

考点：最长公共子序列与相反字符串

import os
import sys

# 请在此输入您的代码
s=input()
sr=s[::-1]
n=len(s)
dp=[[0]*(n+1) for i in range(n+1)]

for i in range(1,n+1):
  for j in range(1,n+1):
    if s[i-1]==sr[j-1]:
      dp[i][j]=dp[i-1][j-1]+1
    else:
      dp[i][j]=max(dp[i-1][j],dp[i][j-1])
print(n-dp[n][n])

6.谈判

简单贪心题

import os
import sys


n = int(input())
t = list(map(int,input().split()))
t.sort()
tot = (n -  1) * t[0]
for i in range(1, n):
  tot += t[i] * (n - i)
print(tot)

7.排列序数

排列组合题：用排列函数pertations

import os
import sys

from itertools import  permutations
s=str(input())   #对字符串进行permutations排列组合
ans=0
o=sorted(s)
for i in permutations(o):
    x = ''.join(i)
    if x==s:
      print(ans)
      break
    else:
      ans+=1