[need desperate help on c++. please...]

this is wat i got so far....

please chek ur hotmail..

#include <iostream>

#include <cstring>

int main()

{

int x = 0,y=0,total;

char ans[100];

char *al[100];

char pattern[100];

char *match[100];

while (true)

{

cout << "Input string (enter X to stop): ";

cin.getline(ans,100);

if (ans[0] == 'X' && ans[1] == '\0')

break;

al[x] = new char[(strlen(ans)+1)];

strcpy( al[x], ans );

x++;

}

total = x;

cout << "Search Pattern: ";

cin >> pattern;

for (x=0;x<total;x++)

{

if (strstr(al[x],pattern))

{

match[y] = al[x];

y++;

}

} total = y;

cout << "Number of matches: " << total << endl;

for(x=0;x<total;x++)

{

cout << match[x] << endl;

}

return 0;

}

[need desperate help on c++. please...]

Hello there.

im a young newb who is learning the c++ programming this year.

i was given a specific task to do but then its really really hard for me.

i have never learnt bout this before and its giving me a pain in the a**. i also have "c++ how to program", and spent like 2 days reading it but it seems like i can't use the principles from the book to solve teh tasks...

it would be so generous of you if u could help me out on this task and simply explain why its like that after if u wish..

the task is that i hv to write a c++ prog (source) that asks for an arbitrary no. of input strings n a search pattern. then it outputs the no. of strings that match the search pattern and the matched strings.

this is an eg of the behaviour of the prog.

csh> ./ex3

Input string (enter X to stop): Imagine there's no heaven

Input string (enter X to stop): It's easy if you try

Input string (enter X to stop): No hell below us

Input string (enter X to stop): Imagine there's no countries

Input string (enter X to stop): You may say I'm a dreamer

Input string (enter X to stop): But I'm not the only one

Input string (enter X to stop): X

Search pattern: no

Number of matched strings: 3

Imagine there's no heaven

Imagine there's no countries

But I'm not the only one

thats the behavour the prog should be like... the user enters any no. of strings until there is a single X input. the prog would search each input string and see if any of htem contains the search pattern. the search is by default case sensitive.

teh two things that should be out-putted is the no of matched strings and all the matched strings in teh same order of the input...

I would appreciate it so much if you could help me learn make this prog....

i hv been spending like few entire days on this but i really relaly can't get it...

thank you so much,....