Knowee
Questions
Features
Study Tools

Your password cracking abilities were greatly appreciated by Chhota Bheem. Just as he wasabout to induct you into his team, he got a call from his friend Perry the Platypus. This was quitealarming, because Perry hardly speaks - a phone call is only in emergency situations.Perry has an important password to crack. Unfortunately, his arch-enemy has hidden thispassword in a 2D grid of size N x N:These are the instructions given to you by Perry:1. The highlighted parts above are the generators. The rest of the grid is not useful, onlythe generators are. The generators are found by starting from bottom left corner, movingto middle of first row and then going to the bottom right corner again. All the whileskipping one element. Refer to above image.2. Thus, you will have N generators3. You have to collect the N generators, and form a string. Each generator corresponds toan alphabet4. The alphabet is obtained by from each generator. The number 1 corresponds to a, 2 to band so on...5. If we get a number above 26, we will start assigning from a again. So 27 becomes a, 28is b and so on...6. Combine the each of the alphabets and the resultant is your answerThus, in the above case, we get the following N generators:13 10 23 18 44 22 2, which translate into: mjwrrvbExplanation: 13 -> m, 10 -> j, 23 -> w, 18 -> r, 44 -> 18 -> r,22 -> v, 2 -> bGiven an N and a grid, you must help Perry find the password.Note: N is always odd and greater than 1. All numbers in the grid are greater than 0.Input formatThe first line contains T, the number of test cases. Following T lines contain:N and N, the size of the 2D grid. This is followed by N x N numbers in a single lineOutput formatPrint each password in a single line

Question

Your password cracking abilities were greatly appreciated by Chhota Bheem. Just as he wasabout to induct you into his team, he got a call from his friend Perry the Platypus. This was quitealarming, because Perry hardly speaks - a phone call is only in emergency situations.Perry has an important password to crack. Unfortunately, his arch-enemy has hidden thispassword in a 2D grid of size N x N:These are the instructions given to you by Perry:1. The highlighted parts above are the generators. The rest of the grid is not useful, onlythe generators are. The generators are found by starting from bottom left corner, movingto middle of first row and then going to the bottom right corner again. All the whileskipping one element. Refer to above image.2. Thus, you will have N generators3. You have to collect the N generators, and form a string. Each generator corresponds toan alphabet4. The alphabet is obtained by from each generator. The number 1 corresponds to a, 2 to band so on...5. If we get a number above 26, we will start assigning from a again. So 27 becomes a, 28is b and so on...6. Combine the each of the alphabets and the resultant is your answerThus, in the above case, we get the following N generators:13 10 23 18 44 22 2, which translate into: mjwrrvbExplanation: 13 -> m, 10 -> j, 23 -> w, 18 -> r, 44 -> 18 -> r,22 -> v, 2 -> bGiven an N and a grid, you must help Perry find the password.Note: N is always odd and greater than 1. All numbers in the grid are greater than 0.Input formatThe first line contains T, the number of test cases. Following T lines contain:N and N, the size of the 2D grid. This is followed by N x N numbers in a single lineOutput formatPrint each password in a single line

...expand
🧐 Not the exact question you are looking for?Go ask a question

Solution

To find the password, we need to follow the given instructions step by step:

  1. Start from the bottom left corner of the grid.
  2. Move to the middle of the first row.
  3. Continue moving to the bottom right corner, skipping one element each time.
  4. Collect the N generators (highlighted parts) along this path.
  5. Each generator corresponds to an alphabet, starting from 'a' for 1, 'b' for 2, and so on.
  6. If the number exceeds 26, start assigning alphabets from 'a' again.
  7. Combine the alphabets from each generator to form the password.

Let's go through an example to understand the process:

Given the grid: 13 10 23 18 44 22 2

  1. Start from the bottom left corner: 2.
  2. Move to the middle of the first row: 18.
  3. Move to the bottom right corner: 22.
  4. Collect the generators: 2, 18, 22.
  5. Convert the generators to alphabets: 2 -> 'b', 18 -> 'r', 22 -> 'v'.
  6. Combine the alphabets: 'brv'.
  7. The password is 'brv'.

Repeat this process for each test case and print the password for each case in a single line.

This problem has been solved

Similar Questions

What is a default kali linux tool to crack a password

A network administrator is conducting a training session to office staff on how to create a strong and effective password. Which password would most likely take the longest for a malicious user to guess or break?Select one:drninjaphd10charactersmk$$cittykat104#super3secret2password1

• An organization suspects that an employee's password has been compromised. Which tool can theyuse to attempt password recovery?• John The Ripper• Hydra• Rainbow Table Cracking• Cracking Office Files

A programme that generates passwords using the commonly used word, number, and character combinations. To test those combinations, it relies on raw computing power.Select one:Traffic interceptionMan in the middlePhishingBrute force attack

A network administrator is conducting a training session to office staff on how to create a strong and effective password. Which password would most likely take the longest for a malicious user to guess or break?Question 9Select one:mk$$cittykat104#10charactersdrninjaphdsuper3secret2password1

1/1

Upgrade your grade with Knowee

Get personalized homework help. Review tough concepts in more detail, or go deeper into your topic by exploring other relevant questions.