Thread: 1-800-contest

DEVELOPE A PHONE SPELL
sample input and output:
combinations:

exp:1
input:1-800-2668378
output:
1-800-A-NO-TEST
1-800-A-NO-VEST
1-800-A-NO-TEST
1-800-A-ON-VEST
1-800-AM-OVERT
1-800--BOO-VEST
1-800--BOO-TEST
1-800-CONTEST
1-800-CONVERT
1-800-COO-TEST

exp 2:
i/p:1-800--0000000
o/p:1-800--0000000

exp 3:
i/p:1-800--1000000
o/p:1-800--1000000

Proble:
NOs from 2 to8 corresponds to the alphabets written like in the telphone for storing names
given a string of input:1-800-2668378 and all possible combination of words are shown.
for string -2668378
hint :use a dictionary file

1-800- is common for all strings
if no correspond to more than one word use to saperate them
if no has 0 or 1 put at same pos

And what are you asking?

See the homework policy before posting your question.

Out of simplicity the numbers are:

2 = A, B, C
3 = D, E, F
4 = G, H, I
5 = J, K, L
6 = M, N, O
7 = P, Q, R, S
8 = T, U, V
9 = W, X, Y, Z

As sea_4_ever said, the combination of letters is rather large. Do the letters have to make a word?

Seriously, if it's a contest work it out for yourself. If it's homework ask specific questions.

Contests should be posted on the Contests Board. However, this sounds like a homework question. As stated earlier, read the homework policy and attempt it yourself first.

Design it first on paper, the actual C implementation is trivial.

Consider, a flow chart, NS chart and an IPO chart.

Then...START !

No one is going to that for you. People here have given you already many paths to explore...

How about beginning with the basics of reading in a phone number, then printing out the digits which are of interest.

If you can do that bit, then try and do the next bit which associates digits with letters.

If not, then post what you've achieved so far and we'll take it from there.

There's no point us explaining the details of the algorithm if just reading in the string is beyond you.

Well, as Salem said -- Why don't you post what you've got so far?