苦闷的芒果在看数据
苦闷的芒果在看数据
全部文章
分类
归档
标签
去牛客网
登录
/
注册
苦闷的芒果在看数据的博客
全部文章
(共27篇)
题解 | 密码强度等级
import sys while True: try: s = input() total = 0 n_num = 0 c_u = 0 c_l = 0 n_other = 0 l...
2025-11-25
0
9
题解 | 求最大连续bit数
import sys while True: try: n = bin(int(input()))[2:] if n[-1] == '1': n += '0' max_len = 0 flag = 0 ...
2025-11-25
0
8
题解 | 将真分数分解为埃及分数
import sys def way(a,b): lst = [] def iway(a,b): if b%a == 0: lst.append('1/'+str(int(b/a))) else: p ...
2025-11-25
0
9
题解 | 小苯送礼物
import sys while True: try: n,k = map(int,input().split()) lst = [] for i in range(1,n+1): x,y =map(int,input...
2025-11-24
0
10
题解 | 尼科彻斯定理
import sys while True: try: n = int(input()) print('+'.join(map(str,range(int(n*n-n+1),int(n*n+n),2)))) except: break
2025-11-24
0
9
题解 | 公共子串计算
import sys while True: try: s = input() t = input() if len(s) > len(t): s,t = t,s max_len = 0 ...
2025-11-24
0
14
题解 | 参数解析
import sys while True: try: s = input() ans = [] temp = '' flag = 0 for c in s: if (c == '\'' ...
2025-11-24
0
9
题解 | 计算日期到天数转换
import sys month = [31,28,31,30,31,30,31,31,30,31,30,31] while True: try: y,m,d = map(int,((input().split()))) total = sum(month[:...
2025-11-24
0
10
题解 | 矩阵乘法计算量估算
import sys while True: try: n = int(input()) lst = [] for _ in range(n): lst.append(list(map(int,input().split...
2025-11-24
0
10
题解 | 24点游戏算法
import sys def isok(lst,n): if len(lst) == 1: return round(lst[0],5) == round(n,5) or -round(lst[0],5) == round(n,5) else: if ...
2025-11-21
0
19
首页
上一页
1
2
3
下一页
末页