Ada King | ADAKING | CodeChef


Chef Ada is training her calculation skills. She wants to place a King and some obstacles on a chessboard in such a way that the number of distinct cells the king can reach is exactly K.
Recall that a chessboard has 8 rows (numbered 1 through 8) and 8 columns (numbered 1 through 8); let's denote a cell in row r and column c by (r,c).
In one move, a king can move to any adjacent cell which shares a side or corner with its current cell and does not contain an obstacle. More formally, a king in a cell (r,c) can move to any cell (rn,cn) if (rn,cn) is a valid cell of the chessboard which does not contain an obstacle and (r−rn)2+(c−cn)2≤2.
A cell (x,y) can be reached by a king if, after an arbitrary number of moves (including zero), the king is in the cell (x,y).
Help Ada find any valid configuration of the board such that the king can reach exactly K distinct cells. It is guaranteed that such a configuration always exists. If there are multiple solutions, you may find any one.

Input

  • The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows.
  • The first and only line of each test case contains a single integer K.

Output

For each test case, print 8 lines describing a chessboard, each containing 8 characters. For each valid i and j, the j-th character on the i-th line should be one of the following:
  • 'O' if the cell (i,j) initially contains the king; there should be exactly one such cell
  • 'X' if the cell (i,j) contains an obstacle
  • '.' if the cell (i,j) is empty

Constraints

  • 1≤T≤64
  • 1≤K≤64

Subtasks

Subtask #1 (10 points): K≤8
Subtask #2 (90 points): original constraints

Example Input

4
1
5
9
64

Example Output

........
........
........
.XXX....
.XOX....
.XXX....
........
........

........
........
........
........
........
XXX.....
..XX....
O..X....

........
.XXXXXXX
.X.O...X
.X...XXX
.XXX.X..
...XXX..
........
........

........
........
........
...O....
........
........
........
........

Explanation

The descriptions of the chessboard for each test case are separated by blank lines for clarity. Note that these lines should not appear on the output of your submission.
Example case 1: The king is surrounded by obstacles, so it cannot move ― the only cell it can reach is its initial cell.
Example case 4: The king can visit all cells of the board.

Solution (C++)

  #include <bits/stdc++.h>
using namespace std;

int main() {
// your code goes here
int t;
cin>>t;
while(t--)
{
    int k;
    cin>>k;
    char arr[8][8];

    k=k-1;
    for(int i=0; i<8; i++)
    {
        for(int j=0; j<8; j++)
        {
            if(i==0 && j==0)
                    arr[i][j]='O';
                else
                    arr[i][j]='.';
        }
    }
    int count=0,flag=0,tem=0;
    for(int i=0; i<8; i++)
    {
        for(int j=0; j<8; j++)
        {
            if(arr[i][j]=='.')
            count++;
            if(count==k)
            {
                    if(j!=7)
                    tem=j+1;
                    if(j==7)
                        tem=7;
                    if(k>7)
                    {
                       while(j!=7)
                       {
                           arr[i][j+1]='X';
                            j++;
                       }
                    }
                    else if(j<7)
                        arr[i][j+1]='X';
                    break;
            }
        }
        if(count==k)
        {
            for(int p=0;p<=tem;p++)
            arr[i+1][p]='X';
            flag=1;
        }
        if(flag==1)
         break;
    }
    for(int i=0; i<8; i++)
    {
        for(int j=0; j<8; j++)
        {
            cout<<arr[i][j];
        }
        cout<<endl;
    }
   
    
}
return 0;
}

Comments

Post a Comment

Popular posts from this blog

Boxes through a Tunnel | HackerRank

You are transporting some boxes through a tunnel, where each box is a  parallelepiped , and is characterized by its length, width and height. The height of the tunnel   feet and the width can be assumed to be infinite. A box can be carried through the tunnel only if its height is strictly less than the tunnel's height. Find the volume of each box that can be successfully transported to the other end of the tunnel. Note: Boxes cannot be rotated. Input Format The first line contains a single integer  , denoting the number of boxes.  lines follow with three integers on each separated by single spaces    ,   and   which are length, width and height in feet of the  -th box. Constraints Output Format For every box from the input which has a height lesser than   feet, print its volume in a separate line. Sample Input 0 4 5 5 5 1 2 40 10 5 41 7 2 42 Sample ...
Read more

Array Manipulation | HackerRank

Image
Starting with a 1-indexed array of zeros and a list of operations, for each operation add a value to each of the array element between two given indices, inclusive. Once all operations have been performed, return the maximum value in your array. For example, the length of your array of zeros  . Your list of queries is as follows: a b k 1 5 3 4 8 7 6 9 1 Add the values of   between the indices   and   inclusive: index -> 1 2 3 4 5 6 7 8 9 10 [ 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 ] [ 3 , 3 , 3 , 3 , 3 , 0 , 0 , 0 , 0 , 0 ] [ 3 , 3 , 3 , 10 , 10 , 7 , 7 , 7 , 0 , 0 ] [ 3 , 3 , 3 , 10 , 10 , 8 , 8 , 8 , 1 , 0 ] The largest value is   after all operations are performed. Function Description Complete the function  arrayManipulation  in the editor below. It must return an integer, the maximum value in the resulting array. arrayManipulation has the fo...
Read more

String Validators | HackerRank

Python has built-in string validation methods for basic data. It can check if a string is composed of alphabetical characters, alphanumeric characters, digits, etc. str.isalnum() This method checks if all the characters of a string are alphanumeric  (a-z, A-Z and 0-9) . >>> print 'ab123'.isalnum() True >>> print 'ab123#'.isalnum() False str.isalpha() This method checks if all the characters of a string are alphabetical  (a-z and A-Z) . >>> print 'abcD'.isalpha() True >>> print 'abcd1'.isalpha() False str.isdigit() This method checks if all the characters of a string are digits  (0-9) . >>> print '1234'.isdigit() True >>> print '123edsd'.isdigit() False str.islower() This method checks if all the characters of a string are lowercase characters  (a-z) . >>> print 'abcd123#'.islower() True >>> print 'Abcd123#'.islower() False str....
Read more