#C1352. Counting Safe Strings
Counting Safe Strings
Counting Safe Strings
You are given a collection of strings. Your task is to count the number of strings that do not contain any of the forbidden substrings: \(\texttt{cat}\), \(\texttt{dog}\), or \(\texttt{bird}\). For each string provided, if none of these substrings appear anywhere in the string, it is considered safe. Print the total count of such safe strings.
Input Constraints: The first line contains a non-negative integer \(n\) representing the number of strings. Each of the following \(n\) lines contains a non-empty string (which can possibly be empty) to be evaluated.
Output: A single integer which is the count of safe strings.
inputFormat
The input is read from standard input (stdin) and has the following format:
n s1 s2 ... sn
Where \(n\) is an integer representing the number of strings, and each \(s_i\) is one string.
outputFormat
Print a single integer on standard output (stdout) that represents the number of strings that do not contain any of the forbidden substrings: "cat", "dog", or "bird".
## sample3
hello
world
python
3