User Tools

Site Tools


prelude_to_doublets

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision
Previous revision
prelude_to_doublets [2011/09/05 11:49] jtkorbprelude_to_doublets [2011/09/06 13:00] (current) jtkorb
Line 5: Line 5:
 ===== Input ===== ===== Input =====
  
-Like Doublets, the input consists of a dictionary of words, one per line, followed by pairs of words, one per line.  The dictionary and word pairs are separated by a blank line and there is a blank line after the last pair of words.+Like Doublets, the input consists of a dictionary of words, one per line, followed by pairs of words, one per line.  The dictionary and word pairs are separated by an empty line.
  
 ===== Output ===== ===== Output =====
  
-For each line of input, print "set" if the integers form a complete set from smallest to largest without duplicates; otherwise print "not a set".+Print the number of words in the dictionary, in the format below.  For each line of input words, print the words "yesor "no" (separated by a space) indicating if the corresponding word is in the dictionary or not.  Separate each case by blank line (there is no blank line before the first case or after the last case). 
 + 
 +NEXT TIME: The number of words in the dictionary should be the number of *unique* words.
  
 ===== Sample Input ===== ===== Sample Input =====
Line 24: Line 26:
 booster roasted booster roasted
 coastal postal coastal postal
 +rooster fooster
 </code> </code>
  
prelude_to_doublets.1315248540.txt.gz · Last modified: 2011/09/05 11:49 by jtkorb