Python算法学习: 计蒜客蓝桥杯训练营练习
(因为本人也是菜鸟)不是所有的代码都百分百通过,一些超时没有解决,很多也没有写出来,希望大佬指出
由于网上很多没有python解题的,所以分享一下
import random
n = int(input())
list = []
for i in range(n):
a = random.randint(1,1001)
list.append(a)
for i in range(0,len(list)):
for j in range(i+1,len(list)):
if list[i] == list[j]:
list.remove(list[i])
list.sort()
print(list)
n,r = map(int,input().split())
if r>=10 and r<=16:
a = int(n/r)
b = n%r
if b == 10:
print("%dA"%a)
if b == 11:
print("%dB"%a)
if b == 12:
print("%dC"%a)
if b == 13:
print("%dD"%a)
if b == 14:
print("%dE"%a)
if b == 15:
print("%dF"%a)
if r>=0 and r<=10:
g = []
a = 2
while a>0:
# print(r,n,a)
a = n%r
# print(r, n, a)
n = int(n/r)
g.append(a)
# g.append(a%r)
g.reverse()
if len(g)>1:
g.remove(0)
for i in g:
print(i,end='')
回文数
n = input()
def huiwen(n):
list = []
list.append(n)
y = ''
m = 0
for i in n:
y = i + y
if n!=y:
y=''
while n!=y:
list.append('--->')
m=m+1
y = ''
for i in n:
y = i + y
n = int(n)
y = int(y)
n = n+y
list.append(n)
n = str(n)
y = ''
for i in n:
y = i + y
list.append(m)
return list
a = huiwen(n)
print(a[-1])
a.remove(a[-1])
for i in a:
print(i,end='')
机器人
n = int(input())
dx = [0,-1, 0, 1] #上左下右
dy = [1, 0,-1, 0] #上左下右
now_dir = 3
nowx = 0
nowy = 0
for i in range(0,n):
dir,x = map(str,input().split())
x = int(x)
if dir[0] == 'b':
now_dir = (now_dir+2)%4
elif dir[0] == 'l':
now_dir = (now_dir+1)%4
elif dir[0] == 'r':
now_dir = (now_dir+3)%4
nowx += dx[now_dir]*x
nowy += dy[now_dir]*x
print(nowx,nowy)
字符串
n = input()
x = ''
num_ascii = 0
for i in n:
num_ascii =ord(i)
if num_ascii>57:
num_ascii+=1
if num_ascii == 91:
num_ascii = 65
elif num_ascii == 123:
num_ascii = 97
y = chr(num_ascii)
x = x+y
else :
x = x+chr(num_ascii)
print(x)
红绿蓝
n = input()
list = []
num = 0
for i in n:
list.append(i)
r = list.count('R')
g = list.count('G')
b = list.count('B')
print('B'*b,'G'*g,'R'*r,sep='')
g = int(g/2)
b = int(b/3)
num = min(r,g,b)
print(num)
递归函数
def f(x):
if x<=0:
return 0
if x=&#