hdu 杭电 1016 Prime Ring Problem
摘要:
ac代码:View Code #include<iostream>using namespace std;int map[61];int use[21];int ss[22];int n;void dfs(int i){ if(i==n&&map[ss[i-1]+1]==0) { for(int l=0;l<n-1;l++) cout<<ss[l]<<" "; cout<<ss[n-1]<<endl; } else { for(int j=2;j<=n;j++) { ... 阅读全文
posted @ 2012-09-01 09:30 果枫-国峰 阅读(137) 评论(0) 推荐(0) 编辑