X marks the spot! Arr! Did you think that just because we’re pirates, we wouldn’t ask the Coding Hero for help? That’s discrimination! I have a map here that leads to a lot of treasures and I need your help to get them. Every treasure is hidden underground but the surface is marked with an X. To dig up the treasure, I need N number of sailors to dig it up, and the bigger the X, the bigger the treasure, and the more sailors (N) I need to dig it up! I need to know how big of an X I can dig up if I bring N number of men with me so I can optimize the split of the treasure. By the way, N can only be greater than 3 and it can only be an odd integer. You better do it quickly or you’ll be sleeping with the fishes! Inputs 1. Number of sailors The value is >= 3 and is odd Sample Output Enter the number of sailors: 3 * * * * * * * * *

X marks the spot! Arr! Did you think that just because we’re pirates, we wouldn’t ask the Coding Hero for help? That’s discrimination! I have a map here that leads to a lot of treasures and I need your help to get them. Every treasure is hidden underground but the surface is marked with an X. To dig up the treasure, I need N number of sailors to dig it up, and the bigger the X, the bigger the treasure, and the more sailors (N) I need to dig it up! I need to know how big of an X I can dig up if I bring N number of men with me so I can optimize the split of the treasure. By the way, N can only be greater than 3 and it can only be an odd integer. You better do it quickly or you’ll be sleeping with the fishes! Inputs 1. Number of sailors The value is >= 3 and is odd Sample Output Enter the number of sailors: 3 * * * * * * * * *

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter9: Advanced Array Concepts

Section: Chapter Questions

Problem 1GZ

See similar textbooks

Similar questions

