razrlele
git指定ssh密钥文件
在ssh到服务器上的时候可以可以通过-i参数来指定登录密钥，有的时候git也会有这种需求，但是git本身没有自带-i参数，Google一番过后发现可以用脚本来解决。
Python2.7处理中文utf8 json数据
在Python 2.7里面字符编码似乎是一个很令人烦躁的问题，最近在处理抓取的数据时候碰到了一些问题，在这里记录一下：
Some gifts
因为自己的所有书籍已经实现了电子化，然后一些书籍实在是不方便携带，所以现在决定把一些我觉得价值比较高的书送给学弟学妹（或者学长学姐）们。之前也送过一些书给学弟学妹们，但是送完总有一丝空虚寂寞，这一次还是搞点有意思的比较好。
在Windows上安装Ubuntu虚拟机并部署C\C++编译环境
本文面向新手，内容极其简单，老司机大可直接跳过。 在VMware下安装Ubuntu 14.04 准备好Ubuntu ISO镜像 新建虚拟机
static in C/C++
在C和C++语言当中都有static关键字，C语言中的功能C++全部都有，除此之外static关键字在C++的类中还有一些其他的功能。
Sorting in Python
Simple implementation of five common sorting algorithm in Python. Bubble Sort Python 12345678910111213
Linux下压缩PDF的大小
刚才在写简历保存为PDF的时候吓了一跳，只有一页半的PDF却有17MB大小！不知道是不是用Chrome调了边距的原因。 无论如何都得想办法压缩一下，Google了一下，先是尝试用了imagemagic，然而无论是转换成PNG图片还是直接压缩最后都会影响清晰图，最后在Ask Ubuntu上找到了解决方案 ：
POJ1006
POJ1006 Biorhythms Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 124772 Accepted: 39392 Description Some people believe that there are three cycles in a person’s life that start the day he or she is born. These three cycles are the physical, emotional, and intellectual cycles, and they have periods of lengths 23, 28, and 33 days, respectively. There is one peak in each period of a cycle. At the peak of a cycle, a person performs at his or her best in the corresponding field (physical, emotional or mental). For example, if it is the mental curve, thought processes will be sharper and concentration will be easier.
POJ1458
POJ1458 Common Subsequence Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 44778 Accepted: 18346 Description A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = < x1, x2, …, xm > another sequence Z = < z1, z2, …, zk > is a subsequence of X if there exists a strictly increasing sequence < i1, i2, …, ik > of indices of X such that for all j = 1,2,…,k, xij = zj. For example, Z = < a, b, f, c > is a subsequence of X = < a, b, c, f, b, c > with index sequence < 1, 2, 4, 6 >. Given two sequences X and Y the problem is to find the length of the maximum-length common subsequence of X and Y.