柚茶_Rola

分类

/ 注册

全部文章（共451篇）

题解 | #称砝码#

n = int(input()) m = list(map(int,input().split())) x = list(map(int,input().split())) amount = [] weight = {0,}#最起码可以称个0重量，就是不放砝码 #打印所有的砝码重量 for i ...

2024-03-07

0 168

题解 | #字符串加密#

# 密钥：TRAILBLAZERS #顶 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z #取 T R A I L B Z E S C D F G H J K M N O P Q U V W X Y # Attack AT DAWN (黎明时...

2024-03-06

0 190

题解 | #字符串加密#

# 密钥：TRAILBLAZERS #顶 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z #取 T R A I L B Z E S C D F G H J K M N O P Q U V W X Y # Attack AT DAWN (黎明时...

2024-03-06

0 284

题解 | #整数与IP地址间的转换#

# 10.0.3.193 # 00001010 00000000 00000011 11000001 # 167773121 def ip_int(s): # s = list(map(int,input().split('.'))) ss ='' for i in s: ...

2024-03-06

0 190

题解 | #密码截取#

# 你能帮Catcher找出最长的有效密码串吗？找出最长的对称字串 # ABBA 4 # ABBBA 5 # 12HHHHA 4 #对称的密码 s = input() ls= [] for i in range(len(s)-1): for j in range(len(s)-1,i,...

2024-03-05

0 175

题解 | #合唱队#

def max_len(ls): dp = [1] * len(ls) # 存放每个位置左边符合要求的子序列长度 for i in range(len(ls)): for j in range(i): if ls[i] > ls[j] ...

2024-03-05

0 196

题解 | #密码验证合格程序#

def zhonglei(s): upp = 0 low = 0 num = 0 other = 0 for k, i in enumerate(s): if i.isupper(): upp += 1 ...

2024-03-04

0 187

题解 | #坐标移动#

# A10;S20;W10;D30;X;A1A;B10A11;;A10; # A=左，D=右，W=向上，S=下 s = input().split(';') start = [0,0] for i in s: if not 2 <= len(i) <= 3: #合法坐标...

2024-03-04

0 172

题解 | #查找组成一个偶数最接近的两个素数#

def sushu(x): if x < 2: return False else: for i in range(2,x//2+1): if x%i == 0: #素数只有1和他自己两个因子 ...

2024-02-27

0 187

题解 | #完全数计算#

n = int(input()) c = 0 for i in range(1,n+1): sum = 0 for j in range(1,i//2+1): if i%j == 0: sum += j if sum =...

2024-02-26

0 175