牛客484960258号

题解

/ 注册

全部文章 / 题解（共47篇）

题解 | #Sudoku#

def check(n,x,y,M): block = [M[x//3*3][y//3*3],M[x//3*3][y//3*3+1],M[x//3*3][y//3*3+2], M[x//3*3+1][y//3*3],M[x//3*3+1][y//3*3+1],M[x...

Python3

2021-12-30

1 438

题解 | #字母收集#

while True: try: n,m = map(int,input().split()) dics = {'l':4,'o':3,'v':2,'e':1} dp = [[0 for _ in range(m+1)] for i in ra...

Python3

2021-12-30

1 356

题解 | #【模板】二维前缀和#

while True: try: n,m,q = map(int,input().split()) data = [] for i in range(n): data.append(list(map(int,input(...

Python3

2021-12-30

0 347

题解 | #【模板】前缀和#

while True: try: n,q = map(int,input().split()) nums = list(map(int,input().split())) dp = [0]*n dp[0] = nums[0] ...

Python3

2021-12-30

0 287

题解 | #nico和niconiconi#

while True: try: n,a,b,c = map(int,input().split()) chars = input() dp = [0]*n for i in range(3,n): dp...

Python3

2021-12-30

0 390

题解 | #不相邻取数#

while True: try: a = int(input()) b = list(map(int,input().split())) dp = [0]*a for i in range(a): if ...

Python3

2021-12-30

1 356

题解 | #连续子数组最大和(ACM版本)#

while True: try: a = int(input()) b = list(map(int,input().split())) dp = [0]*a for i in range(a): if ...

Python3

2021-12-30

3 361

题解 | #字符统计#

while True: try: a = input() s = sorted(set(a)) ss = sorted(s,key=lambda x:a.count(x),reverse=True) print(''.join(...

Python3

2021-12-29

68 3386

题解 | #字符统计#

while True: try: a = input() b = dict.fromkeys(sorted(set(a))) for i in range(len(b)): m = list(b.keys())[i] ...

Python3

2021-12-29

1 368

题解 | #矩阵乘法计算量估算#

def myfunc(chars): global result if len(chars) == 1 or len(chars) == 3: result += 0 else: for i in range(len(chars)-2): ...

Python3

2021-12-29

0 416