Word
면접 대비시간 제한1초메모리 제한1024 MB
격자에서 여덟 방향으로 곧게 읽었을 때 "word"가 나타나는 횟수를 센다. 앞뒤 양방향을 모두 포함한다.
문제
Word searches are hard. Luckily, you're a programmer, so you can just write a program to find the words! Fortunately, the word searches that you are doing are only looking for one word, and that word is "word". Write a program that finds the number of instances of the word "word" in a word search.
입력
The first line will contain a single integer n that indicates the number of data sets that follow. Each data set will start with two integers, r c with r being the number of rows and c being the number of columns, respectively. The next r lines will contain c random letters, creating a word search grid.
출력
Output the number of times that the word "word" appears in the word search. The letters can be going in any direction, including backwards.