深度优先遍历
摘要:求n个数的所有排列组合。#include "stdafx.h"#include int a[10], book[10], n;void dfs(int step){ int i; if(step == n+1) { for (i = 0; i<=n; i++) ...
阅读全文
posted @ 2015-07-09 21:35
posted @ 2015-07-09 21:35
posted @ 2014-10-12 21:10
人形时钟