11 2017 档案

摘要:It is said that in 2013, there were about 100 graduate schools ready to proceed over 40,000 applications in Zhejiang Province. It would help a lot if 阅读全文
posted @ 2017-11-30 11:14 gaoren 阅读(207) 评论(0) 推荐(0)
摘要:A supply chain is a network of retailers(零售商), distributors(经销商), and suppliers(供应商)-- everyone involved in moving a product from supplier to customer 阅读全文
posted @ 2017-11-29 19:56 gaoren 阅读(1235) 评论(0) 推荐(2)
摘要:The task of this problem is simple: insert a sequence of distinct positive integers into a hash table, and output the positions of the input numbers. 阅读全文
posted @ 2017-11-28 21:24 gaoren 阅读(200) 评论(0) 推荐(0)
摘要:The ranklist of PAT is generated from the status list, which shows the scores of the submittions. This time you are supposed to generate the ranklist 阅读全文
posted @ 2017-11-27 21:24 gaoren 阅读(186) 评论(0) 推荐(0)
摘要:KVM定制OpenStack云主机 如何定制化OpenStack云主机?从去年10月份刚开始接触OpenStack,到现在也有一年了。虽说目前只是停留在用它,对它的一些组件简单的了解,但谈到制作出一个OpenStack云主机的镜像还真不会。今年年初因为一个比赛需要给云主机安装tomcat、ssh等服 阅读全文
posted @ 2017-11-26 11:12 gaoren 阅读(12874) 评论(0) 推荐(0)
摘要:14.04的系统默认是没有tun设备的,所以需要通过在内核中编译时勾选此设备。接下来分步来介绍如何安装tun设备。 一、更新ubuntu桌面版源: 二、编译内核源码(保证你的虚拟机存储够大,本文的虚拟机分配80G): 1、编译前准备,安装必要依赖: 2、通过如下链接下载内核版本: 3、将下载好的内核 阅读全文
posted @ 2017-11-25 17:17 gaoren 阅读(4786) 评论(1) 推荐(0)
摘要:On a broken keyboard, some of the keys are worn out. So when you type some sentences, the characters corresponding to those keys will not appear on sc 阅读全文
posted @ 2017-11-24 20:23 gaoren 阅读(234) 评论(0) 推荐(0)
摘要:Given N rational numbers in the form "numerator/denominator", you are supposed to calculate their sum. Input Specification: Each input file contains o 阅读全文
posted @ 2017-11-23 20:34 gaoren 阅读(285) 评论(0) 推荐(0)
摘要:Given a non-empty tree with root R, and with weight Wi assigned to each tree node Ti. The weight of a path from R to Lis defined to be the sum of the 阅读全文
posted @ 2017-11-21 18:50 gaoren 阅读(255) 评论(0) 推荐(0)
摘要:People often have a preference among synonyms of the same word. For example, some may prefer "the police", while others may prefer "the cops". Analyzi 阅读全文
posted @ 2017-11-20 17:19 gaoren 阅读(258) 评论(0) 推荐(0)
摘要:An AVL tree is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any 阅读全文
posted @ 2017-11-19 19:07 gaoren 阅读(183) 评论(0) 推荐(0)
摘要:Mooncake is a Chinese bakery product traditionally eaten during the Mid-Autumn Festival. Many types of fillings and crusts can be found in traditional 阅读全文
posted @ 2017-11-18 10:44 gaoren 阅读(212) 评论(0) 推荐(0)
摘要:Stack is one of the most fundamental data structures, which is based on the principle of Last In First Out (LIFO). The basic operations include Push ( 阅读全文
posted @ 2017-11-17 16:15 gaoren 阅读(184) 评论(0) 推荐(0)
摘要:For any 4-digit integer except the ones with all the digits being the same, if we sort the digits in non-increasing order first, and then in non-decre 阅读全文
posted @ 2017-11-16 21:40 gaoren 阅读(239) 评论(0) 推荐(0)
摘要:A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties: The left subtree of a node contains only nodes 阅读全文
posted @ 2017-11-15 17:58 gaoren 阅读(242) 评论(0) 推荐(0)
摘要:Given two sets of integers, the similarity of the sets is defined to be Nc/Nt*100%, where Nc is the number of distinct common numbers shared by the tw 阅读全文
posted @ 2017-11-14 19:14 gaoren 阅读(232) 评论(0) 推荐(0)
摘要:About 900 years ago, a Chinese philosopher Sima Guang wrote a history book in which he talked about people's talent and virtue. According to his theor 阅读全文
posted @ 2017-11-13 19:13 gaoren 阅读(157) 评论(0) 推荐(0)
摘要:Sherlock Holmes received a note with some strange strings: "Let's date! 3485djDkxh4hhGE 2984akDfkkkkggEdsb s&hgsfdk d&Hyscvnm". It took him only a min 阅读全文
posted @ 2017-11-12 11:40 gaoren 阅读(152) 评论(0) 推荐(0)
摘要:If a machine can save only 3 significant digits, the float numbers 12300 and 12358.9 are considered equal since they are both saved as 0.123*105 with 阅读全文
posted @ 2017-11-11 12:37 gaoren 阅读(214) 评论(0) 推荐(0)
摘要:Given any positive integer N, you are supposed to find all of its prime factors, and write them in the format N = p1^k1 * p2^k2 *…*pm^km. Input Specif 阅读全文
posted @ 2017-11-10 09:19 gaoren 阅读(180) 评论(0) 推荐(0)
摘要:Mice and Rice is the name of a programming contest in which each programmer must write a piece of code to control the movements of a mouse in a given 阅读全文
posted @ 2017-11-09 11:00 gaoren 阅读(437) 评论(0) 推荐(0)
摘要:The task is simple: given any positive integer N, you are supposed to count the total number of 1's in the decimal form of the integers from 1 to N. F 阅读全文
posted @ 2017-11-08 09:45 gaoren 阅读(149) 评论(0) 推荐(0)
摘要:Forbes magazine publishes every year its list of billionaires based on the annual ranking of the world's wealthiest people. Now you are supposed to si 阅读全文
posted @ 2017-11-07 19:36 gaoren 阅读(226) 评论(0) 推荐(0)
摘要:Behind the scenes in the computer's memory, color is always talked about as a series of 24 bits of information for each pixel. In an image, the color 阅读全文
posted @ 2017-11-06 17:36 gaoren 阅读(215) 评论(0) 推荐(0)
摘要:一、报文结构介绍 在开始讲TCP连接过程时,还是先看看TCP报文的格式如图1所示。IP数据报此时由IP头部+TCP头部+TCP数据组成。不带选项的TCP头部是20字节长,而带选项的,TCP头部最长可达60字节。常见的选项包括最大的大小(MSS),时间戳(传输控制时使用)、窗口缩放(流量控制时使用)、 阅读全文
posted @ 2017-11-05 19:14 gaoren 阅读(10815) 评论(0) 推荐(0)
摘要:A linked list consists of a series of structures, which are not necessarily adjacent in memory. We assume that each structure contains an integer key 阅读全文
posted @ 2017-11-05 09:59 gaoren 阅读(256) 评论(0) 推荐(0)
摘要:Given a stack which can keep M numbers at most. Push N numbers in the order of 1, 2, 3, ..., N and pop randomly. You are supposed to tell if a given s 阅读全文
posted @ 2017-11-04 14:46 gaoren 阅读(145) 评论(0) 推荐(0)
摘要:Eva loves to collect coins from all over the universe, including some other planets like Mars. One day she visited a universal shopping mall which cou 阅读全文
posted @ 2017-11-03 09:46 gaoren 阅读(129) 评论(0) 推荐(0)
摘要:Shopping in Mars is quite a different experience. The Mars people pay by chained diamonds. Each diamond has a value (in Mars dollars M$). When making 阅读全文
posted @ 2017-11-02 12:09 gaoren 阅读(222) 评论(0) 推荐(0)
摘要:A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties: The left subtree of a node contains only nodes 阅读全文
posted @ 2017-11-01 10:46 gaoren 阅读(315) 评论(0) 推荐(0)