大方的杰克希望被offer砸中
大方的杰克希望被offer砸中
全部文章
分类
归档
标签
去牛客网
登录
/
注册
大方的杰克希望被offer砸中的博客
全部文章
(共40篇)
题解 | 逆序输出
l = list(map(int, input().split())) l1 = reversed(l) for i in l1: print(i, end = ' ')
2025-12-12
0
8
题解 | 奇偶统计
n = int(input()) n1 = 0 n2 = 0 for i in range(1, n+1): if i % 2 == 0: n2 += 1 else: n1 += 1 print(n1, end = ' ') print(n2)
2025-12-12
0
9
题解 | 魔法数字变换
x = int(input()) c = 0 while x != 1: if x % 2 == 0: x = x / 2 c += 1 else: x = (3 * x) + 1 c += 1 print(c)
2025-12-12
0
7
题解 | 小乐乐查找数字
n = int(input()) l = map(int, input().split()) x = int(input()) count = 0 for i in l: if i == x: count += 1 print(count)
2025-12-12
0
6
题解 | 有序序列判断
n = int(input()) l1 = list(map(int, input().split())) l2 = sorted(l1) l3 = sorted(l1, reverse = True) if l1 == l2 or l1 == l3: print('sorted') els...
2025-12-12
0
7
题解 | 统计数据正负个数
l = list(map(int, input().split())) positive = 0 negative = 0 for i in l: if i > 0: positive += 1 elif i < 0: negative +...
2025-12-12
0
7
题解 | 矩阵计算
n, m = list(map(int, input().split())) sum = 0 for i in range(n): l = list(map(int, input().split())) for j in l: if j > 0: ...
2025-12-12
0
8
题解 | 23年OPPO-a的翻转
a = str(input()) b = ''.join(reversed(a)) c = int(a) + int(b) print(c)
2025-12-09
0
8
题解 | 小乐乐算多少人被请家长
n = int(input()) count = 0 for _ in range(n): a,b,c = map(int,input().split()) if (a + b + c) / 3 < 60: count += 1 print(count)
2025-12-09
0
8
题解 | N个数之和
a = int(input()) b = [int(i) for i in input().split()] print(sum(b))
2025-12-09
0
6
首页
上一页
1
2
3
4
下一页
末页