1997 Canadian Computing Competition, Stage 1
Problem A: Sentences
Write a program which accepts as input a list of subjects, a list of verbs, and a list of objects, and produces all possible sentences which consist of a subject, a verb, and an object.
The first line of the input file contains a positive integer n which is the number of data sets which follow. For each of the n data sets, the data begins with three positive integers, one per line, each less than or equal to 20, which represent the number of subjects, verbs, and objects, respectively, which are provided. Following this line are the subjects, one per line in alphabetical order, the verbs, one per line in alphabetical order, and the objects, one per line in alphabetical order. The maximum length of any subject, predicate or object is 25 characters.
The output is to consist of all possible sentences which can be formed using one subject, one verb, and one object, and is to be output in alphabetical order with a period at the end of each sentence. The output for different data sets are to be separated by a single blank line.
1 3 3 2 He The cat The dog bit kicked saw him the mouse
He bit him. He bit the mouse. He kicked him. He kicked the mouse. He saw him. He saw the mouse. The cat bit him. The cat bit the mouse. The cat kicked him. The cat kicked the mouse. The cat saw him. The cat saw the mouse. The dog bit him. The dog bit the mouse. The dog kicked him. The dog kicked the mouse. The dog saw him. The dog saw the mouse.
Point Value: 5
Time Limit: 2.00s
Memory Limit: 16M
Added: Sep 28, 2008
- String Manipulation
C++03, PAS, C, HASK, ASM, RUBY, PYTH2, JAVA, PHP, SCM, CAML, PERL, C#, C++11, PYTH3