1. ## 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

2. And what are you asking?

See the homework policy before posting your question.

3. I think you want something to print all possible numbers(in words)
like
1 800 FOO BAR
How many digits do these American numbers have?
I am accostomed to 7 digit numbers.
Hm...You DO realize that there will be 2^(7*3) + (2^2) combinations right?
Or do they have to be actual words?
I will attempt this, and post if I ever get it working.

4. 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?

5. look the example again.
The search will start after 1-800- from input string and from the 8th exp(2)charcter of input will use a dic.
file to go to the (a or b or c)'s index and will start matching rest of 9th character to last searching for word.
use - to saperate words

6. Originally Posted by sea_4_ever
I think you want something to print all possible numbers(in words)
like
1 800 FOO BAR
How many digits do these American numbers have?
I am accostomed to 7 digit numbers.
Hm...You DO realize that there will be 2^(7*3) + (2^2) combinations right?
Or do they have to be actual words?
I will attempt this, and post if I ever get it working.
look the example again.
The search will start after 1-800- from input string and from the 8th exp(2)charcter of input will use a dic.
file to go to the (a or b or c)'s index and will start matching rest of 9th character to last searching for word.
use - to saperate words

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

8. it's not a contest.
logic to develope a program like site www.phonespell.org in c

9. 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.

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

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

11. need some start

12. Then...START !

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

13. 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.

14. I able to get string when one word string is present in dictionary as my result
but could get when two saperate words correspons to my result string

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