Feedback | If you notice incorrect translations in Contester, please let author know.
|
|
Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb. Question by Rei Koleci.
Word Search Game
The goal is to make a nXn matrix (n can be 100) where random words from English language are hidden.
The words can be positioned in many directions of reading:
- Left to right
- Right to left
- Up to down
- Down to Up
- NotPerpendicular StartLeftEndRight (Left to right)
- NotPerpendicual StartLeftEndRight (Right to left)
- NotPerpendicular StartRightEndLeft (Left to right)
- NotPerpendicual StartLeftEndRight (Right to left)
There can be m hidden words. and the matrix is square nxn
(e.g. 5 words in 100x100 matrix). each word with a random position.
Check if the programme is correct by printing the words
coordinates and position type on screen.
Для отправки решений необходимо выполнить вход.
|