ACM_PKU
ITAK
这个作者很懒,什么都没留下…
展开
-
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原创 2017-09-03 15:44:50 · 670 阅读 · 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-原创 2016-09-09 21:07:34 · 841 阅读 · 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原创 2016-08-08 18:13:54 · 1006 阅读 · 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原创 2016-08-03 18:40:42 · 745 阅读 · 0 评论 -
POJ 1830 开关问题(高斯消元)
传送门 开关问题 Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 7263 Accepted: 2822 Description有N个相同的开关,每个开关都与某些开关有着联系,每当你打开或者关闭某个开关的时候,其他的与此开关相关联的开关也会相应地发生变化,即这些相联系的开关的状态如果原来为开就变为关,如果原创 2016-06-18 10:01:53 · 802 阅读 · 0 评论 -
POJ 1222 EXTENDED LIGHTS OUT(高斯消元)
高斯消元原创 2016-06-16 18:42:23 · 1576 阅读 · 0 评论 -
POJ 1681 Painter's Problem(高斯消元)
高斯消元 + 构造矩阵原创 2016-06-16 16:05:26 · 2132 阅读 · 0 评论 -
POJ 2187 Beauty Contest(旋转卡壳模板题)
传送门 Beauty Contest Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 33435 Accepted: 10361 DescriptionBessie, Farmer John’s prize cow, has just won first place in a bovine beau原创 2016-05-19 20:13:50 · 4639 阅读 · 0 评论 -
POJ 3061 Subsequence(尺取法)
尺取法(二分) + 思维原创 2016-04-23 20:53:41 · 3078 阅读 · 0 评论 -
POJ 3347 Kadj Squares(计算几何)
传送门Kadj Squares Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 2937 Accepted: 1151 DescriptionIn this problem, you are given a sequence S1, S2, …, Sn of squares of different siz原创 2016-05-17 20:53:43 · 3943 阅读 · 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原创 2016-09-09 21:22:29 · 973 阅读 · 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原创 2016-09-12 11:14:20 · 1182 阅读 · 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原创 2016-09-12 20:00:30 · 1056 阅读 · 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.原创 2017-08-28 19:59:02 · 1052 阅读 · 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原创 2017-08-27 20:19:09 · 1263 阅读 · 2 评论 -
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原创 2017-06-16 11:57:27 · 510 阅读 · 0 评论 -
POJ 3783 Balls(扔鸡蛋问题——DP动态规划)
传送门 BallsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 892Accepted: 588DescriptionThe classic Two Glass Balls brain-teaser is often posed as: “Given two identical glass spheres, you woul原创 2016-08-03 14:56:47 · 3359 阅读 · 0 评论 -
博弈论之阶梯博弈
大家首先来看一个图片: 那么我来说一下这个图片代表的含义: 首先有这么5层台阶:然后每层台阶上都有不定数量的石子,现在AliceAlice 和 BobBob 两个人进行一个小游戏,游戏的规则就是 将一个台阶上的若干个点移动到下一层(或者上一层)台阶中,谁不能移动谁就输了,一定是单一的,也就是只能向上层移动或者是只能向下层移动。这样的博弈就是阶梯博弈。其实阶梯博弈可以转化为 Nim 博弈,将奇原创 2016-12-20 18:25:34 · 1085 阅读 · 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原创 2016-10-07 18:32:04 · 710 阅读 · 0 评论 -
POJ 1830 开关问题(异或版高斯消元)
传送门开关问题Time Limit: 1000MSMemory Limit: 30000KTotal Submissions: 7731Accepted: 3034Description有N个相同的开关,每个开关都与某些开关有着联系,每当你打开或者关闭某个开关的时候,其他的与此开关相关联的开关也会相应地发生变化,即这些相联系的开关的状态如果原来为开就变为关,如果为关就变为开。你的目标是经过若干次开关原创 2016-09-08 16:05:54 · 809 阅读 · 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原创 2016-09-08 14:08:50 · 891 阅读 · 0 评论 -
POJ 1753 Flip Game(高斯消元入门超详细题解)——Northeastern Europe 2000
传送门Flip GameTime Limit: 3000/1000MS (Java/Others) Memory Limit: 65535/65535KB (Java/Others)Submit StatusFlip game is played on a rectangular 4×44×4 field with two-s原创 2016-09-05 16:56:29 · 1659 阅读 · 0 评论 -
POJ 2096 Collecting Bugs(概率DP求期望)
概率DP求期望原创 2016-05-05 11:09:17 · 2666 阅读 · 2 评论 -
POJ 3744 Scout YYF I(概率DP)
传送门 Scout YYF I Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7221 Accepted: 2106 DescriptionYYF is a couragous scout. Now he is on a dangerous mission which is to penetrate i原创 2016-04-28 10:47:16 · 1002 阅读 · 0 评论 -
Poj 1611 The Suspects
Poj 1611 的传送门 ***The Suspects***Description Severe acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, was recognized as a global threat in mid-March 2003. To原创 2015-08-09 11:16:55 · 577 阅读 · 0 评论 -
Poj 1321 棋盘问题
click here ~~Input输入含有多组测试数据。 每组数据的第一行是两个正整数,n k,用一个空格隔开,表示了将在一个n*n的矩阵内描述棋盘,以及摆放棋子的数目。 n <= 8 , k <= n 当为-1 -1时表示输入结束。 随后的n行描述了棋盘的形状:每行有n个字符,其中 # 表示棋盘区域, . 表示空白区域(数据保证不出现多余的空白行或者空白列)。 Output对于每一组数据原创 2015-08-18 22:01:08 · 708 阅读 · 0 评论 -
poj 3126 Prime Path
Prime PathTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14374 Accepted: 8112DescriptionThe ministers of the cabinet were quite upset by the message fr原创 2015-09-09 16:36:27 · 493 阅读 · 0 评论 -
POJ 3907 Build Your Home
传送门的连接地址 题目大意:给你一个数n ,然后给出n个坐标值(二维),让你求面积; 解题思路:求叉积,注意最后取绝对值,而且还要除以2啊。。。 上代码:#include <iostream>#include <cstdio>#include <cmath>using namespace std;const int maxn=1e4+5;struct Point{ doub原创 2015-08-04 09:26:14 · 705 阅读 · 0 评论 -
poj 3278 Catch That Cow
Catch That CowTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 62146 Accepted: 19460DescriptionFarmer John has been informed of the location of a fugitiv原创 2015-09-08 20:34:12 · 491 阅读 · 0 评论 -
poj 1426 Find The Multiple
poj 1426 的传送门 题目大意:给你一个数,让你找能够整除这个数的而且只含有0和1 的数,比如说 input :3; output : 111; 可能有多个答案,只需要输出一个即可; 解题思路:用dfs搜索,只搜关于0和1 的数,详情见代码,,,,上代码:#include <iostream>using namespace std;bool fo;void dfs(unsigne原创 2015-08-06 11:09:41 · 647 阅读 · 0 评论 -
Poj 2386 Lake Counting
click here~~ ***Lake Counting***Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 24201 Accepted: 12216 DescriptionDue to recent rains原创 2015-08-17 19:30:28 · 724 阅读 · 0 评论 -
Poj 3370 Halloween Treats
题目连接:http://poj.org/problem?id=3370DescriptionEvery year there is the same problem at Halloween: Each neighbour is only willing to give a certain total number of sweets on that day, no matter how many原创 2015-08-03 16:09:02 · 684 阅读 · 0 评论 -
Poj 2492 A Bug's Life
Poj 2492 的传送门题目大意:输入n个bug,bug之间有interaction,当前假设异性之间才interaction,但是需要验证,给定这些interaction对,判定是否满足假设,如果相同则有同性恋,后面就算输入数据也不用做处理了,否则就一直处理下去。解题思路:并查集,具体详见代码:#include <iostream>#include <cstdio>#include <cst原创 2015-08-09 20:27:12 · 678 阅读 · 0 评论 -
Poj 2524 Ubiquitous Religions
请点击此处,将会让你传送 <– **Ubiquitous Religions**DescriptionThere are so many different religions in the world today that it is difficult to keep track of them all. You are interested in find原创 2015-08-10 11:21:05 · 751 阅读 · 0 评论 -
Poj 2240 Arbitrage
click here~~ ***Arbitrage***Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 17969 Accepted: 7597 DescriptionArbitrage is the use of discrepancies i原创 2015-08-19 18:41:19 · 725 阅读 · 0 评论 -
FZU 1752 a^b%c
题目连接:http://acm.fzu.edu.cn/problem.php?pid=1752 解题思路:要用快速幂,但不是单纯的用,如果单纯的用的话就会爆掉,要把乘法转化为加法,然后再用而且尽量用位运算。。。 上代码:#include <iostream>#include <cstdio>using namespace std;typedef long long LL;LL multi原创 2015-08-03 17:05:33 · 812 阅读 · 0 评论 -
poj 1426 Find The Multiple ( dfs )
点击打开链接Find The MultipleTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 22234 Accepted: 9128 Special JudgeDescriptionGiven a positive int原创 2015-09-09 17:02:45 · 648 阅读 · 0 评论 -
POJ 2236 A - Wireless Network[kuangbin带你飞]专题五 并查集
点击打开链接A - Wireless NetworkTime Limit:10000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 2236DescriptionAn earthquake takes原创 2015-09-18 20:10:38 · 791 阅读 · 0 评论 -
poj 3087 Shuffle'm Up (kuangbin带你飞--简单搜索)
Shuffle'm UpTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7739 Accepted: 3559DescriptionA common pastime for poker players at a poker table is to shuf原创 2015-09-16 21:09:05 · 570 阅读 · 0 评论 -
poj 3565 (弱校联萌十一大决战之厉兵秣马 A. Ants )
AntsTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 5357 Accepted: 1660 Special JudgeDescriptionYoung naturalist Bill studies ants in school. His an原创 2015-10-05 13:06:15 · 605 阅读 · 0 评论