波波のblog

原题传送门 代码 # 输入数据 line = input().strip().split() c, n, s, m = [int(x) for x in line] line = input().strip().split() bikes = [float('inf')] for i in range(len(line)): bikes.append(int(line[i]) - c / 2) roads = [{} for _ in range(n + 1)] for i in range(m):

class Customer: def __init__(self, coming, cost): self.coming = coming # 到来时间 self.cost = cost # 花费时间 self.start = 0 # 开始服务时间 def get_difference(self): return self.start - self.coming def main(): line = inp

程序员入门水平，贴出代码大家一起进步！ 原题传送门 题目 Given a pair of positive integers, for example, 6 and 110, can this equation 6 = 110 be true? The answer is yes, if 6 is a decimal number and 110 is a binary number. Now for any pair of positive integersN1  and  N2N_1\;and\;N_2

程序员入门水平，贴出代码大家一起进步！ 原题传送门 题目 This time, you are supposed to find A×B where A and B are two polynomials. Input Specification: Each input file contains one test case. Each case occupies 2 lines, and each line contains the information of a polynomial: K  N1  

程序员入门水平，贴出代码大家一起进步！ 原题传送门 题目 Given a sequence of K integers { N​1​​ , N​2​​ , …, N​K }. A continuous subsequence is defined to be { N​i , N​i+1​​ , …, N​j } where 1≤i≤j≤K. The Maximum Subsequence is the continuous subsequence which has the largest sum of i

程序员入门水平，贴出代码大家一起进步！ 原题传送门 题目 At the beginning of every day, the first person who signs in the computer room will unlock the door, and the last one who signs out will lock the door. Given the records of signing in’s and out’s, you are supposed to find the o

程序员入门水平，贴出代码大家一起进步！ 题目 Given a non-negative integer N, your task is to compute the sum of all the digits of N, and output every digit of the sum in English. Input Specification: Each input file contains one test case. Each case occupies one line which cont

这里写目录标题一级目录二级目录三级目录 一级目录 二级目录 三级目录