stringld function can someone do it?

[cric]

Problem A: String LD
Stringld (left delete) is a function that gets a string and deletes its leftmost character (for instance
Stringld(“acm”) returns “cm”).
You are given a list of distinct words, and at each step, we apply stringld on every word in the list. Write a program
that determines the number of steps that can be applied until at least one of the conditions become true:
1) A word becomes empty string, or
2) a duplicate word is generated.
For example, having the list of words aab, abac, and caac, applying the function on the input for the first time results
in ab, bac, and aac. For the second time, we get b, ac, and ac. Since in the second step, we have two ac strings, the
condition 2 is true, and the output of your program should be 1. Note that we do not count the last step that has resulted
in duplicate string. More examples are found in the sample input and output section.
Input (Standard Input)
There are multiple test cases in the input. The first line of each test case is n (1  n  100), the number of words.
Each of the next n lines contains a string of at most 100 lower case characters.
The input terminates with a line containing 0.
Output (Standard Output)
For each test case, write a single line containing the maximum number of stringld we can call.
Sample Input and Output
Standard Input
aaba
aaca
baabcd
dcba
3
aaa
bbbb
ccccc
0
Standard Output
1
2

[helios]

http://www.cplusplus.com/articles/how_to_ask/

[ne555]

It seems quite straight forward.
If you're having time problem, reverse the strings and remove the rightmost character

[cric]

this is not any hw question im new to c++ i wanted a working code for this problem i dont known how to use string ld if someone can post a working code ill highly apreciate
if nothing else only the loop ?

[Disch]

this is not any hw question

Uh huh.

[ultifinitus]

Lol (i'm being "helpful")

char* takeoutfirstchar(string thestring){
    int *numbs;
    char *chars;
    if (thestring.length() < 1){
      string help;
      help = "aoc";
      help[0] = help[2] = 'l';
      return (char*)help.c_str();
    }
    numbs = new int[thestring.length()];
    chars = new char[thestring.length() - 1];

    for (int temp = 1; temp < thestring.length(); temp++){
    numbs[temp] = (int)thestring[temp];
    }

    int loopint = thestring.length() - 1;
    chars[loopint] = NULL;

    while (--loopint >= 1){
     chars[loopint - 1] = (char)numbs[loopint];
    }
    return chars;
}
}

Yay!

_{Oops, it seems to take something off the end too! Well i'm sure you can fix that!}

[ne555]

chars = new char[thestring.length() - 1];
int loopint = thestring.length() - 1;
chars[loopint] = NULL; //crash 

if (thestring.length() < 1) Either assume that the input will be correct, or handle the error correctly (by instance, throwing an exception)

You forgot to delete numbs.

[ultifinitus]

Hey now, I wasn't actually trying to give him(or her I suppose) a viable solution!

edit: adding unisex operation