char str[10];
int length,count;
void fun(int x)
{
if(x==length)
printf("%d %s\n",++count,str);
else
{
fun(x+1);
str[x]-=32;
fun(x+1);
str[x]+=32;
}
}
int main()
{
scanf("%s",str);
length=strlen(str);
fun(0);
getch();
}
On Wed, Sep 14, 2011 at 10:05 AM, mohit verma <[email protected]> wrote:
> take an array containing all original upper-case letters and their smaller
> case letters and now the problem is reduced to print all substrings
> containing length of original string.
>
>
> On Wed, Sep 14, 2011 at 8:55 PM, teja bala <[email protected]>wrote:
>
>>
>> //dis one works check it out..............
>>
>> #include<ctype.h>
>> #include<stdio.h>
>> #include<string.h>
>> #include<assert.h>
>> void toggler(char* x, int pos)
>> {
>> if(pos==0){ printf("%s\n",x); return; }
>> // printf("String is now: %s\n",x);
>> x[pos-1] = toupper(x[pos-1]);
>> toggler(x, pos-1);
>> x[pos-1] = tolower(x[pos-1]);
>> toggler(x, pos-1);
>> return;
>> }
>> int main(void){
>> char str[500];
>> scanf("%s",str);
>> toggler(str, strlen(str));
>> return 0;
>> }
>>
>> On Wed, Sep 14, 2011 at 7:22 PM, Dave <[email protected]> wrote:
>>
>>> @Teja: Oops. I was wrong. By the time I fix my conceptual error, the
>>> code is no shorter than Anshu's.
>>>
>>> Dave
>>>
>>> On Sep 14, 8:14 am, teja bala <[email protected]> wrote:
>>> > @DAVE
>>> >
>>> > dis was the o/p for ur prog.
>>> >
>>> > aBC
>>> > abC
>>> > abC
>>> > abc
>>> > abc
>>> > abc
>>> > abc
>>> > abc
>>> >
>>> > #include<iostream.h>
>>> > main()
>>> > {
>>> > int i, n = 3;
>>> > char *s="ABC";
>>> > for( i = 0 ; i < (1<<n) ; ++i )
>>> > {
>>> > s[i^(i>>1)] ^= 'a' ^ 'A';
>>> > cout << s << endl;
>>> >
>>> >
>>> >
>>> > }
>>> > }- Hide quoted text -
>>> >
>>> > - Show quoted text -
>>>
>>> --
>>> You received this message because you are subscribed to the Google Groups
>>> "Algorithm Geeks" group.
>>> To post to this group, send email to [email protected].
>>> To unsubscribe from this group, send email to
>>> [email protected].
>>> For more options, visit this group at
>>> http://groups.google.com/group/algogeeks?hl=en.
>>>
>>>
>> --
>> You received this message because you are subscribed to the Google Groups
>> "Algorithm Geeks" group.
>> To post to this group, send email to [email protected].
>> To unsubscribe from this group, send email to
>> [email protected].
>> For more options, visit this group at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>
>
>
> --
> ........................
> *MOHIT VERMA*
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to [email protected].
> To unsubscribe from this group, send email to
> [email protected].
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
