09 2014 档案

摘要:#include <iostream>#include <string.h>#include <stdlib.h>#include <stdio.h>#include <queue>#include<algorithm>#define inf 0x3f3f3f3fusing namespace st 阅读全文
posted @ 2014-09-25 20:34 人艰不拆_zmc 阅读(212) 评论(0) 推荐(0) 编辑
摘要:http://poj.org/problem?id=2513 Description You are given a bunch of wooden sticks. Each endpoint of each stick is colored with some color. Is it possi 阅读全文
posted @ 2014-09-22 20:56 人艰不拆_zmc 阅读(274) 评论(0) 推荐(0) 编辑
摘要:http://acm.hdu.edu.cn/showproblem.php?pid=1010 //题目链接 http://ycool.com/post/ymsvd2s//一个很好理解剪枝思想的博客 http://blog.csdn.net/chyshnu/article/details/617175 阅读全文
posted @ 2014-09-21 18:56 人艰不拆_zmc 阅读(197) 评论(0) 推荐(0) 编辑
摘要:http://poj.org/problem?id=3087 Description A common pastime for poker players at a poker table is to shuffle stacks of chips. Shuffling chips is perfo 阅读全文
posted @ 2014-09-20 19:40 人艰不拆_zmc 阅读(205) 评论(0) 推荐(0) 编辑
摘要:http://poj.org/problem?id=3009 Description On Planet MM-21, after their Olympic games this year, curling is getting popular. But the rules are somewha 阅读全文
posted @ 2014-09-20 00:04 人艰不拆_zmc 阅读(279) 评论(0) 推荐(0) 编辑
摘要:http://poj.org/problem?id=2488 Description Background The knight is getting bored of seeing the same black and white squares again and again and has d 阅读全文
posted @ 2014-09-19 19:25 人艰不拆_zmc 阅读(253) 评论(0) 推荐(0) 编辑
摘要:http://poj.org/problem?id=1426 Description Given a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representat 阅读全文
posted @ 2014-09-18 19:56 人艰不拆_zmc 阅读(388) 评论(0) 推荐(0) 编辑
摘要:http://poj.org/problem?id=3083 Description The cornfield maze is a popular Halloween treat. Visitors are shown the entrance and must wander through th 阅读全文
posted @ 2014-09-18 12:15 人艰不拆_zmc 阅读(256) 评论(0) 推荐(0) 编辑
摘要:http://acm.sdut.edu.cn/sdutoj/problem.php?action=showproblem&problemid=1157 题目描述 小鼠a与小鼠b身处一个m×n的迷宫中,如图所示。每一个方格表示迷宫中的一个房间。这m×n个房间中有一些房间是封闭的,不允许任何人进入。在迷 阅读全文
posted @ 2014-09-17 20:43 人艰不拆_zmc 阅读(784) 评论(0) 推荐(0) 编辑
摘要:http://poj.org/problem?id=2049 Description Nemo is a naughty boy. One day he went into the deep sea all by himself. Unfortunately, he became lost and 阅读全文
posted @ 2014-09-16 21:13 人艰不拆_zmc 阅读(251) 评论(0) 推荐(0) 编辑
摘要:http://acm.hdu.edu.cn/showproblem.php?pid=1180 Problem Description Hogwarts正式开学以后,Harry发现在Hogwarts里,某些楼梯并不是静止不动的,相反,他们每隔一分钟就变动一次方向. 比如下面的例子里,一开始楼梯在竖直方 阅读全文
posted @ 2014-09-16 18:42 人艰不拆_zmc 阅读(391) 评论(0) 推荐(0) 编辑
摘要:Dungeon Master Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 16748 Accepted: 6522 Description You are trapped in a 3D dungeon and need to 阅读全文
posted @ 2014-09-15 20:52 人艰不拆_zmc 阅读(241) 评论(0) 推荐(0) 编辑
摘要:http://poj.org/problem?id=1062 Description 年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了,于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探险家拿不出这么多金币,便请求酋长降低要求。酋长说:"嗯,如果你能够替我弄到 阅读全文
posted @ 2014-09-15 16:28 人艰不拆_zmc 阅读(345) 评论(0) 推荐(0) 编辑
摘要:http://acm.hdu.edu.cn/showproblem.php?pid=5012 Problem Description There are 2 special dices on the table. On each face of the dice, a distinct number 阅读全文
posted @ 2014-09-14 19:26 人艰不拆_zmc 阅读(299) 评论(0) 推荐(0) 编辑
摘要:http://poj.org/problem?id=1860 Description Several currency exchange points are working in our city. Let us suppose that each point specializes in two 阅读全文
posted @ 2014-09-13 19:44 人艰不拆_zmc 阅读(367) 评论(0) 推荐(0) 编辑
摘要:http://poj.org/problem?id=1789 Description Advanced Cargo Movement, Ltd. uses trucks of different types. Some trucks are used for vegetable delivery, 阅读全文
posted @ 2014-09-12 22:03 人艰不拆_zmc 阅读(298) 评论(0) 推荐(0) 编辑
摘要:http://poj.org/problem?id=2485 Description The island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has no public highways. So the tra 阅读全文
posted @ 2014-09-12 21:08 人艰不拆_zmc 阅读(245) 评论(0) 推荐(0) 编辑
摘要:http://poj.org/problem?id=1258 Description Farmer John has been elected mayor of his town! One of his campaign promises was to bring internet connecti 阅读全文
posted @ 2014-09-12 18:54 人艰不拆_zmc 阅读(400) 评论(0) 推荐(0) 编辑
摘要:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=2833 A friend is like a flower, a rose to be exact, Or maybe like a brand new gate that n 阅读全文
posted @ 2014-09-11 11:54 人艰不拆_zmc 阅读(458) 评论(0) 推荐(0) 编辑
摘要:http://poj.org/problem?id=1182 Description 动物王国中有三类动物A,B,C,这三类动物的食物链构成了有趣的环形。A吃B, B吃C,C吃A。 现有N个动物,以1-N编号。每个动物都是A,B,C中的一种,但是我们并不知道它到底是哪一种。 有人用两种说法对这N个动 阅读全文
posted @ 2014-09-09 21:33 人艰不拆_zmc 阅读(436) 评论(0) 推荐(0) 编辑
摘要:#include #include #include #include using namespace std; typedef struct Node { struct Node *next; int l;//线性表的长度 int data; } Node; Node *head,*head1,*tail,*p,*q; int S,n; void Showmai... 阅读全文
posted @ 2014-09-09 10:21 人艰不拆_zmc 阅读(377) 评论(0) 推荐(0) 编辑
摘要:http://acm.sdut.edu.cn/sdutoj/problem.php?action=showproblem&problemid=2465 题目描述 由于前两次的打击,ZYJ同学不再喜欢密码学,他喜欢上了游戏。某一 天,他要玩魔塔这个游戏,游戏规则是这样的,游戏地图的大小为N*M,一开始 阅读全文
posted @ 2014-09-02 20:53 人艰不拆_zmc 阅读(308) 评论(0) 推荐(0) 编辑
摘要:http://poj.org/problem?id=2528 Description The citizens of Bytetown, AB, could not stand that the candidates in the mayoral election campaign have bee 阅读全文
posted @ 2014-09-01 21:27 人艰不拆_zmc 阅读(265) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示