柚茶_Rola

分类

/ 注册

全部文章（共451篇）

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

def f(x): # 判断x是否是素数 if x < 2: return False for i in range(2, n // 2 + 1): if (x % i == 0) and (x != i): retur...

2024-10-16

0 38

题解 | #二维数组操作#

# 20241015 while True: try: m, n = list(map(int, input().split())) x1, y1, x2, y2 = list(map(int, input().split())) x = in...

2024-10-15

0 31

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

def f(x): # 判断x是否是素数 if x <= 2: return True for i in range(3, n // 2 + 1): if (x % i == 0) and (x != i): retur...

2024-10-15

0 36

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

def f(x): # 判断x是否是素数 if x <= 2: return True for i in range(3, n // 2 + 1): if (x % i == 0) and (x != i): while...

2024-10-15

0 61

题解 | #求最小公倍数#

A,B = list(map(int,input().split())) ls = [] for i in range(1,int((A*B)**0.5)+1): if (A%i == 0) and (B%i == 0): ls.append(i) else: ...

2024-10-15

0 60

题解 | #表示数字#

s = input() # Jkdi234klowe90a3 # Jkdi*234*klowe*90*a*3* a = "" pre_char = "" for i in s: # 此题是直接遍历字符串s if i.isdigit() and ...

2024-10-14

0 41

题解 | #密码强度等级#

# 2024年10月14日上午10:44 s = input() sc = 0 # 1 密码长度 if 0 <= len(s) <= 4: sc += 5 elif 5 <= len(s) <= 7: sc += 10 elif len(s) &g...

2024-10-14

0 36

题解 | #求最大连续bit数#

# 20241014 # wujie n = int(input()) b = bin(n)[2:].split('0') #print(b) print(len(max(b)))

2024-10-14

0 37

题解 | #最长回文子串#

# 20241014 s = input().lower() p = 0 for i in range(len(s)): for j in range(i+1,len(s)): if s[i:j+1] == s[i:j+1][::-1] and j+1-i > p: ...

2024-10-14

0 44

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

# 20240919 def f(x): # 判断x是素数/质数 if x < 2: return False else: for i in range(2, x//2 + 1): if x % i == 0: ...

2024-10-13

0 60