n queens problem which can print the chess board pattern

				#include
				#include
				#include
				int n,x[10]={0};
				int place(int k,int i);
				int place(int k,int i)
				{
					for(int j=1;j					{
					 if(x[j]==i||(abs(x[j]-i)==abs(j-k)))
						return 0;
					}
					return 1;
				}
				void nqueens(int k,int n)
				{
					 for(int i=1;i					 {
						if(place(k,i))
						{
							x[k]=i;
							if(k==n) return;
							else nqueens(k+1,n);
						}
					 }
				}
				void main()
				{
					clrscr();
					cout					cin>>n;
					nqueens(1,n);
					for(int k=1;k					{
					       if(x[k]!=0)
						cout					}
					getch();
				}