May  9 2025   9:28:48.785 PM
 
AMSTERDAM
  FORTRAN90 version
 
  Work on the "AMSTERDAM" problem.
 
  As in the iPhone application Textropolis,
  find as many words as possible using the letters 
  in "AMSTERDAM".
 
  Examine a file "wordlist.txt"
  full of words, and look for "sub-anagrams" 
  (words whose letters are a subset of the target ones).
 
  We only consider words of length at least        4
 
  Copy sub-anagrams to "amsterdam.txt".
  
   Number of words checked                        300394
   Number of words that were "long enough"        298644
   Number of sub-anagrams found                      270
 
AMSTERDAM:
  Normal end of execution.
 
May  9 2025   9:28:48.964 PM
marts
masa
maser
mast
masted
master
matar
mate
mated
mater
mates
matra
mats
mead
meads
meat
meats
mesa
mesad
meta
metad
metas
metra
mets
mrads
raad
raads
rada
rads
rama
ramas
ramate
rame
ramed
ramet
rammed
rams
ramstam
rasa
rasae
rase
rased
rasta
rata
ratas
rate
rated
rates
rats
read
reads
ream
reams
reast
reata
reds
remast
rest
retama
rets
sade
sadr
samar
same
sammer
sara
sard
sarda
sare
sart
sate
sated
satem
satrae
seam
sear
seat
semra
sera
sert
serta
seta
smarm
smart
smarted
smear
stade
stam
stammer
star
stare
stared
stead
steam
stem
stema
stemma
stra
strad
strade
strae
stram
stre
stream
stremma
taar
tade
tama
tamas
tame
tamed
tamer
tamers
tames
tams
tara
taras
tare
tarea
tared
tares
tars
tarse
taser
tead
team
teams
tear
tears
teas
teda
teds
tema
tera
teras
term
terma
terms
tmema
trade
trades
tram
trama
trame
trams
tread
treads
tred
trema
tsade
tsar