I need help starting this program in C 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 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 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.
I need help starting this program in C
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 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 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.
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
