2015年5月17日
zstu4026——DFS+回溯——八皇后
摘要： Description在n*n(1 #include#includeusing namespace std;int tot,n;int c[100];int vis[100];int path[100];bool flag; void dfs(int cur){ if(cur == n + 1... 阅读全文
posted @ 2015-05-17 20:26 Painting、时光 阅读(390) 评论(0) 推荐(0)
BestCoder Round #41 1001——ZCC loves straight flush
摘要： Problem DescriptionAfter losing all his chips when playing Texas Hold'em with Fsygd on the way to ZJOI2015, ZCC has just learned a black technology. N... 阅读全文
posted @ 2015-05-17 20:14 Painting、时光 阅读(221) 评论(0) 推荐(0)