global count count=0 q=[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0] def place(i,j): if(i==1): return True k=1 while(k<i): if(q[k]==j or (abs(q[k]-j)==abs(i-k))): return False k=k+1 return True def queen(i,n): if(i>n): global count count=count+1 return else: for j in range(1,n+1): if(place(i,j)): q[i]=j queen(i+1,n) def main(): n=eval(input("")); queen(1,n); print(count) main() |
python的n皇后
最新推荐文章于 2024-07-30 17:23:09 发布