柚茶_Rola
柚茶_Rola
全部文章
分类
归档
标签
去牛客网
登录
/
注册
柚茶_Rola的博客
全部文章
(共451篇)
题解 | #计算日期到天数转换#
y,m,d = map(int,input().split()) ls = [31,28,31,30,31,30,31,31,30,31,30,31] if (y%100 != 0 and y%4 == 0) or (y%100 == 0 and y%400 ==0): ls[1] = 29...
2024-06-23
0
131
题解 | #百钱买百鸡问题#
n = int(input()) for x in range(21): for y in range(34): for z in range(101): if x + y + z == 100 and 5 * x + 3 * y + (1/3) * ...
2024-06-22
0
153
题解 | #百钱买百鸡问题#
n = int(input()) for x in range(21): for y in range(34): for z in range(101): if x + y + z == 100 and 5 * x + 3 * y + (1/3) * ...
2024-06-22
0
179
题解 | #查找输入整数二进制中1的个数#
# 20240622 # 要增加异常处理的情况,否则会报错 while True: try: print(bin(int(input())).count('1')) except:# 处理异常 break
2024-06-22
0
156
题解 | #放苹果#
# 20240622 # 函数f(m,n)表示把m个苹果放进n个盘子的方法总数 def f(m,n): if m < 0 or n < 0: return 0 elif m == 1 or n == 1: return 1 else...
2024-06-22
0
158
题解 | #查找组成一个偶数最接近的两个素数#
def f(x): if x < 2: return False else: for i in range(2,(x//2)+1): if x % i == 0: return False ...
2024-06-22
0
146
题解 | #查找组成一个偶数最接近的两个素数#
def f(x): if x < 2: return False else: for i in range(2,(x//2)+1): if x % i == 0: return False ...
2024-06-22
0
140
题解 | #完全数计算#
# 20240622 15:58 n = int(input()) c = 0 for i in range(1,n+1): sum = 0 for j in range(1,(i//2)+1): if i%j == 0: sum += j...
2024-06-22
0
165
题解 | #表达式求值#
# 20240622 15:56 print(eval(input()))
2024-06-22
0
127
题解 | #杨辉三角的变形#
# 20240622 n = int(input()) if (n ==1 or n ==2): print(-1) else: if n%4 == 3 or n%4 ==1: print(2) elif n%4 == 0: print(3) ...
2024-06-22
0
141
首页
上一页
22
23
24
25
26
27
28
29
30
31
下一页
末页