2016年12月_ukiy

原创哈弗曼编/译码项目(可解压缩文本,可执行文件,png,jpg类图片)

全部代码github链接哈夫曼编码原理我这里就不讲了，这里主要谈谈项目思路或者我碰到的问题：文件有个一个叫文件头的东西，这个东西在压缩图片呀什么的不能漏了，文本文件没有文件头，可以不管，不同的文件格式有不同的文件头. 文件头百度百科所以在压缩图片时要先读取文件头那么问题来了给了一个文件，要把它压要另一个压缩文件，压缩文件里

2016-12-29 12:37:34 402

原创 linux下超好用的词典.(goldendict)

linux下之前用有道或者谷歌在线翻译,还是嫌麻烦,google发现在linux还有一个超好用的词典goldendict . 安装和使用

2016-12-04 17:38:08 17269 2

原创百练 4116 拯救行动(bfs)

描述公主被恶人抓走，被关押在牢房的某个地方。牢房用N*M (N, M <= 200)的矩阵来表示。矩阵中的每项可以代表道路（@）、墙壁（#）、和守卫（x）。英勇的骑士（r）决定孤身一人去拯救公主（a）。我们假设拯救成功的表示是“骑士到达了公主所在的位置”。由于在通往公主所在位置的道路中可能遇到守卫，骑士一旦遇到守卫，必须杀死守卫才能继续前进。现假设骑士可以向上、下、左、右四个方向移动，每移动一个

2016-12-04 02:01:11 1303

原创 poj 3984 迷宫问题

Description 定义一个二维数组：int maze[5][5] = {0, 1, 0, 0, 0,0, 1, 0, 1, 0,0, 0, 0, 0, 0,0, 1, 1, 1, 0,0, 0, 0, 1, 0,};它表示一个迷宫，其中的1表示墙壁，0表示可以走的路，只能横着走或竖着走，不能斜着走，要求编程序找出从左上角到右下角的最短路线。Input 一个5 × 5的二维数组，表示一个迷

2016-12-03 22:15:39 347

DescriptionFarmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000) on a number line and the cow is at a point K (0 ≤

2016-12-03 19:49:22 278

原创 hdu 1253 胜利大逃亡(dfs+剪枝)

Problem Description Ignatius被魔王抓走了,有一天魔王出差去了,这可是Ignatius逃亡的好机会.魔王住在一个城堡里,城堡是一个A*B*C的立方体,可以被表示成A个B*C的矩阵,刚开始Ignatius被关在(0,0,0)的位置,离开城堡的门在(A-1,B-1,C-1)的位置,现在知道魔王将在T分钟后回到城堡,Ignatius每分钟能从一个坐标走到相邻的六个坐标中的其中一

2016-12-03 18:42:18 440

原创 hdu1242 Rescue （dfs+剪枝）

Problem Description Angel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M <= 200) matrix. There are WALLs, ROADs, and GUARDs in the prison.Angel’s

2016-12-03 10:49:09 348

原创 hdu 1072 Nightmare dfs+剪枝

Problem Description Ignatius had a nightmare last night. He found himself in a labyrinth with a time bomb on him. The labyrinth has an exit, Ignatius should get out of the labyrinth before the bomb ex

2016-12-03 10:39:43 271

原创 Ubuntu 内核源码安装

sudo apt-get install linux-source然后到/usr/src/ 找到已下载好的软件包，把他复制到home目录下,如图然后解压tar xjf linux-source-4.4.0.tar.bz2 //具体软件包可能不同在当前目录下可以查看内核源码了.

2016-12-03 03:04:52 697

原创 poj 1002 487-3279

Description Businesses like to have memorable telephone numbers. One way to make a telephone number memorable is to have it spell a memorable word or phrase. For example, you can call the University o

2016-12-03 00:43:26 339

原创 hdu 1197 Specialized Four-Digit Numbers

Description Find and list all four-digit numbers in decimal notation that have the property that the sum of its four digits equals the sum of its digits when represented in hexadecimal (base 16) notat

2016-12-02 22:23:08 342

原创 hdu 1048 The Hardest Problem Ever

Description Julius Caesar lived in a time of danger and intrigue. The hardest situation Caesar ever faced was keeping himself alive. In order for him to survive, he decided to create one of the first

2016-12-02 22:21:11 356

原创 poj 2209 The King

Description Once upon a time in a country far away lived a king and he had a big kingdom. He was a very clever king but he had one weakness – he could count only up to three. Nevertheless, he did not

2016-12-02 22:18:45 446

原创 hdu1312 Red and Black

Problem Description There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adjacen

2016-12-02 14:20:52 371

原创 poj2017 Speed Limit

Description Bill and Ted are taking a road trip. But the odometer in their car is broken, so they don’t know how many miles they have driven. Fortunately, Bill has a working stopwatch, so they can rec

2016-12-01 21:41:56 436

原创 POJ1862 Stripies

Description Our chemical biologists have invented a new very useful form of life called stripies (in fact, they were first called in Russian - polosatiki, but the scientists had to invent an English n

2016-12-01 21:35:57 314

原创 hdu 1241 Oil Deposits

Problem Description The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a

2016-12-01 10:44:11 798

原创 hdu1010 Tempter of the Bone(dfs+剪枝)

Problem Description The doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could feel the ground sinking. He rea

2016-12-01 08:47:02 352

原创蓝桥杯习题(基础练习)

基础练习闰年判断时间限制：1.0s 内存限制：256.0MB问题描述给定一个年份，判断这一年是不是闰年。当以下情况之一满足时，这一年是闰年：年份是4的倍数而不是100的倍数；年份是400的倍数。其他的年份都不是闰年。输入格式输入包含一个整数y，表示当前的年份。输出格式输出一行，如果给定的年份是闰年，则输出yes，否则输出no。说明：当试题指定你输出一个字符串作为结果（

2016-12-01 01:40:55 932

原创蓝桥杯习题(入门训练)

入门训练 Fibonacci数列时间限制：1.0s 内存限制：256.0MB问题描述Fibonacci数列的递推公式为：Fn=Fn-1+Fn-2，其中F1=F2=1。当n比较大时，Fn也非常大，现在我们想知道，Fn除以10007的余数是多少。输入格式输入包含一个整数n。输出格式输出一行，包含一个整数，表示Fn除以10007的余数。说明：在本题中，答案是要求Fn除以10007的

2016-12-01 00:28:18 727