Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
have There are N guarding posts on the Great Wall of China. However, not all the guards. We call a wall between two posts protected if the posts on each end have guards. posts Write that gives the count of protected walls. a program Input The first line of the standard input contains the count of guarding posts (1

have There are N guarding posts on the Great Wall of China. However, not all the guards. We call a wall between two posts protected if the posts on each end have guards. posts Write that gives the count of protected walls. a program Input The first line of the standard input contains the count of guarding posts (1

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question

On C++

Protected Walls There are N guarding posts on the Great Wall of China. However, not all the posts have guards. We call a wall between two posts protected if the posts on each end have guards. Write a program that gives the count of protected walls. Input The first line of the standard input contains the count of guarding posts (1<N<100). The next N lines contains a number describing the posts: if there are no guards at a post, it is 0, if there are guards at a post, it is 1. Output The first line of the standard output should contain the count of protected walls. Example Input Output 12 4 1 1 1 1 1 1 1 Limits Time limit: 0.1 second Memory limit: 32 MB Evaluation: In 40% of tests, the count of data is <20
Transcribed Image Text:Protected Walls There are N guarding posts on the Great Wall of China. However, not all the posts have guards. We call a wall between two posts protected if the posts on each end have guards. Write a program that gives the count of protected walls. Input The first line of the standard input contains the count of guarding posts (1<N<100). The next N lines contains a number describing the posts: if there are no guards at a post, it is 0, if there are guards at a post, it is 1. Output The first line of the standard output should contain the count of protected walls. Example Input Output 12 4 1 1 1 1 1 1 1 Limits Time limit: 0.1 second Memory limit: 32 MB Evaluation: In 40% of tests, the count of data is <20
Expert Solution
steps

Step by step

Solved in 3 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS