抽屉原理 on 111qqz's bloghttps://111qqz.com/en/tags/%E6%8A%BD%E5%B1%89%E5%8E%9F%E7%90%86/Recent content in 抽屉原理 on 111qqz's blogHugo -- gohugo.ioen© 2015-2026 111qqzWed, 30 Nov 2016 08:10:23 +0000poj 3274 Gold Balanced Lineup (抽屉原理？错题？)https://111qqz.com/en/post/acm-icpc/2016/2016-11-30-poj-3274/Wed, 30 Nov 2016 08:10:23 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-11-30-poj-3274/<p><a href="http://poj.org/problem?id=3274" target="_blank" rel="noreferrer">poj 3274 题目链接</a></p> <p>题意：给出n个数和k，每个数不超过k位二进制。现在问最长的一段区间，满足该区间中所有数相加，k个位置上的数相等。</p>poj 2356 Find a multiple (剩余类，抽屉原理)https://111qqz.com/en/post/acm-icpc/2016/2016-02-29-poj2356/Mon, 29 Feb 2016 13:06:00 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-02-29-poj2356/<p><a href="http://poj.org/problem?id=2356" target="_blank" rel="noreferrer">http://poj.org/problem?id=2356</a></p> <p>题意：有 n 个数，从中选取若干个（1..n），和能被 n 整除。问是否有解，无解输出 0，有解的话，<strong>输出个数以及选择的 <code>a[i]</code>（不是 i）</strong>。</p>hdu 1205 吃糖果 （鸽笼原理）https://111qqz.com/en/post/acm-icpc/2016/2016-02-29-hdu1205/Mon, 29 Feb 2016 12:51:51 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-02-29-hdu1205/<p><a href="http://acm.hdu.edu.cn/showproblem.php?pid=1205" target="_blank" rel="noreferrer">http://acm.hdu.edu.cn/showproblem.php?pid=1205</a> 题意：有n种糖果，第i种糖果有a[i]个，相邻两次不能吃一样的糖果，问能否有办法吃完所有糖果&hellip; 思路：如果第i种糖果有k个的话，那么其他所有种类的糖果之和至少有k-1个，才可能吃完。复杂度O(n) 看到有人说是抽屉原理&hellip;..大概。。。？不过不太明显。。直接想就好吧</p>codeforces #319 B - Modulo Sum (抽屉原理，dp)https://111qqz.com/en/post/acm-icpc/2015/2015-09-16-codeforces319b-modulosume68abde5b189e58e9fe79086efbc8cdp/Wed, 16 Sep 2015 03:24:00 +0000https://111qqz.com/en/post/acm-icpc/2015/2015-09-16-codeforces319b-modulosume68abde5b189e58e9fe79086efbc8cdp/<p>背包还是理解的不够透彻．．</p> <p>因为每次都是用那个一维形式的．</p> <p>这道题的做法类似01背包.</p>poj 3370 Halloween treats (剩余类,抽屉原理)https://111qqz.com/en/post/acm-icpc/2015/2015-08-21-poj3370halloweentreatse589a9e4bd99e7b1bbe68abde5b189e58e9fe79086/Fri, 21 Aug 2015 05:36:00 +0000https://111qqz.com/en/post/acm-icpc/2015/2015-08-21-poj3370halloweentreatse589a9e4bd99e7b1bbe68abde5b189e58e9fe79086/<p>昨天那道签到的数学题没搞出来不开心.</p> <p>是时候刷一波数学了</p> <p>这题题意是说,从n个数中任选m个,使得m个的和为c的倍数.</p>HUST team contest #2 C Divisible Subsequences ||poj 3844 (剩余类)https://111qqz.com/en/post/acm-icpc/2015/2015-08-20-poj3844/Thu, 20 Aug 2015 17:11:00 +0000https://111qqz.com/en/post/acm-icpc/2015/2015-08-20-poj3844/<p>算是签到帖，竟然卡住了。</p> <p>我数学还是太差了。。</p> <p>然后去找题解。。竟然看不懂！</p>