摘要:
View Code1#include<iostream>2#include<cstdio>3usingnamespacestd;4intarr[1100],vis[1100];5intn,num;6voidbfs(intx)7{8if(x>n)9{10num++;11/*for(inti=1;i<=n;i++)//输出每一个错排12printf("%d",arr[i]);13printf("\n");*/14return;15}16for(inti=1;i<=n;i++)17{18if(vis[i]==0& 阅读全文