Just run

摘要： Flip Sort Sorting in computer science is an important part. Almost every problem can be solved effeciently if sorted data are found. There are some excellent sorting algorithm which has already ... 阅读全文

摘要： Your task is to write a program that can decide whether you can find an arithmetic expression consisting of five given numbers (1 {1,2,3,4,5} is a bijective functionand {+,-,*} (1#include#include#inc... 阅读全文

摘要： Getting in Line Computer networking requires that the computers in the network be linked. This problem considers a ``linear" network in which the computers are chained together so that each is... 阅读全文

摘要： A few things to remember while coding in Python. - 17 May 2012 - UPDATE: There has been much discussion in Hacker News about this article. A few corrections from it. ... 阅读全文

摘要： 浅谈尾递归 2013-02-10 14:12:57 在《数据结构与算法分析：C描述》（Data Structures and Algorithm Analysis In C）的第三章中，以打印链表为例，提到了尾递归（tail recursion）并指出了尾递归是使用递归极其不当的例子，它指出虽然编译器会对尾递归自动优化，但即便如此最好还是不要去写尾递归。而我在《算法精解：C语言描述》（Mast... 阅读全文

摘要： Bandwidth Given a graph (V,E) where V is a set of nodes and E is a set of arcs in VxV, and an ordering on the elements in V, then the bandwidth of a node v is defined as the maximum distance in ... 阅读全文

摘要： 7.4.3困难的串 学习点：dfs加入返回值，递归搜索过程中如果有一个成功，就直接退出 //7.4.3 困难的串#include#include#include#include#includeusing namespace std;int n,L;int cnt;char v[81];bool judge(int cur){ for(int i=1;i>n>>L) { ... 阅读全文

摘要： 题意：八皇后问题的扩展。8*8棋盘上每个格子都有一个整数，要求8个皇后所在格子的数字之后最大 解法一，回溯： 用vis数组记录 列，主对角（y-x）， 副对角（y+x） 访问情况 #include#include#include#include#includeusing namespace std;int C[50], vis[3][50], tot = 0, n = 8, nc... 阅读全文

摘要： http://www.matrix67.com/blog/archives/263 位运算简介及实用技巧（一）：基础篇 去年年底写的关于位运算的日志是这个Blog里少数大受欢迎的文章之一，很多人都希望我能不断完善那篇文章。后来我看到了不少其它的资料，学习到了更多关于位运算的知识，有了重新整理位运算技巧的想法。从今天起我就开始写这一系列位运算讲解文章，与其说是原来那篇文章的follow-... 阅读全文

摘要： // Rujia Liu // 题意：给出n个带权集合，每个集合包含1~9中的三个整数。找出其中三个集合，使得1~9恰好各出现一次，且权和最大 // 算法：暴力n^2枚举前两个集合，直接计算出第三个集合。用位运算让代码更简单，速度也更快 学习点： 1、全集ALL为(1#include#includeusing namespace std;const int maxn = 1000 +... 阅读全文