I tried in vs 2005 in windows and work fine for me.
Sent from my iPod
On Feb 7, 2011, at 8:45 PM, "Sarma Tangirala" <tvssarma.ome...@gmail.com> wrote:
> Won't it increment by 2 (or something) and not by 1?
> Sent from my BlackBerry
>
> From: Rajeevpodar <rajeevpo...@gmail.com>
> Sender: algogeeks@googlegroups.com
> Date: Mon, 7 Feb 2011 20:41:32 +0530
> To: algogeeks@googlegroups.com<algogeeks@googlegroups.com>
> ReplyTo: algogeeks@googlegroups.com
> Subject: Re: [algogeeks] Re: C++ Riddle
>
> @ashish: tht's true. But that will be the sum of two numbers.
> Reason is v store the address in char* so when increment it by other number
> it will increment that times, that is the required answer.
>
> Sent from my iPod
>
> On Feb 7, 2011, at 7:14 PM, Ashish Goel <ashg...@gmail.com> wrote:
>
>> &p[n] gives address of p+n it does not add..
>> Best Regards
>> Ashish Goel
>> "Think positive and find fuel in failure"
>> +919985813081
>> +919966006652
>>
>>
>> On Mon, Feb 7, 2011 at 11:47 AM, jalaj jaiswal <jalaj.jaiswa...@gmail.com>
>> wrote:
>> try this
>>
>> let nos be m & n
>>
>> char * p;
>> p=m;
>> int sum = (int)&p[n] ;
>>
>> sum is m+n :)
>>
>>
>> On Mon, Feb 7, 2011 at 11:41 AM, Dave <dave_and_da...@juno.com> wrote:
>> @Ricky: if increment and decrement operators are not considered
>> arithmetic, try
>>
>> int sum(int m, int n)
>> {
>> while( m > 0 )
>> {
>> m--;
>> n++;
>> }
>> while( m < 0 )
>> {
>> m++;
>> n--;
>> }
>> return n;
>> }
>>
>> On Feb 6, 11:49 pm, Ricky <rajeevpo...@gmail.com> wrote:
>> > write the program to add two numbers without using arithmetic and bit
>> > operation..
>>
>> --
>> You received this message because you are subscribed to the Google Groups
>> "Algorithm Geeks" group.
>> To post to this group, send email to algogeeks@googlegroups.com.
>> To unsubscribe from this group, send email to
>> algogeeks+unsubscr...@googlegroups.com.
>> For more options, visit this group at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>>
>>
>>
>> --
>> With Regards,
>> Jalaj Jaiswal (+919019947895)
>> Final Year Undergraduate,
>> IIIT ALLAHABAD
>>
>> --
>> You received this message because you are subscribed to the Google Groups
>> "Algorithm Geeks" group.
>> To post to this group, send email to algogeeks@googlegroups.com.
>> To unsubscribe from this group, send email to
>> algogeeks+unsubscr...@googlegroups.com.
>> 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 algogeeks@googlegroups.com.
>> To unsubscribe from this group, send email to
>> algogeeks+unsubscr...@googlegroups.com.
>> 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 algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> 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 algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> 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 algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
