#include #include using namespace std; //Compiler version g++ 6.3.0 //Suggestions needed on this code for improvement //input a positive no. /*The code prints the the position of the knight (according to the rules mentioned in the challenge) where it had been from position 1 to your input no.*/ int a[50][50],r=25,c=24,n=50,m=50; int knight(int a[][50],int i) { int s[8]={3200,3200,3200,3200,3200,3200,3200,3200}; if(i==0) { return a[r][c]; } else { if(r-2>0) { if(c+10&&a[r-2][c-1]!=0)//upleft s[1]=a[r-2][c-1]; } if(c-2>0) { if(r-1>0&&a[r-1][c-2]!=0)//leftup s[2]=a[r-1][c-2]; if(r+10&&a[r+2][c-1]!=0)//downleft s[4]=a[r+2][c-1]; if(c+10&&a[r-1][c+2]!=0)//rightup s[7]=a[r-1][c+2]; } sort(s,s+8); if(s[0]==a[r-2][c+1]) { r-=2; c+=1; a[r][c]=0; } else if(s[0]==a[r-2][c-1]) { r-=2; c-=1; a[r][c]=0; } else if(s[0]==a[r-1][c-2]) { r-=1; c-=2; a[r][c]=0; } else if(s[0]==a[r+1][c-2]) { r+=1; c-=2; a[r][c]=0; } else if(s[0]==a[r+2][c-1]) { r+=2; c-=1; a[r][c]=0; } else if(s[0]==a[r+2][c+1]) { r+=2; c+=1; a[r][c]=0; } else if(s[0]==a[r+1][c+2]) { r+=1; c+=2; a[r][c]=0; } else if(s[0]==a[r-1][c+2]) { r-=1; c+=2; a[r][c]=0; } } return s[0]; } int main() { int j=0,k=0,f=1,pos; cin>>pos; for(int i=0;i0 && a[j][k-1]==0) k--; else f++; } if(f==4) { if(j>0 && a[j-1][k]==0) j--; else { f=1; k++; } } } cout<<"{"; for(int i=0;i

Knight's Spiral (challenge #37)