I need to write a recursive Java program to count the number of muck-free regions in a lagoon. The Lagoon is represented by a rectangle of N x M squares. Each square contains either muck ('M') or sand ('.'). A region is defined as a connected set of one of more squares with sand in it, where a square is considered to connect to all eight of its adjacent squares. Sample input/output is shown in picture attached Input FormatThe first line consists of two space-separated integers: N and M (1 <= N<= 100; 1 <= M <=100). The remaining N lines consist of M characters each. Each character is either 'M' or '.'representing one square in IRL. The characters do not have spaces between them.SAMPLE INPUT10 12. MMMMMMMM..MМ...МММММ...MMMM..MMM..MМMМMMMMMM..ММMMMMMMMM.MМMM. MMMMMM. MMМ.М.МММMM..М.М.М.МММММ.ММ.М.МMMMMМ.МMM. MMMMMMM.MSAMPLE OUTPUTThe number of muck free spots in the input:3One spot is in the upper left, one down the right side, and the third one is spread out n thelower left corner.

I need to write a recursive Java program to count the number of muck-free regions in a lagoon. The Lagoon is represented by a rectangle of N x M squares. Each square contains either muck ('M') or sand ('.'). A region is defined as a connected set of one of more squares with sand in it, where a square is considered to connect to all eight of its adjacent squares. Sample input/output is shown in picture attached

I need to write a recursive Java program to count the number of muck-free regions in a lagoon. The Lagoon is represented by a rectangle of N x M squares. Each square contains either muck ('M') or sand ('.'). A region is defined as a connected set of one of more squares with sand in it, where a square is considered to connect to all eight of its adjacent squares. Sample input/output is shown in picture attached

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter7: Arrays

Section: Chapter Questions

Problem 7PP: (Numerical) Using the srand() and rand() C++ library functions, fill an array of 1000 floating-point...

See similar textbooks

Similar questions

