Python

91 循环数数
import math
def Is_prime(x):
for i in range(2,int(math.sqrt(x))+1):
if x%i==0: return False
return True

n=int(input())
sum=0
for i in range(2,n):
flag=True
num=str(i)
for j in range(len(num)):
num=num[1:]+num[:1]
temp=int(num)
if not Is_prime(temp):
flag=False
break
if flag: sum+=1
print(sum)

90列表合并去重
alist = list(map(int,input().split()))
blist = list(map(int,input().split()))
clist = list(set(alist + blist))
print(sorted(clist))

89七进制数
num = int(input())
if num == 0:
print(0)
else:
result =''
n =abs(num)
while n:
result=str(n%7)+result
n = n//7
if num>0:
print(result)
else:
print("-"+result)

86输出指定的英文字母
b=input()
a=b[::-1]
str=""
for i in a:
if i.islower():
if i not in str:
str+=i
if len(str)<7:
print("not found")
else:
c=str[::-1]
print(c[-7:-1],c[-1],sep="")

85寻找不一样的约数
a = input().split( )
x = int(a[0])
y = int(a[1])

print(x,y)

X = set()
Y = set()
Z = set()
for i in range(1,x+1):
if x%i == 0:
X.add(i)

print(X)

for j in range(1,y+1):
if y%j == 0:
Y.add(j)

print(Y)

Z = (X | Y) - (X & Y)
if x == y:
print("not found")
else:
print(",".join(repr(e) for e in Z))

83求矩阵局部极大值
m, n = map(int, input().split())
a = []
for i in range(m):
a.append(list(map(int, input().split())))

t = False
for i in range(1, m - 1):
for j in range(1, n - 1):
data = []
data.append(int(a[i - 1][j]))
data.append(int(a[i + 1][j]))
data.append(int(a[i][j - 1]))
data.append(int(a[i][j + 1]))
if a[i][j] > max(data):
print(a[i][j], i + 1, j + 1)
t = True
if t == False:
print("None", m, n)

79下三角矩阵判断
n = int(input())
x=[]
for i in range(n):
s = int(input())
t = True
for j in range(s):
a = list(map(int, input().split()))
for k in range(s):
if j < k and a[k] != 0:
t = False
break
if t==True:
y='Yes'
x.append(y)
else:
y='No'
x.append(y)
for i in range(len(x)):
print(x[i])

77稀疏矩阵的表示
row, col = map(int, input().split(","))
matrix= []
ans=[]
for i in range(row):
temp=list(map(eval, input().split()))
if len(temp)!=col:
print("Input error in line %s of the matrix!"%(i+1))
break
matrix.append(temp)
else:
num=0
for i in range(row):
for j in range(col):
if matrix[i][j]!=0:
ans.append((i+1,j+1,matrix[i][j]))
num+=1
ans.append((row,col,num))
ans=tuple(ans)

print("Triplet List:")
print(ans)
print("Transpose matrix:")
tran_matrix=[]


for i in range(col):
    temp=[]
    for j in range(row):
        temp.append(matrix[j][i])
    tran_matrix.append(temp)

for i in range(col):
    for j in range(row):
        print("{:>6}".format((tran_matrix[i][j])),end='')
    print()

---

76列表元素排序【part two】
def isprime(number):
if number <= 1:
return False
else:
for k in range(2, number):
if number % k == 0:
return False
return True

list1 = eval(input())
list2 = []
list3 = []
temp = 0
for i in range(len(list1)):
for j in range(len(list1[i])):
if isprime(list1[i][j]):
temp += list1[i][j]
list2.append(temp)
temp = 0
for j in range(len(list2)):
for i in range(len(list2)):
if list2[i] == min(list2):
list3.append(list1[i])
list2[i] = 99999
break
print(list3)

78字符串的重新排列
slis=list(input())
ilis=list(map(int,input().split(',')))
n=len(ilis)
sit=0
blis=[]
while sit<=n-1:
for i in range(len(ilis)):
if ilis[i]==sit:
blis.append(slis[i])
sit+=1
for i in range(len(blis)):
print(blis[i],end='')

78
s,n=input().split(",")
n = int(n)
flag = False
temp = ""
for idx in range(0, len(s), 2*n):
s = s[:idx] + s[idx:idx+n][::-1] + s[idx+n:]
print(s)
75

74 反转单词中的字母
a=input()
a=a[::-1]
b=a.swapcase()
b=b.replace(' ','#')
print(b)

73
n