Question

Python Два друга идут в поход. На двоих у них N вещей. Каждая вещь имеет какой-то вес. Требуется узнать количество вещей и вес каждой вещи. Программа должна распределить вещи по двум рюкзакам так, чтобы общий вес обоих рюкзаков был бы одинаковым (если это возможно) или отличался на минимально возможную величину (если одинаковый вес невозможен).

Answer 1

Объяснение:

я так понимаю, n это файлик или список вещей, файлик на приложен, так что будем подразумевать, что просто уже добавили все вещи в список S.

s=[n]

s.sort()

p=0

r=0

for i in range(len(s):

if p<r:

p+=s[i]

else:

r+=[i]

print(p,r)

Answer 2

Python Solution for Backpack Problem

To solve the problem of distributing items between two backpacks so that the total weight of both backpacks is as close to each other as possible, you can use the "meet in the middle" approach. This involves generating all possible combinations of items for each backpack and finding the combination with the closest total weight to half of the total weight of all items.

Here's a Python implementation for this problem:

from itertools import combinations

def split_backpack(items):
    n = len(items)
    half = n // 2
    left_half = items[:half]
    right_half = items[half:]

left_combinations = []
    right_combinations = []

# Generate all possible combinations for the left half
    for i in range(half + 1):
        left_combinations.extend([sum(comb) for comb in combinations(left_half, i)])

# Generate all possible combinations for the right half
    for i in range(n - half + 1):
        right_combinations.extend([sum(comb) for comb in combinations(right_half, i)])

# Find the combination with the closest total weight to half of the total weight
    min_diff = float('inf')
    result = None
    for left_sum in left_combinations:
        for right_sum in right_combinations:
            diff = abs(left_sum - right_sum)
            if diff < min_diff:
                min_diff = diff
                result = (left_sum, right_sum)

return result

You can use this function by passing a list of item weights to it, and it will return the total weight for each backpack that minimizes the difference between their weights.

This approach ensures that the items are distributed in a way that balances the weight between the two backpacks as closely as possible.

Let me know if you need further assistance with this Python implementation!