Using function strtod(), Create a character string that contains the following string: “78.3% is the average success rate” Divide this string into double and display the rest of the string The output will be: The original string is: 78.3% is the average success rate The extracted double value is: 78.3 The remainder of the string is: % is the average success rate
Input The first line of the input contains two integers n and m separated by a single space. n denotes the number of Dan's students and m denotes the number of events. The second line contains n letters separated by single spaces. The i-th letter is either "A" or "B". If it's "A", the i-th student is initially in group A; Otherwise, the i-th student is initially in group B. The next m lines describe the events in chronological order. Each line describes a single event. If a line starts with the string cite, two integers x and y follow, indicating that student x has published a paper in which they cite student y's work. Otherwise, the line starts with the string change, which is followed by a single integer x. This indicates that Dan has changed student x's group. Output Print two integers separated by a single space. These should indicate the final citation scores of groups A and B, respectively. Sample Input 1 65 AABBBB cite 1 3. cite 1 2 change 1 cite 2 1 cite 4 2 Sample Output 1 6…
F3 R1 F2 R2 The wheel shown is free to rotate around a fixed axis which passes from its central point. Three strings are tied to the wheel and pulled, which results in the forces shown on the figure. The moment of inertia of the wheel is I. Data: 0.6 m, R1 = 0.3 m, F, R2 10 kg m2 F Find the angular acceleration a of the wheel along the indicated direction. 20.0 N 30.0 N, F3 10.0 N, rad/s? Check
PYTHON PROGRAMMING Chess Moves Mapper using Shortest path algorithm As the title indicates, you will need to determine the number of moves it will take for the different chess pieces from their current position to any other tile in the board. While a standard chess board will have an 8 x 8 grid chess board, your code should be able to handle boards of different dimensions. For this program the board will be blank. The only piece will be the one inputted. Input Format s1, s2, x1, y1, piece All inputs end with a '\n' s1, s2 - horizontal size and vertical size of the board respectively. x1, y1 - starting position of the piece. Refer to Figure 3. for coordinate convention piece - name of the piece. Use the following names. [pawn, rook, knight, bishop, queen, king] Given the initial starting position of a given piece, you will be asked to determine the minimum number of moves needed to reach any position in the tile. A sample setup is shown below as well as a visualization of the…
please help me. Truth table: Form a Truth Table that has 4 inputs and 4 outputs. The heading of the table should look like this: a2 a1 b2 b1 out4 out3 out2 out1 The table should have 16 rows, corresponding to the 16 different input patterns. Input value a2 corresponds to the left bit of a 2-bit number called a; a1 is the right bit of a. b2 and b1 are the left and right bits of a second 2-bit number called b. The output bits out4 through out1 represent the binary version of the product of a and b -- out4 is the left-most bit of the product, out1 is the right-most bit, etc.Boolean Expression: Form a Boolean Expression for each of the output columns in your table, using the techniques seen in class. You must have 4 separate Boolean Expressions for this part; one each for out1, out2, out3, and out4. Each of your Boolean Expressions should have as many terms (the things being "added" together) as there are 1's in the column for that output bit. Circuit Designs: Create a Logic…
Max Number Budi, Anto and Hani are playing a game called Max Number. Budi will ask Anto to say N numbers to put into a bag and also ask Hani to say M numbers and remove that number from the bag and next they will find the maximum number from the bag. Format InputThe first line contains two integers N stating total numbers that will be stored into bag and M stating the total numbers that want to be removed from the bag. The second lines contains N numbers that will be stored into the bag. The third lines contains M numbers that want to be removed from the bag. Format OutputOutput with a format “Maximum number is X”, where X is the maximum number in the bag. If no numbers in the bag, the application will give an output “Maximum number is -1” Constraints• 1 ≤ N ≤ 100• 1 ≤ M ≤ N• 1 ≤ numbers ≤ 999 Sample Input 1 (standard input)10 399 20 10 8 99 4 9 93 66 5599 94 10 Sample Output 1 (standard output)Maximum number is 93 Use C Language.
Transcribed Image Text Create a program that allows the user to do some basic functions. First, ask the user if they would like to find out sqrt, log or factorial of a number, then return the results. Here is the sample output: Welcome to the simple math helper. What would you like to calculate? 1. Sqrt 2. Log 3. Factorial > 1 Enter the number to sqrt: >9
Transcribed Image Text Write a loop that displays all possible combinations of two letters where the letters are 'a', or 'b', or 'c', or 'd', or 'e'. The combinations should be displayed in ascending alphabetical order: aa ab ас ad ae ba bb .. ee
A character array representing a string can be input with scanf and the below conversion specifier. %p b. %d a. C. %C O d. %S
(Numerical) Using the srand() and rand() C++ library functions, fill an array of 1000 floating-point numbers with random numbers that have been scaled to the range 1 to 100. Then determine and display the number of random numbers having values between 1 and 50 and the number having values greater than 50. What do you expect the output counts to be?
Python only Write a program in python language to display information about user inputs. Each column occupies 15 spaces. Given the date of birth is November 24th, 1992,Abbreviated format: each column is in the left alignment, and the dob is displayed as 24/Nov/1992.Normal format: each column is in the center alignment, and the dob is displayed as 24-11-1992 .Format other than entering "A" and "N": the first two columns are in the center alignment, the last column is in the left alignment, and the dob is displayed as 1992-11-24.The program must use if-else statements and string format.The program must work exactly like the following examples. For example: Input Result John Smith 24-11-1992 A Enter your first name: John Enter your last name: Smith Enter your dob (DD-MM-YYYY): 24-11-1992 Choose a format: (A)bbreviated (N)ormal: A First Name Last Name Date of Birth John Smith 24/Nov/1992 John Smith 24-11-1992 N Enter your first name: John Enter your last name: Smith Enter…
character = '*' # The character to print size = 7 # The number of rows and columns # Iterate over the rows. for row in range(size): # Each row has fewer columns. for col in range(size, row, -1): print(character, end='') # Go to the next row. print() modify code to output following pattern * ** *** **** ***** ****** *******