Part III: Searching & Sorting Q6: Find DOG from a given text, the text appears to be involving an alphabet with only the three characters D, O, and G. Find out how many times DOG appears in the text. We doesn't mind if there are other characters interspersed within DOG, only that the characters appear in the correct order. We also doesn't mind if different occurrences of DOG share some letters. For instance, DOG appears once in DGOG, twice in DDOG, and eight times in DDOOGG. Given the text of the inscription, please count how many times DOG appears. INPUT FORMAT: (file cow.in) The first line of input consists of a single integer N. The second line contains of a string of N characters, where each character is either a D, O, or G. OUTPUT FORMAT: (file cow.out) Output the number of times DOG appears as a subsequence, not necessarily contiguous, of the input string. SAMPLE INPUT 1: 6. DOOGGG SAMPLE OUTPUT 1: 6 SAMPLE INPUT 2: DDOOGG SAMPLE OUTPUT 2: SAMPLE INPUT 3: wwwoOC SAMPLE OUTPUT 3: SAMPLE INPUT 4: 12 COWCOWCOWCOW SAMPLE OUTPUT 4: 20 SAMPLE INPUT 5: 55 СССССССССССОООООООООOOWWWWWWWWWWWO0ОООООООООССССССССССС SAMPLE OUTPUT 5: 1331
Part III: Searching & Sorting Q6: Find DOG from a given text, the text appears to be involving an alphabet with only the three characters D, O, and G. Find out how many times DOG appears in the text. We doesn't mind if there are other characters interspersed within DOG, only that the characters appear in the correct order. We also doesn't mind if different occurrences of DOG share some letters. For instance, DOG appears once in DGOG, twice in DDOG, and eight times in DDOOGG. Given the text of the inscription, please count how many times DOG appears. INPUT FORMAT: (file cow.in) The first line of input consists of a single integer N. The second line contains of a string of N characters, where each character is either a D, O, or G. OUTPUT FORMAT: (file cow.out) Output the number of times DOG appears as a subsequence, not necessarily contiguous, of the input string. SAMPLE INPUT 1: 6. DOOGGG SAMPLE OUTPUT 1: 6 SAMPLE INPUT 2: DDOOGG SAMPLE OUTPUT 2: SAMPLE INPUT 3: wwwoOC SAMPLE OUTPUT 3: SAMPLE INPUT 4: 12 COWCOWCOWCOW SAMPLE OUTPUT 4: 20 SAMPLE INPUT 5: 55 СССССССССССОООООООООOOWWWWWWWWWWWO0ОООООООООССССССССССС SAMPLE OUTPUT 5: 1331
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...
Related questions
Question
help with c++...paste indented codes plzz and keep output same
![Part IlI: Searching & Sorting
Q6: Find DOG from a given text, the text appears to be involving an alphabet with only the three
characters D, O, and G. Find out how many times DOG appears in the text.
We doesn't mind if there are other characters interspersed within DOG, only that the characters appear in
the correct order. We also doesn't mind if different occurrences of DOG share some letters. For instance,
DOG appears once in DGOG, twice in DDOG, and eight times in DDOOGG. Given the text of the
inscription, please count how many times DOG appears.
INPUT FORMAT: (file cow.in)
The first line of input consists of a single integer N. The second line contains of a string of N characters,
where each character is either a D, O, or G.
OUTPUT FORMAT: (file cow.out)
Output the number of times DOG appears as a subseque
string.
not necessarily contiguous, of the input
SAMPLE INPUT 1:
DOOGGG
SAMPLE OUTPUT 1:
SAMPLE INPUT 2:
6
DDOOGG
SAMPLE OUTPUT 2:
8
SAMPLE INPUT 3:
6.
wwWOOC
SAMPLE OUTPUT 3:
SAMPLE INPUT 4:
12
COWCOWCOWCOW
SAMPLE OUTPUT 4:
20
SAMPLE INPUT 5:
55
CcccccccCcco0000000o00owwwwwwwwwwwo0000000000cccccccccCC
SAMPLE OUTPUT 5:
1331](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F2e5285d1-26cf-4a1e-96cd-981b45538097%2F4ac3fe1b-eeeb-48a9-916f-8882fdfcaed5%2Fmvey7jb_processed.png&w=3840&q=75)
Transcribed Image Text:Part IlI: Searching & Sorting
Q6: Find DOG from a given text, the text appears to be involving an alphabet with only the three
characters D, O, and G. Find out how many times DOG appears in the text.
We doesn't mind if there are other characters interspersed within DOG, only that the characters appear in
the correct order. We also doesn't mind if different occurrences of DOG share some letters. For instance,
DOG appears once in DGOG, twice in DDOG, and eight times in DDOOGG. Given the text of the
inscription, please count how many times DOG appears.
INPUT FORMAT: (file cow.in)
The first line of input consists of a single integer N. The second line contains of a string of N characters,
where each character is either a D, O, or G.
OUTPUT FORMAT: (file cow.out)
Output the number of times DOG appears as a subseque
string.
not necessarily contiguous, of the input
SAMPLE INPUT 1:
DOOGGG
SAMPLE OUTPUT 1:
SAMPLE INPUT 2:
6
DDOOGG
SAMPLE OUTPUT 2:
8
SAMPLE INPUT 3:
6.
wwWOOC
SAMPLE OUTPUT 3:
SAMPLE INPUT 4:
12
COWCOWCOWCOW
SAMPLE OUTPUT 4:
20
SAMPLE INPUT 5:
55
CcccccccCcco0000000o00owwwwwwwwwwwo0000000000cccccccccCC
SAMPLE OUTPUT 5:
1331
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps with 2 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
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…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
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)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
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…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
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)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
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](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY