39
4
Using the following length-separated lists of words:
https://github.com/Magic Octopus Urn/wordListsByLength
Print 1 word from each list of length n from 1 all the way up to 20, here's a valid example:
a
an
and
hand
hands
handle
handles
abandons
abandoned
understand
outstanding
newfoundland
understanding
characteristic
characteristics
characterization
characterizations
characteristically
characterologically
chemotherapeutically
Alternatively (array):
['a', 'an', 'and', 'hand', 'hands', 'handle', 'handles', 'abandons', 'abandoned', 'understand', 'outstanding', 'newfoundland', 'understanding', 'characteristic', 'characteristics', 'characterization', 'characterizations', 'characteristically', 'characterologically', 'chemotherapeutically']
Alternatively (any printable non-alphabetic separator other than \n):
a:an:and:hand:hands:handle:handles:abandons:abandoned:understand:outstanding:newfoundland:understanding:characteristic:characteristics:characterization:characterizations:characteristically:characterologically:chemotherapeutically
Rules
- You may choose your own 20 words.
- The words must be from the github page provided, more specifically:
- 1 from 1.txt, 1 from 2.txt, etc...
- Note, files above 20.txt exist, but you do not need any words above 20 characters.
- Valid separators are ASCII-printable non-alphabetical characters (even numbers, don't care).
- Lowercase or uppercase only, pick one, stick with it; no title-case allowed.
- Please don't use a 100% copy of my example 20 words...
- You can, but that's no fun.
- They are likely suboptimal anyways...
- If you DON'T want to use the separated files, and need a full list:
- Use unsorted.txt, this is all
n.txt files in one, sorted alphabetically.
- Use unsorted.txt, this is all
- Note, you CANNOT directly read from the URL, it is a common loophole.
- This is code-golf, lowest byte-count will be the winner.
For reference, the output is 229 bytes, so anything that gets under that beats hardcoding.
Possible meta-tag-discussion:
user-driven where the user gets to customize their outputs from a list of possibilities?
Magic Octopus Urn
Posted 2017-07-20T15:17:12.367
Reputation: 19 422
Following your links got me here, can I use that list?
– LiefdeWen – 2017-07-20T15:41:15.863@LiefdeWen that list is equivalent to this list: unsorted.txt so, yes. If you want to have a full-list of words to parse, use unsorted.txt or that.
– Magic Octopus Urn – 2017-07-20T15:44:48.1074As someone from Newfoundland, I appreciate the shoutout. :) – scatter – 2017-07-20T15:46:48.170
6@Christian You could say I...
( •_•)>⌐■-■understand outstanding newfoundland(⌐■_■)– Magic Octopus Urn – 2017-07-20T15:48:44.843As long as you understand the pronunciation - which I'm pretty sure you do, based on that. – scatter – 2017-07-20T15:54:34.530
@StepHen Well, there are compressed strings too, so nah most probably not. – Erik the Outgolfer – 2017-07-20T16:27:59.700
Can we print an array of arrays something like:
[["a", "an", "and"],["hand", "hands", "handle", "handles"],...]– Riley – 2017-07-20T16:28:39.4471@Riley that's stretching it, 1 delimiter inbetween each word, though I can see many situations where that'd help :P. – Magic Octopus Urn – 2017-07-20T16:29:53.057
FYI the three length 1 words do not appear in the unsorted.txt – Jonathan Allan – 2017-07-20T18:48:52.800
Are we allowed to use different (although non-alphabetic) delimiters between our words? For example this, would save me two bytes while maintaining Latin-text-read-order. EDIT - looks like your answer to Riley would imply a "no" I think.
– Jonathan Allan – 2017-07-20T18:50:50.3971@JonathanAllan just did :). – Magic Octopus Urn – 2017-07-21T00:59:34.800
1Utility for choosing the words. – Jim – 2017-07-21T10:18:23.687
@Jim hehe... I wrote something similar. – Magic Octopus Urn – 2017-07-24T19:46:05.293