https://111qqz.com/en/tags/%E5%8F%8D%E7%B4%A0%E6%95%B0/Recent content in 反素数 on 111qqz's blogHugo -- gohugo.ioen© 2015-2026 111qqzWed, 21 Sep 2016 17:03:08 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-09-21-poj-2886/Wed, 21 Sep 2016 17:03:08 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-09-21-poj-2886/<p><a href="http://poj.org/problem?id=2886" target="_blank" rel="noreferrer">poj 2886 题目链接</a></p> <p>题意：n个人围成一圈，每个人身上由一个数，可正可负。从第k个人开始出圈，如果第k个人身上的数是X,X&gt;0，就左边第x个没有出圈的人出圈，否则右边第-X个人出圈。 第k个人出圈得到的糖果数目为f(k)，f(x)表示x的因子个数。现在问谁能拿到最多的糖果，并且拿到了多少糖果。</p>https://111qqz.com/en/post/acm-icpc/2016/2016-09-21-bzoj-1053/Wed, 21 Sep 2016 12:31:01 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-09-21-bzoj-1053/<h2 class="relative group">1053: [HAOI2007]反素数ant <div id="1053-haoi2007反素数ant" 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="#1053-haoi2007%e5%8f%8d%e7%b4%a0%e6%95%b0ant" aria-label="Anchor">#</a> </span> </h2> <p>Time Limit: 10 Sec  Memory Limit: 162 MB Submit: 2750  Solved: 1559 [<a href="http://www.lydsy.com/JudgeOnline/submitpage.php?id=1053" target="_blank" rel="noreferrer">Submit</a>][<a href="http://www.lydsy.com/JudgeOnline/problemstatus.php?id=1053" target="_blank" rel="noreferrer">Status</a>][<a href="http://www.lydsy.com/JudgeOnline/bbs.php?id=1053" target="_blank" rel="noreferrer">Discuss</a>]</p>https://111qqz.com/en/post/acm-icpc/2016/2016-09-21-codeforces-27-e-number-with-the-given-amount-of-divisors-dfs/Wed, 21 Sep 2016 09:02:26 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-09-21-codeforces-27-e-number-with-the-given-amount-of-divisors-dfs/<p><a href="http://codeforces.com/contest/27/problem/E" target="_blank" rel="noreferrer">题目链接</a></p> <p>题意：求约数个数<strong>恰好</strong>为n个的最小的x</p> <p>思路：这道题是作为反素数的例题出现在acdreamer的博客里的。</p>https://111qqz.com/en/post/acm-icpc/2016/2016-09-21-hdu-2521/Wed, 21 Sep 2016 08:27:48 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-09-21-hdu-2521/<p><a href="http://acm.hdu.edu.cn/showproblem.php?pid=2521" target="_blank" rel="noreferrer">题目链接</a></p> <p>题意：求区间[a,b]中约数最多的那个数，如果有多个，输出最小的。</p>https://111qqz.com/en/post/acm-icpc/2016/2016-09-21-e58f8de7b4a0e695b0e5ada6e4b9a0e7ac94e8aeb0/Wed, 21 Sep 2016 07:24:41 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-09-21-e58f8de7b4a0e695b0e5ada6e4b9a0e7ac94e8aeb0/<p><a href="http://blog.csdn.net/ACdreamers/article/details/25049767" target="_blank" rel="noreferrer">acdreamer的博客</a></p> <p>wiki上的反素数是什么鬼orz&hellip;完全不是一个东西吧。。。。</p>