寻找那些珍贵的回忆--网页历史记录（快照）查询
转眼间就2018年了，明天就是除夕了。想想在13年前开始接触计算机，用和楼下公用的0.5Mbps的电话线拨号上网，长城牌子的电脑，大屁股显示器，这十多年科技的发展真是快啊...突然想到能不能找回童年的回忆........遂猎奇到了一个很不错的网站，可以 ...
PAT-A 真题- 1013. Battle Over Cities
原题干：It is vitally important to have all the cities connected by highways in a war. If a city is occupied by the enemy, all the highways from/toward that city are closed. We must know immediately if we need to repair any other ...
C语言缓冲区溢出原理与实践
我们都听说过缓冲区漏洞，那么具体原理是怎样的呢？首先我们看这个例子：#include<stdio.h> int main(){ int i=0; int a[]={1,2,3,4,5,6,7,8,9,10}; for(i=0;i<=11;i++){ printf("Hello World!\n", ...
PAT-A 真题- 1034. Head of a Gang
原题干：One way that the police finds the head of a gang is to check people's phone calls. If there is a phone call between A and B, we say that A and B is related. The weight of a relation is defined to be the total time len ...
数据结构-使用广度优先搜索和深度优先搜索遍历图
图的遍历指的是：对图中所有顶点按照一定的顺序进行访问。访问的方法一般分为两种：DFS (深度优先) 和 BFS (广度优先) 。0x00、深度优先搜索（DFS）遍历图的基本思路深度优先，前面在走迷宫的那篇文章已经介绍过，特征是沿着一条路一直向前走。直 ...