Longest wall section without protection There are N guarding posts on the Great Wall of China. However, not all of the spots have guards. We define a protected wall as a wall which has guards on both ends. Write a program that gives the length of the longest wall section without protected walls. Input The first line of the standard input contains the count of guarding posts (1≤N≤100). The next N lines contain the description of each posts: if the value is 0, there are no guards on this post, if it is 1, there are. Output The first line of the standard output should contain the the length of the longest wall section without protected walls.

Longest wall section without protection There are N guarding posts on the Great Wall of China. However, not all of the spots have guards. We define a protected wall as a wall which has guards on both ends. Write a program that gives the length of the longest wall section without protected walls. Input The first line of the standard input contains the count of guarding posts (1≤N≤100). The next N lines contain the description of each posts: if the value is 0, there are no guards on this post, if it is 1, there are. Output The first line of the standard output should contain the the length of the longest wall section without protected walls.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 20PE

See similar textbooks

Similar questions

this task in C# thank you very much.
How to write this program in C#
On C++
Problem A Coconut Splat Coconut Splat is one of Theta's favorite counting-out games. It goes like this: initially, all players stand in a circle with their hands folded together (like an intact coconut). In clockwise order, one player touches the hands of the other players and says the rhyme: "Co-co- nut, Co-co-nut, Co-co-nut, Splat!" At each syllable, the player touches a hand, and the player whose hand or hands is touched last takes one of the following actions: Source: WikiMedia • If the player's hands are still folded, they are split into two fists (the coconut is cracked in two halves). The next round starts with the fist that is the first half of the coconut, then the second half, then going to the next player. If a fist is touched last, the hand is turned palm down (the milk spills out). The next round starts with the next hand in clockwise order, which could be the other hand of the same player, or it could be the hand or folded hands belonging to the next player. • If a hand…
Write a program that accepts a set of integer numbers. Your program should count the number of even numbers and find the maximum even. Use -1 to stop your data entry. Sample Input/ Output: Enter integer numbers, Use -1 to stop your data entry. 12 33 66 -1 There are 2 even numbers. The maximum even number is 66.
Write a program that asks the user to enter an integer number and checks whether the number is prime or not. Hint: A prime number (2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37 . . . ) is a natural number greater than 1 that has no positive divisors other than 1 and itself. To check if a number N is prime, divide it in a loop from 2 to N-1 for remainder. If remainder is never 0, then N is prime. For example, 23 and 47 are prime, but 12 and 27 are not.
in C# thank you.
Imagine if the survey contained two sheets in the same book. Perhaps sheet 1 isshoes and sheet 2 is dresses.The work now doubles.What about more than two sheets?You get the picture. This needs some sort of automation.Write ALGORITHM FOR MERGING SHEETS
Write a program that uses random function to randomly generate 6 integers between 0 and 99 with 0 and 99 included. Save them in a Bag. Ask a user to make a guess. If the user’s guess is one of the numbers in the Bag, then give user 10 points and remove the number from the Bag. Allow the user to make 10 attempts. Each time give user 10 points if the number user guess is in the Bag. If the Bag is getting emptied before the user reach 10 attempts, then give user an additional 200 points and terminate the program (Game is over!). If the Bag is not empty after the user use up all 10 attempts, then display the user’s score and terminate the program (Game is over!). **Note** I am having trouble figuring out the 10 attempts and random numbers part of the program.
Write a program that reads two points on a line, calculates the slope, and determines whether the slope is positive, negative, zero, or undefined. Run your program for the following pairs of points: a. (-2, 1) and (2, 3) b. (4,1) and (4,3)
Write a program that draws line segments using the arrow keys. The line starts from (100, 100) in the pane and draws toward east, north, west, or south when the right-arrow key, uparrow key, leftarrow key, or downarrow key is pressed, as shown in Figure 15.28b.
Write a program that takes as input an arithmetic expression. The program outputs whether the expression contains matching grouping symbols. For example, the arithmetic expressions {25 + (3 – 6) * 8} and 7 + 8 * 2 contains matching grouping symbols. However, the expression 5 + {(13 + 7) / 8 - 2 * 9 does not contain matching grouping symbols.