No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
|
how can one determine whether a given string can be expressed as a concatenation of palindromes of even length. 
|
|
|
hi , i am having difficulty in implementing the basic mathematic principle of inclusion-exclusion. I want to find the no. of numbers in a range from 1 to N which are divisible by another set of numbers where size of set <= 15. Now the problem i am facing is …
|
|
|
hi, i have a string like string s = "1234" and i want separately the integers 1 ,2 ,3 4 as integers , so how do i do it? i tried using atoi as follows : [CODE]char * ss[10]; ss = atoi(s.c_str()); int x = ss[0];[/CODE] for getting 1 but …
|
|
|
hi, can someone please tell me the approach i should take to find the distinct substrings of a string ?
|