摘要：
Problem DescriptionAs this term is going to end, DRD needs to prepare for his final exams.DRD hasnexams. They are all hard, but their difficulties are... 阅读全文
摘要：
Problem DescriptionMike does not want others to view his messages, so he find a encode method Base64.Here is an example of the note in Chinese Passpor... 阅读全文
摘要：
1.hust上面两套树形DP2.hust上面两套区间DP3.学习哈希，巩固kmp，多刷几道熟悉4.刷hdu上面Dynamic Programming专题以及search专题5.学习二分图，网络流（√ ×）6.看大白书，把入门经典小白书例题刷一遍7.orz不知道什么时候能否刷完~~想到什么了再补充，在... 阅读全文
摘要：
Two soldiers are playing a game. At the beginning first of them chooses a positive integernand gives it to the second soldier. Then the second one tri... 阅读全文
摘要：
Two bored soldiers are playing card war. Their card deck consists of exactlyncards, numbered from1ton,all values are different. They divide cards betw... 阅读全文
摘要：
Colonel hasnbadges. He wants to give one badge to every of hisnsoldiers. Each badge has acoolness factor, which shows how much it's owner reached. Coo... 阅读全文
摘要：
Problem Description列变位法是古典密码算法中变位加密的一种方法，具体过程如下 将明文字符分割成个数固定的分组（如5个一组，5即为密钥），按一组一行的次序整齐排列，最后不足一组不放置任何字符，完成后按列读取即成密文。比如：原文：123456789密钥：4变换后的矩阵：12345678... 阅读全文
摘要：
Problem Description当今世界，网络已经无处不在了，小度熊由于犯了错误，当上了度度公司的网络管理员，他手上有大量的 IP列表，小度熊想知道在某个固定的子网掩码下，有多少个网络地址。网络地址等于子网掩码与 IP 地址按位进行与运算后的结果，例如：子网掩码：A.B.C.DIP 地址：a.... 阅读全文
摘要：
Problem Description近期B厂组织了一次大搬家，所有人都要按照指示换到指定的座位上。指示的内容是坐在位置i上的人要搬到位置j上。现在B厂有N个人，一对一到N个位置上。搬家之后也是一一对应的，改变的只有位次。在第一次搬家后，度度熊由于疏忽，又要求大家按照原指示进行了一次搬家。于是，机智... 阅读全文
摘要：
Problem DescriptionJGShining's kingdom consists of 2n(n is no more than 500,000) small cities which are located in two parallel lines.Half of these ci... 阅读全文