第一题AC了,要注意结果要和木头人数量m取min if __name__ == "__main__": T = int(input()) ret = [] def woodman(n, m, a, b): if n < a: return 0 if n == a: return b if (n - a) * b // a + b > m: return m else: return (n - a) * b // a + b for count in range(T): tmp = list(map(int, input()....