HelloChow的博客

CCF python 线性分类器

HelloChow — Fri, 14 Jan 2022 17:56:37 +0800

n, m = map(int, input().split()) list1 = [] list2 = [] for i in range(n): x, y, dot_type = input().split() x = int(x) y = int(y) list1.append((x, y, dot_type)) for j in range(m): a1, a2, a3 = map(int, input().split()) list2.append.

CCF python 数组推导

HelloChow — Fri, 14 Jan 2022 12:14:54 +0800

n = int(input()) list1 = list(map(int, input().split())) print(sum(list1)) print(sum(set(list1)))

CCF python 序列查询

HelloChow — Fri, 14 Jan 2022 00:34:19 +0800

n, m = map(int, input().split()) list1 = [] list1 = list(map(int, input().split())) list1.insert(0, 0) num = 0 s_num = 0 for i in range(1, len(list1)): s_num = s_num + (list1[i] - list1[i-1]) * num num = num + 1 s_sum = s_num + (m - list1[len(list1

CCF python 出现次数最多的数

HelloChow — Thu, 13 Jan 2022 23:33:59 +0800

n = int(input()) list1 = list(map(int, input().split())) list1.sort() min_num = 0 for i in range(n): num = list1.count(list1[i]) if num > min_num: min_num = num a = list1[i] print(a)

CCF python 相反数

HelloChow — Thu, 13 Jan 2022 23:14:45 +0800

n = int(input()) list1 = list(map(int, input().split())) num = 0 for i in range(n): for j in range(i+1, n): if abs(list1[i]) == abs(list1[j]) and list1[i] != list1[j]: num = num + 1 print(num)

CCF python 相邻数对

HelloChow — Thu, 13 Jan 2022 23:14:05 +0800

n = int(input()) list1 = list(map(int, input().split())) num = 0 for i in range(n): for j in range(i, n): if abs(list1[i] - list1[j]) == 1: num = num + 1 print(num)

CCF python 门禁系统

HelloChow — Thu, 13 Jan 2022 22:38:08 +0800

n = int(input()) list1 = list(map(int, input().split())) dic = { } for i in range(n): if not list1[i] in dic.keys(): dic[list1[i]] = 1 else: dic[list1[i]] = dic[list1[i]] + 1 print(dic[list1[i]], end=" ")

CCF python 图像旋转

HelloChow — Thu, 13 Jan 2022 16:27:35 +0800

n, m = map(int, input().split()) list1 = [] for i in range(n): list1.append(list(map(int, input().split()))) for i in range(m-1, -1, -1): for j in range(n): a = list1[j][i] print(a, end=' ') print()

CCF python 数列分段

HelloChow — Wed, 12 Jan 2022 22:07:32 +0800

n = int(input()) list1 = list(map(int, input().split())) num = 0 if n != 0: num = num + 1 for i in range(1, n): if list1[i] != list1[i-1]: num = num + 1 print(num)

CCF python 数位之和

HelloChow — Wed, 12 Jan 2022 21:54:19 +0800

n = int(input()) num = 0 while n != 0: num = num + n % 10 n = n // 10 print(num)

CCF python 折点计数

HelloChow — Wed, 12 Jan 2022 21:46:37 +0800

n = int(input()) list1 = list(map(int,input().split())) num = 0 for i in range(1, n-1): if (list1[i-1] > list1[i] and (list1[i+1] > list1[i])) or\ (list1[i-1] < list1[i] and (list1[i+1] < list1[i])): num = num + 1 print.

CCF python 最大波动

HelloChow — Wed, 12 Jan 2022 21:26:57 +0800

n = int(input()) list1 = list(map(int, input().split())) difference = abs(list1[0] - list1[1]) for i in range(2, n): if abs(list1[i] - list1[i-1]) > difference: difference = abs(list1[i] - list1[i-1]) print(difference)

CCF python 中间数

HelloChow — Wed, 12 Jan 2022 21:13:39 +0800

n = int(input()) list1 = list(map(int, input().split())) for i in range(n): low = 0 high = 0 for j in range(n): if list1[j] > list1[i]: high = high + 1 if list1[j] < list1[i]: low = low + 1 if .

CCF python 分蛋糕

HelloChow — Wed, 12 Jan 2022 19:49:35 +0800

n, k = map(int, input().split()) list1 = list(map(int, input().split())) num = 0 cake_num = 0 for i in range(n): if num == 0: cake_num += 1 num = num + list1[i] if num >= k: num = 0 print(cake_num)

CCF python 打酱油

HelloChow — Wed, 12 Jan 2022 16:55:01 +0800

N = int(input()) num = 0 if N >= 50: remainder = N % 50 quotient = N // 50 num = num + quotient * 7 if remainder >= 30: quotient = remainder // 30 remainder = remainder % 30 num = num + quotient * 4 if rem.

CCF python 最小差值

HelloChow — Wed, 12 Jan 2022 16:30:56 +0800

n = int(input()) list1 = list(map(int, input().split())) difference = abs(list1[0] - list1[1]) for i in range(n): for j in range(i+1, n): if difference > abs(list1[i] - list1[j]): difference = abs(list1[i] - list1[j]) print(diff.

CCF python 跳一跳

HelloChow — Mon, 10 Jan 2022 23:22:37 +0800

list1 = [] list1 = list(map(int, input().split())) k = 1 num = 0 for i in list1: if i == 1: num = num + 1 k = 1 elif i == 2: num = num + 2 * k k = k + 1 print(num)

CCF python 灰度直方图

HelloChow — Mon, 10 Jan 2022 15:33:32 +0800

n, m, l, = map(int, input().split()) list1 = [] list2 = [] for i in range(l): list1.append(0) for i in range(n): j = 0 list2 = list(map(int,input().split())) while j < m : if list2[j] < l: list1[list2[j]] += 1 .

CCF python 卖菜

HelloChow — Sat, 08 Jan 2022 21:55:46 +0800

n = int(input()) list1 = list(map(int,input().split())) list2 = [] for i in range(n): if(i==0): s=(list1[i]+list1[i+1])//2 list2.append(s) elif(i==(n-1)): s=(list1[i]+list1[i-1])//2 list2.append(s) elif(i>0 a.

CCF python 小明上学

HelloChow — Sat, 08 Jan 2022 11:16:49 +0800

r,y,g = map(int,input().split()) n = int(input()) s_time = 0 for i in range(n): k,t = map(int,input().split()) if(k==0): s_time = s_time + t if(k==1): s_time = s_t