https://blog.youkuaiyun.com/p605779zh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/p605779/article/details/147025863https://blog.youkuaiyun.com/p605779/article/details/147025863p605779Sun, 06 Apr 2025 15:39:08 +0800 如果减去一个包装能拼出来，那么 dp[j] 也能拼出来。// 如果dp[j]从后面找的话，找到了就是最大的，然后我们输出j，结束程序。if (flag == true) { // 如果x是公倍数，就肯定没有最大上限了。// 只要找到一个不是x的倍数，就说明x非1~n的公约数。// 这里我用的是最没用的试除，不过能过就行（// 如果跑完了还没找到不能组装的，就输出0。// ------- 没有最大上限。// ------- 没有最大上限。]]>https://blog.youkuaiyun.com/p605779/article/details/147025834https://blog.youkuaiyun.com/p605779/article/details/147025834p605779Sun, 06 Apr 2025 15:36:44 +0800https://blog.youkuaiyun.com/p605779/article/details/140761060https://blog.youkuaiyun.com/p605779/article/details/140761060p605779Mon, 29 Jul 2024 07:45:40 +0800https://blog.youkuaiyun.com/p605779/article/details/140761058https://blog.youkuaiyun.com/p605779/article/details/140761058p605779Mon, 29 Jul 2024 07:44:46 +0800https://blog.youkuaiyun.com/p605779/article/details/140754156https://blog.youkuaiyun.com/p605779/article/details/140754156p605779Sun, 28 Jul 2024 18:22:45 +0800https://blog.youkuaiyun.com/p605779/article/details/140751803https://blog.youkuaiyun.com/p605779/article/details/140751803p605779Sun, 28 Jul 2024 15:54:03 +0800https://blog.youkuaiyun.com/p605779/article/details/140751167https://blog.youkuaiyun.com/p605779/article/details/140751167p605779Sun, 28 Jul 2024 15:21:29 +0800https://blog.youkuaiyun.com/p605779/article/details/140738855https://blog.youkuaiyun.com/p605779/article/details/140738855p605779Sat, 27 Jul 2024 17:51:20 +0800https://blog.youkuaiyun.com/p605779/article/details/140738565https://blog.youkuaiyun.com/p605779/article/details/140738565p605779Sat, 27 Jul 2024 17:30:46 +0800