您可以在 python 中设置一个条件来检查整数吗?
Can you set up a condition in python to check for whole numbers?
我正在尝试在 python 中创建一个函数,它可以计算出最有效的物品打包方式。
大包可容纳 25 件物品,小包可容纳 5 件物品。
def packages_needed(项目,large_pack,small_pack)
我真的很困惑如何定义/设置推理
我想的是设置一个条件,其中 x/a 是一个整数,那么 z 就是那个。如果余数不为 0,则 z 为整数加余数。
我不确定我的推理是否有道理,但我真的很感激任何 suggestions/help。
我目前拥有的是:
z = 0
x = large_pack
y= small_pack
for a in items:```
您可以使用标准除法运算符(//) 来确定物品的数量适合大号和小号包的次数。
def division_ceiling(a: int, b: int) -> int:
"""
Accepts number of items. Returns how many small packs are needed.
"""
return -1 * (-a // b)
def packages_needed(items: int) -> (int, int):
"""
Accepts number of items. Returns tuple (large pack, small pack)
"""
large_size = 25
small_size = 5
large_packs = items // large_size
small_packs = division_ceiling(items - large_packs * large_size, small_size)
return (large_packs, small_packs)
"""
if you want 1-25 items to be 1 large pack then do this:
if items <= 25:
return (1, 0)
else:
large_packs = items // large_size
small_packs = division_ceiling(items - large_packs * large_size, small_size)
return (large_packs, small_packs)
"""
print(packages_needed(int(input("Number of items?"))))
Input: 31
Output: (1, 2)
Input: 6
Output: (0, 2)
我正在尝试在 python 中创建一个函数,它可以计算出最有效的物品打包方式。 大包可容纳 25 件物品,小包可容纳 5 件物品。
def packages_needed(项目,large_pack,small_pack)
我真的很困惑如何定义/设置推理
我想的是设置一个条件,其中 x/a 是一个整数,那么 z 就是那个。如果余数不为 0,则 z 为整数加余数。
我不确定我的推理是否有道理,但我真的很感激任何 suggestions/help。
我目前拥有的是:
z = 0
x = large_pack
y= small_pack
for a in items:```
您可以使用标准除法运算符(//) 来确定物品的数量适合大号和小号包的次数。
def division_ceiling(a: int, b: int) -> int:
"""
Accepts number of items. Returns how many small packs are needed.
"""
return -1 * (-a // b)
def packages_needed(items: int) -> (int, int):
"""
Accepts number of items. Returns tuple (large pack, small pack)
"""
large_size = 25
small_size = 5
large_packs = items // large_size
small_packs = division_ceiling(items - large_packs * large_size, small_size)
return (large_packs, small_packs)
"""
if you want 1-25 items to be 1 large pack then do this:
if items <= 25:
return (1, 0)
else:
large_packs = items // large_size
small_packs = division_ceiling(items - large_packs * large_size, small_size)
return (large_packs, small_packs)
"""
print(packages_needed(int(input("Number of items?"))))
Input: 31
Output: (1, 2)
Input: 6
Output: (0, 2)