Tile Arranger
Programming challenge description:
Write an algorithm to determine whether a collection of tiles can be rearranged to form a given word. Each tile has 1..N letters. You do not have to use each tile, but you cannot use any tile more than once. There can be several identical tiles.

You may assume len(word) >= 1 and size(tiles) >= 1

Input:
Newline separated list of strings provided through STDIN

<tile 0>

<tile 1>

..

Output:
"true" or "false"