【代表团坐车】Python

 难度指数：⭐⭐⭐

知识点：回溯法

华为od统一考试B卷【代表团坐车】Python 实现

Mine：

idea

代码实现

from time import time
import functools
   
def solve():
   
    return 0

def solve0(nums0, total):
    if total == 0:  return 1
    if len(nums0) == 0 or nums0[0] > total:    return 0
    res = 0
    for i in range(len(nums0)):
        if total >= nums0[i]:
            res += solve0(nums0[i+1:], total - nums0[i])
    return res

T = 1
while T:
    nums = list(map(int, input().split(',')))
    total = int(input())
    nums.sort()
    t1 = time() 
    res0 = solve0(nums, total)
    t2 = time()
    res = solve()
    t3 = time()
    if res != res0:
        print(res0)
    print(t3 - t2, t2 - t1)
    T -= 1