摘要： 动态规划的题目 1 class ColorfulRoad: 2 def getMin(self, road): 3 a = [None] * len(road) 4 a[0] = 0 5 for i in range(0, len(road)-1): 6 if a[i] != None: 7 for j in range(i+1, len(road)): 8 if self.judgeValid(road[i], road[j]): 9 ... 阅读全文

摘要： 一般编程题，如果用数组来处理，注意中间要忽略的城市 1 class FoxAndSightseeing: 2 def getMin(self, position): 3 minx = 999999999 4 for i in range(1, len(position)-1): 5 sumx = 0 6 for k in range(1, len(position)): 7 sumx += abs(position[k] - position[k-1]) 8 ... 阅读全文

摘要： 数论题，注意以下性质：(1) 若 \( divisor | F(n) \) 则必存在整数 \(r\) 使得 \( n \equiv r^2 (mod \ divisor) (r \in \mathbf{N}且n>r^2)\)(2) 若\( n \equiv r^2 (mod \ divisor) (r \in \mathbf{N}且n>r^2) \) 则必有\( divisor | F(n) \)若 \(divisor\) 不是质数则性质不成立，因此原题转换为如下问题：求区间 \( [lo, hi] \) 内满足 \( n \equiv r^2 (mod \ divisor) (r 阅读全文

摘要： 简单数学题，多考虑几个例子即可 1 def read(): 2 s = input() 3 s = s.split(' ') 4 s = [int(x) for x in s] 5 return s 6 7 def write(data): 8 print(data) 9 10 11 def calc(n, a):12 if n % a == 0:13 return n // a14 else:15 return n // a + 116 17 def solve(n, m, a):18 ... 阅读全文