Problem Given a list of newline-separated park sections and an animal pattern (as a letter sequence), find out how many times the pattern occurs in each park section. Input Input will begin with a line containing 2 tokens, S and N (1 ≤ |S| ≤ 20; 1 ≤N≤100,000), representing the target animal pattern and the number of sections to process respectively. All characters in S will be either upper or lower case latin letters. The following N lines will contain a sequence of characters representing a scanned section of the park. Each park section will contain at most 100,000 characters (letters and spaces; not including the new line at the end of the line). Output Output should contain N lines. Each line will contain a single integer representing the number of occurrences of the letter sequence for the given section. NOTE: You do not need to wait to print out the numbers. You can print the number after each line of input.
Problem Given a list of newline-separated park sections and an animal pattern (as a letter sequence), find out how many times the pattern occurs in each park section. Input Input will begin with a line containing 2 tokens, S and N (1 ≤ |S| ≤ 20; 1 ≤N≤100,000), representing the target animal pattern and the number of sections to process respectively. All characters in S will be either upper or lower case latin letters. The following N lines will contain a sequence of characters representing a scanned section of the park. Each park section will contain at most 100,000 characters (letters and spaces; not including the new line at the end of the line). Output Output should contain N lines. Each line will contain a single integer representing the number of occurrences of the letter sequence for the given section. NOTE: You do not need to wait to print out the numbers. You can print the number after each line of input.
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
I need help coding this in C using strings.

Transcribed Image Text:Problem
Given a list of
newline-separated park sections and an animal pattern (as a letter sequence), find out how
many times the pattern occurs in each park section.
Input
Input will begin with a line containing 2 tokens, S and N (1 ≤ |S| ≤ 20; 1 ≤N≤100,000), representing the
target animal pattern and the number of sections to process respectively. All characters in S will be either
upper or lower case latin letters. The following N lines will contain a sequence of characters representing
a scanned section of the park. Each park section will contain at most 100,000 characters (letters and
spaces; not including the new line at the end of the line).
Output
Output should contain N lines. Each line will contain a single integer representing the number of
occurrences of the letter sequence for the given section. NOTE: You do not need to wait to print out the
numbers. You can print the number after each line of input.

Transcribed Image Text:Sample Input
99 4
qxq
99Р 99РРАРq
9 9
abc 999
Sample Output
O NON
2
2
HO
1
hello 2
HELLO hello Hello WORLD world World 0
olleh
Expert Solution

Step 1
Your C program is given below as you required with an output.
Step by step
Solved in 3 steps with 2 images

Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you

Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON

Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning

Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education