https://111qqz.com/en/tags/%E7%BB%93%E8%AE%BA%E9%A2%98/Recent content in 结论题 on 111qqz's blogHugo -- gohugo.ioen© 2015-2026 111qqzMon, 06 Nov 2017 11:09:10 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-11-06-hdu-6048/Mon, 06 Nov 2017 11:09:10 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-11-06-hdu-6048/<p><a href="http://acm.hdu.edu.cn/showproblem.php?pid=6048" target="_blank" rel="noreferrer">http://acm.hdu.edu.cn/showproblem.php?pid=6048</a></p> <h1 class="relative group">题意： <div id="题意" class="anchor"></div> <span class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"> <a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#%e9%a2%98%e6%84%8f" aria-label="Anchor">#</a> </span> </h1> <p>有 n * m - 1 个数，每次选择第 1,p + 1,p * 2 + 1….. 的顺序选择数，<strong>先按左到右，再按从上到下的顺序</strong>填入n * m 的格子，空格子可以和相邻的数字交换位置，问最后能否在格子中形成 1~ n * m - 1的数按从左到右，从上到下的顺序。</p>