关闭

POJ 2151 Check the difficulty of problems(概率DP)

传送门 Organizing a programming contest is not an easy job. To avoid making the problems too difficult, the organizer usually expect the contest result satisfy the following two terms: 1. All of the te...
阅读(298) 评论(0)

POJ 3301 Texas Trip(最小正方形覆盖+三分)

传送门 After a day trip with his friend Dick, Harry noticed a strange pattern of tiny holes in the door of his SUV. The local American Tire store sells fiberglass patching material only in square sheets....
阅读(302) 评论(0)

POJ 2429 GCD & LCM Inverse(大整数素因子分解+二进制枚举)

GCD & LCM InverseTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 16540Accepted: 3061DescriptionGiven two positive integers a and b, we can easily calculate the greatest common divisor (GCD) an...
阅读(141) 评论(0)

Poj 2689 Prime Distance(素数筛+二次素数筛)

传送门The branch of mathematics called number theory is about properties of numbers. One of the areas that has captured the interest of number theoreticians for thousands of years is the question of prima...
阅读(178) 评论(0)

博弈论之阶梯博弈

大家首先来看一个图片: 那么我来说一下这个图片代表的含义: 首先有这么5层台阶:然后每层台阶上都有不定数量的石子,现在AliceAlice 和 BobBob 两个人进行一个小游戏,游戏的规则就是 将一个台阶上的若干个点移动到下一层(或者上一层)台阶中,谁不能移动谁就输了,一定是单一的,也就是只能向上层移动或者是只能向下层移动。这样的博弈就是阶梯博弈。其实阶梯博弈可以转化为 Nim 博弈,将奇...
阅读(345) 评论(0)

POJ 3735 Training little cats(矩阵乘法 + 稀疏矩阵优化)——2016弱校联盟十一专场10.7(12点场)

传送门Training little catsTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 13373Accepted: 3298DescriptionFacer’s pet cat just gave birth to a brood of little cats. Having considered the health of...
阅读(365) 评论(0)

POJ 2065 SETI(高斯消元解同余方程组)

传送门SETITime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 1882Accepted: 1165DescriptionFor some years, quite a lot of work has been put into listening to electromagnetic radio signals received fr...
阅读(602) 评论(0)

POJ 2947 Widget Factory(高斯消元解同余方程组)

传送门Widget FactoryTime Limit: 7000MSMemory Limit: 65536KTotal Submissions: 5663Accepted: 1961DescriptionThe widget factory produces several different kinds of widgets. Each widget is carefully built by...
阅读(658) 评论(0)

POJ 2965 The Pilots Brothers' refrigerator(高斯消元三种方法)

传送门The game “The Pilots Brothers: following the stripy elephant” has a quest where a player needs to open a refrigerator.There are 16 handles on the refrigerator door. Every handle can be in one of two...
阅读(494) 评论(0)

POJ 3185 The Water Bowls (高斯消元)

传送门The Water BowlsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 5946Accepted: 2346DescriptionThe cows have a line of 20 water bowls from which they drink. The bowls can be either right-side-...
阅读(527) 评论(0)

POJ 1830 开关问题(异或版高斯消元)

传送门开关问题Time Limit: 1000MSMemory Limit: 30000KTotal Submissions: 7731Accepted: 3034Description有N个相同的开关,每个开关都与某些开关有着联系,每当你打开或者关闭某个开关的时候,其他的与此开关相关联的开关也会相应地发生变化,即这些相联系的开关的状态如果原来为开就变为关,如果为关就变为开。你的目标是经过若干次开关...
阅读(496) 评论(0)

POJ 1222 EXTENDED LIGHTS OUT(高斯消元 异或+求逆版本)

传送门EXTENDED LIGHTS OUTTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 9297Accepted: 6040DescriptionIn an extended version of the game Lights Out, is a puzzle with 5 rows of 6 buttons each (the...
阅读(564) 评论(0)

[置顶] POJ 1753 Flip Game(高斯消元入门超详细题解)——Northeastern Europe 2000

传送门 Flip Game Time Limit: 3000/1000MS (Java/Others)     Memory Limit: 65535/65535KB (Java/Others) Submit  Status Flip game is played on a rectangular 4×44×4 field with two-s...
阅读(944) 评论(0)

POJ 1845 Sumdiv(逆元的应用)

传送门SumdivTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 19009Accepted: 4773DescriptionConsider two natural numbers A and B. Let S be the sum of all natural divisors of A^B. Determine S modulo...
阅读(387) 评论(0)

POJ 1106 Transmitters(计算几何:叉积)

传送门 div class=”ptt” lang=”en-US”>TransmittersTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 5088Accepted: 2686DescriptionIn a wireless network with multiple transmitters sending on the sam...
阅读(424) 评论(0)
47条 共4页1 2 3 4 下一页 尾页
    个人资料
    • 访问:469508次
    • 积分:10923
    • 等级:
    • 排名:第1627名
    • 原创:635篇
    • 转载:5篇
    • 译文:0篇
    • 评论:93条
    博客专栏