Jojo, Lili and Bibi are playing together. Because they had just learned the alphabet, Jojo also proposed a game using the alphabet to hone and deepen their abilities. The game is a game of changing strings. Initially Jojo has an X string. The X string will be changed through several processes given by Jojo. The process is changing an alphabet Ai to Bi. Each alphabet can only be changed once. After all processes take place. Jojo just wants to find out how many characters Bi are in the string X. If the alphabet does not appear in the string, the character does not need to be displayed. The alphabet displayed must be ordered by alphabet. Lili and Bibi want to do it, but they doubt their answer, for that they ask for your help to make an answer for the Jojo game. Format Input The input will consist of several lines of input in ”testdata.in” file. First consists of T, the number of test cases. For each testcase consists of several lines. The first line consists of the X string, Jojo’s…
with T=4, n=12 and A=(3,5,8,8,9,16,29,41,50,63,64,67). Draw the corresponding walkthrough as shown
Mini-Case Google’s PageRank: Google’s PageRank is an algorithm that attempts to inform you where people are coming from when they land on your website and which sources are the most frequent. Note that, as its name suggests, a page rank is an index estimated page by page; it’s not an overall website assessment. Think of the Internet as a big network (duh), where the links aren’t all equal. Just as with people, some of your connections are “more important” (in achieving whatever goals) than others. With clickstreams, if you’re getting a lot of web traffic, is it coming from somewhere impressive like Amazon or from Joe’s-Shoes-and-Tshirts.com? The algorithm weights the more important (more connected) links more than the less important (less connected) links. Say you’re trying to determine the rank of your home page. You figure that’s a good start, and customers can navigate more precisely once they’re in your domain. The ranking model begins by checking all the incoming links to the…
You have an infinite number of 4 types of lego blocks of sizes given as (depth x height x width): dhw111112113114 Using these blocks, you want to make a wall of height and width . Features of the wall are:- The wall should not have any holes in it.- The wall you build should be one solid structure, so there should not be a straight vertical break across all rows of bricks.- The bricks must be laid horizontally. How many ways can the wall be built? Example The height is and the width is . Here are some configurations: These are not all of the valid permutations. There are valid permutations in all. Function Description Complete the legoBlocks function in the editor below. legoBlocks has the following parameter(s): int n: the height of the wall int m: the width of the wall Returns- int: the number of valid wall formations modulo Input Format The first line contains the number of test cases . Each of the next lines contains two space-separated integers and .…
Please look at attached photos. It needs to pass all of the simulations. Thanks in advance Cryptography is the practice of encryption. Information Security uses cryptography techniques to encrypt and decrypt data. A simple encryption method might take plaintext and mix up the letters using some predetermined pattern and then use that pattern to decrypt the data for reading. Ciphers are the algorithms used to put the data into its secret pattern and then systematically decrypt it for reading. This script is going to use a famous simple cipher called the Caesar Cipher. It is a substitution cipher where each letter in the text is 'shifted' in a certain number of places. It uses the alphabet as the primary pattern and then based on the shift number, it would shift all the letters and replace the alphabet with our pattern. For example, if our shift number was 3, then A would be replaced with D, if we performed a right shift. As an example: Text = "THE CAT IS VISIBLE AT MIDNIGHT" Ciphertext…
A school has been selling raffle tickets to raise funds for the school library. Each ticket is sold for $5,and the school has sold many such tickets. Each ticket has a code. When a ticket is presented at thelibrary book sale, it can be redeemed for $1, $5, or $10. The dollar amount being assigned to each ticketis determined by a lottery before the book sale. Heidi is wondering whether the school is actually losing money out of the raffle.(a) Formulate the null and alternative hypotheses that can be used to determine whether the school islosing money out of the raffle. Note that the issue is whether the school is losing money, not whetherthe school is breaking even. Please think about what the implication is when formulating the null andalternative hypotheses
There are three (3) poles with blocks of two different colours. The colours are labelled as A and B. There are three (3) blocks for each colour, which make up to a total of six (6) blocks. A block has to always be on a pole. When removing a block from a pole, the top block will be removed first. After the removal, the block must be placed onto another pole and become the top block of the new pole. Each pole can only hold three (3) blocks maximum. The initial arrangement of the pole and blocks are shown in Figure 2. A B A A B B Figure 2: Initial arrangement of blocks on poles You are tasked to find the solution to place the blocks with the same colour onto the same pole with the least number of movement. a) Describe the differences between breadth-first search and uniform- cost search and determine which of them is more suitable to accom- plish the task. State the reason of the selection. b) Using the search algorithm that has been selected in (a) to find the solution. Specify the…
You are given an instance of a problem where you have an n x n grid of squares. Each square can be unpainted or can have a hole, so you cannot go on the square with a hole. The objective is to paint all the squares that do not have a hole. You start in the square (0,0) which is unpainted. The actions you can do are: (1) paint the square you are on if it is not painted; (2) move, either vertically or horizontally, to an adjacent square inside the grid that is not painted and does not have a hole. a. Describe a state-space representation for the problem, specifying the state representation, the initial state, the goal condition, and the actions. b. Is the state space finite? Is it a tree or a graph? c. Propose a heuristic for the problem. Is your heuristics admissible or not? Explain briefly your answer
There is a legend about a magical park with N × N trees. The trees are positioned in a square grid with Nrows (numbered from 1 to N from north to south) and N columns (numbered from 1 to N from west to east).The height (in metres) of each tree is an integer between 1 and N × N, inclusive. Magically, the height ofall trees is unique.Bunga is standing on the northmost point of the park and wants to count the number of visible trees for eachcolumn. Similarly, Lestari is standing on the westmost point of the park and wants to count the number ofvisible trees for each row. A tree X is visible if all other trees in front of the tree X are shorter than the treeX.For example, let N = 3 and the height (in metres) of the trees are as follows.6 1 87 5 32 9 4• On the first column, Bunga can see two trees, as the tree on the third row is obstructed by the othertrees.• On the second column, Bunga can see all three trees.• On the third column, Bunga can see only the tree on the first row, as the…
In cpp Room contains nx n cubes (in rows and in columns). Each cube is white or black. You can get out of a white cube by going in one of the four directions horizontally or vertically (but you can't go outside the room). You can enter a black cube, but you can't exit it. There is a mouse and a piece of cheese in the room. The mouse is in a cube (0,0) - white, and the cheese in a cube (n-1, n-1) - black. The mouse can move from cube to cube according to the rules described above. Write a program that finds all the ways in which the mouse can move to the cheese, and if any, display it with ‘*’.
Blue-Eyed Island: A bunch of people are living on an island, when a visitor comes with a strangeorder: all blue-eyed people must leave the island as soon as possible. There will be a flight out at8:00pm every evening. Each person can see everyone else's eye color, but they do not know theirown (nor is anyone allowed to tell them). Additionally, they do not know how many people haveblue eyes, although they do know that at least one person does. How many days will it take theblue-eyed people to leave?
PLEASE WRITE LEGIBLY! 1-Using Sage, create an elliptic curve with parameters a = 21 and b =10 and modulo 337 2- What is the order of the curve? 3- print the first 10 points in the curve 4- Plot all the point on the elliptic curve