10 2016 档案
摘要：要求~ 我的工具~（随便搞搞就好了，自己的录音还没弄~）
阅读全文
摘要：SQL Server 下载 SSMS-Setup-CHS https://msdn.microsoft.com/zh-cn/library/mt238290.aspx 第1：打开，点开setup.exe 第2：点安装~，点第一个选择后（已经提前安装过2016，以2008为例子），寻找安装媒体 第3：
阅读全文
摘要：Description You are given a table consisting of n rows and m columns. Numbers in each row form a permutation of integers from 1 to m. You are allowed
阅读全文
摘要：Description You are given names of two days of the week. Please, determine whether it is possible that during some non-leap year the first day of some
阅读全文
摘要：Description Polycarp is a music editor at the radio station. He received a playlist for tomorrow, that can be represented as a sequence a1, a2, ..., a
阅读全文
摘要：链接http://acm.hdu.edu.cn/showproblem.php?pid=5929 题意：给你一种数据结构以及操作，和一种位运算，最后询问：从‘栈’顶到低的运算顺序结果是多少 解法：根据位运算，发现出现0，结果就是1，那么就记录两端0的位置就好，中间不管出现什么，结果大部分都是1，考虑
阅读全文
摘要：链接http://acm.hdu.edu.cn/showproblem.php?pid=5926 题意：给我们一个矩阵，问你根据连连看的玩法可以消去其中的元素 解法：连连看怎么玩，就怎么写，别忘记边界
阅读全文
摘要：链接http://acm.hdu.edu.cn/showproblem.php?pid=5924 题意：根据公式求C，D 解法：打表找规律
阅读全文
摘要：链接http://acm.hdu.edu.cn/showproblem.php?pid=5922 题意：最小生成树，但边的权值是连接两点的最小公倍数 解法：不要真的写最小生成树啦，只要其他点和第一点相连，边的权值就是最小的，相加就好了
阅读全文
摘要：Description The map of Berland is a rectangle of the size n × m, which consists of cells of size 1 × 1. Each cell is either land or water. The map is
阅读全文
摘要：Description Modern text editors usually show some information regarding the document being edited. For example, the number of words, the number of pag
阅读全文
摘要：Description There are three friend living on the straight line Ox in Lineland. The first friend lives at the point x1, the second friend lives at the
阅读全文
