I saw a post looking for an angaram that takes phone numbers and
outputs all the possible word combinations from it.  I had a friend
write this.  I am posting it for him and take no credit for it.

Ex. A University of Michigan fan might want a phone number
646-2583 (M GO BLUE) or a Michigan State fan might have
772-7816 (SPARTAN).

This program will take your phone number and give you all of the possible
word combinations.  A 7 digit phone number was assumed.

Since the numbers 1 and 0 have no letters associated with them,
the program will leave in the 1 or the 0 in the word cominations.

It was considered to put the program through a dictionary and only
output the outcomes that are actual words.  But, since a person might
get a possible output of KSGKING (from a phone # of 574-5464) they
might want to know that they have the phone number of 574-KING (maybe
they are an Elvis fan ;^)  My friend could not figure out a way to
look for possible words within the output unless the word was the entire
7 letters.

To use the program, just compile ('g++ phone-num.c -o phone-num') and type
'phone-num' to execute.  Enter each of the phone numbers on a line by itself.
Ex.  355-2088 would be
3
5
5
2
0
8
8

2,200 possibilities exist, so you might want to redirect the output to a
file.

Gedaliah Friedenberg
-=-Department of Mechanical Engineering
-=-Department of Metallurgy, Mechanics and Materials Science
-=-Michigan State University