As I remember - it differs in output. And treating case of letters.
Best regards
DM
PS> Compare output and input definition sections in both problem.
If you really want to get Accepted, try to think about possible, and after that - about impossible ... and you'll get, what you want ....
Born from ashes - restarting counter of problems (800+ solved problems)
i am very surprised how the case is treated in this problem(195). i got ur reply and taked to NAZMUL about it. Then i got ACC. So, thanks for help and reply DM.
------------------roni
I've tried many ways but still getting OLE. I've read previous posts but still could not find any cases where my code failed to produce the right output. Can anyone help me finding this?
Here is my code
It seems to me you may mislay the possibility of input string being even longer than 100 characters, or if I am mistaken myself?
Anyway, I got this one accepted a week ago and I used malloc- i..e. without any assumptions about the length, simple stupid backtracking and a trick about "alphabetical order" not "ascii oredr"- all that is needed for this one 195
I don't feel quite sure about that, but I remember hearing somewhere that that what you have done int your grouping funcction(namely, returned char *r- address of a temporary variable) is not good...
though it may be not the case here, since OLE is caused by infinite loop...
Hope this will be of some help.
Your comparison function seems to be right, though I had troubles with compiling your code on my machine, only why don't you use islower() isupper( ) builtin functions of <ctype.h>? and 32='a'-'A' I guess...