- 博客(15)
- 收藏
- 关注
RSS订阅原创 POJ 1116 Library
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 922 Accepted: 305DescriptionCastaway Robinson Crusoe is living alone on a remote island. One day
2018-01-24 17:35:14
362
原创 Radar Installation (线段覆盖)
Radar InstallationTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 94767 Accepted: 21097DescriptionAssume the coasting is an infinite straight line. Land
2017-12-18 22:57:53
244
原创 线段覆盖系列
线段覆盖1给定x轴上的N（0输入描述 Input Description 输入第一行是一个整数N。接下来有N行，每行有二个空格隔开的整数，表示一条线段的二个端点的坐标。输出描述 Output Description 输出第一行是一个整数表示最多剩下的线段数。样例输入 Sample Input36 31 32 5样例输出 Sample O
2017-12-18 22:42:59
5035
原创 萨布的生日礼物
萨布的生日礼物Time Limit: 1 Second Memory Limit: 65536 KB 问题描述萨布刚刚度过了他的三岁生日，收到了很多礼物。尽管萨布只有三岁，但他和他的父亲约翰一样喜欢整洁。因此萨布已经开始整理这些礼物了。萨布共收到了 N 份礼物，且第 i 件礼物的标号是 i。他想把这 N 件礼物放到一些箱子里，并保证每个箱子里的礼物不会发生
2017-12-18 12:48:32
267
原创 Fractal
FractalTime Limit: 2 Seconds Memory Limit: 65536 KB Score: 1 问题描述你们懂分形么？分形很美。给大家介绍一种分形图，Sierpinski 三角形，它的分形过程可以用这张图直观的展现：画一个等边三角形，找到三个边的中点，相互连起来，就得到了四个三角形，重复对外部的三个进行这个动作，就得
2017-12-18 11:18:38
437
原创 周易与中国文化
周易与中国文化 Time Limit: 2 Seconds Memory Limit: 65536 KB Score: 1 问题描述Banlk 的室友选修了《周易与中国文化》这节有名的通识课程，还未开课，室友便开始自己研究起了八卦的奥秘。 一天晚上，Banlk 看见正在研究卦象的室友眼中闪过一道精光，突然站起身来，头也不回地朝阳台上走去。只见
2017-12-18 11:17:43
1010
原创 POJ 1753 Flip Game （枚举或高斯消元）
Flip GameTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 48244 Accepted: 20555DescriptionFlip game is played on a rectangular 4x4 fiel
2017-12-16 17:56:14
365
原创 ZOJ 1008 Gnome Tetravex （使用状态进行DFS）
Gnome TetravexTime Limit: 10 Seconds Memory Limit: 32768 KB Hart is engaged in playing an interesting game, Gnome Tetravex, these days. In the game, at the beginning, the player is give
2017-12-15 13:06:10
332
原创 ZOJ 1004 Anagrams by Stack （DFS 注意栈！）
Anagrams by StackTime Limit: 2 Seconds Memory Limit: 65536 KB How can anagrams result from sequences of stack operations? There are two sequences of stack operators which can convert TR
2017-12-14 22:49:15
467
1原创 基于twist加密法的代码实现
#include#include using namespace std;int k,n;char o[10000];int A[10000],B[10000];int key[10000];int num=0;int choose;void twist(){ memset(A,0,sizeof(A)); memset(B,0,sizeof(B));n=-1; freo
2017-12-14 17:04:11
444
原创 ZOJ 1006 Do the Untwist
Cryptography deals with methods of secret communication that transform a message (theplaintext) into a disguised form (the ciphertext) so that no one seeing the ciphertext will be able to figure out
2017-12-13 23:18:32
210
原创 ZOJ 1005 Jugs （演绎推理）
JugsTime Limit: 2 Seconds Memory Limit: 65536 KB Special Judge In the movie "Die Hard 3", Bruce Willis and Samuel L. Jackson were confronted with the following puzzle. They were gi
2017-12-13 22:39:28
325
原创 ZOJ 1003 Crashing Balloon （DFS）
Crashing BalloonTime Limit: 2 Seconds Memory Limit: 65536 KB On every June 1st, the Children's Day, there will be a game named "crashing balloon" on TV. The rule is very simple. On t
2017-12-13 22:38:30
290
原创 ZOJ 1002 firenet （ DFS）
Fire NetTime Limit: 2 Seconds Memory Limit: 65536 KB Suppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each represen
2017-12-13 22:32:03
293
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人