
qdu_week6
yinghui970828
这个作者很懒,什么都没留下…
展开
-
Radar Installation POJ - 1328
Assume the coasting is an infinite straight line. Land is in one side of coasting, sea in the other. Each small island is a point locating in the sea side. And any radar installation, locating on the原创 2017-01-31 14:06:19 · 245 阅读 · 1 评论 -
汉诺塔问题
找到一位大神的关于汉诺塔的问题 超级六汉诺塔问题的递归实现 汉诺塔(又称河内塔)问题是源于印度一个古老传说的益智玩具。大梵天创造世界的时候做了三根金刚石柱子,在一根柱子上从下往上按照大小顺序摞着64片黄金圆盘。大梵天命令婆罗门把圆盘从下面开始按大小顺序重新摆放在另一根柱子上。并且规定,在小圆盘上不能放大圆盘,在三根柱子之间一次只能移动一个圆盘。转载 2017-02-01 17:29:42 · 1011 阅读 · 0 评论 -
Tautology POJ - 3295
WFF 'N PROOF is a logic game played with dice. Each die has six faces representing some subset of the possible symbols K, A, N, C, E, p, q, r, s, t. A Well-formed formula (WFF) is any string of these转载 2017-02-01 17:23:14 · 217 阅读 · 0 评论 -
排序 HDU - 1106
输入一行数字,如果我们把这行数字中的‘5’都看成空格,那么就得到一行用空格分割的若干非负整数(可能有些整数以‘0’开头,这些头部的‘0’应该被忽略掉,除非这个整数就是由若干个‘0’组成的,这时这个整数就是0)。你的任务是:对这些分割得到的整数,依从小到大的顺序排序输出。 Input输入包含多组测试用例,每组输入数据只有一行数字(数字之间没有空格),这行数字的长度不大原创 2017-02-01 16:43:16 · 227 阅读 · 0 评论 -
ID Codes POJ - 1146
It is 2084 and the year of Big Brother has finally arrived, albeit a century late. In order to exercise greater control over its citizens and thereby to counter a chronic breakdown in law and order, t原创 2017-02-01 11:39:08 · 330 阅读 · 0 评论 -
Consecutive Digits POJ - 2710
关于数论的一些问题1.十进制如何转化为八进制十六进制N进制:正数除N反余,小数乘N取整;翻过来时各个位分别乘以N的x(位数)次幂As a recruiting ploy, Google once posted billboards in Harvard Square and in the Silicon Valley area just stating “{first 10-digit p原创 2017-01-31 22:51:45 · 600 阅读 · 0 评论 -
Integer Inquiry POJ - 1503
One of the first users of BIT's new supercomputer was Chip Diller. He extended his exploration of powers of 3 to go from 0 to 333 and he explored taking various sums of those numbers.``This superc原创 2017-01-31 19:39:52 · 839 阅读 · 0 评论 -
Maya Calendar POJ - 1008
During his last sabbatical, professor M. A. Ya made a surprising discovery about the old Maya calendar. From an old knotted message, professor discovered that the Maya civilization used a 365 day long原创 2017-01-31 19:12:06 · 280 阅读 · 1 评论 -
Power of Cryptography POJ - 2109
Current work in cryptography involves (among other things) large prime numbers and computing powers of numbers among these primes. Work in this area has resulted in the practical use of results from n原创 2017-01-31 14:17:54 · 297 阅读 · 1 评论 -
Cornfields POJ - 2019
给出一个N*N (N100000)个询问。每次询问如下:以(Xi,Yi)为左上角,边长为B的子方阵中,最大值和最小值的差是多少?注意对于所有的询问,B都是一个定值。Input第一行N,B(N),K。含义如上。接下来N行N列的一个矩阵,每个数250。 接下来K行表示询问,每行两个数Xi, Yi 表示询问的方阵的左上角。Output一行一个正整数,含义如上。原创 2017-01-31 14:07:10 · 407 阅读 · 3 评论 -
Maze CodeForces - 377A
Pavel loves grid mazes. A grid maze is an n × m rectangle maze where each cell is either empty, or is a wall. You can go from one cell to another only if both cells are empty and have a common side.原创 2017-02-03 07:32:15 · 603 阅读 · 0 评论