Re: [algogeeks] puzzle
3 On Mon, Jun 27, 2011 at 2:10 AM, amit the cool wrote: > There are 6 beer bottle nd one is poisoned. we have mice who will die > within 14 hrs after drinkin poisned beer. In 24 hrs we have to find > poisoned beer bottle. How many no of mice we require to find out > poisoned bottle. > > -- > 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. > > -- Thanks & Regards Arpit Bhatnagar (Computer Engineering) (MNIT JAIPUR) -- 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.
Re: [algogeeks] [brain teaser ] Mystery Puzzle Servant Wish 25 may
master can give only monet so obviously money On Wed, May 25, 2011 at 12:48 PM, Lavesh Rawat wrote: > *Mystery Puzzle Servant Wish > * > * > * > ** > *Once upon a time, in the West Lake village, a servant lived with his > master. After service of about 30 years, his master became ill and was going > to die. One day, the master called his servant and asked him for a wish. It > could be any wish but just one. The master gave him one day to think about > it. The servant became very happy and went to his mother for discussion > about the wish. His mother was blind and she asked her son for making a wish > for her eye-sight to come back. Then the servant went to his wife. She > became very excited and asked for a son as they were childless for many > years. After that, the servant went to his father who wanted to be rich and > so he asked his son to wish for a lot of money. The next day he went to his > master and made one wish through which all the three (mother, father, wife) > got what they wanted. You have to tell what the servant asked the master > * * > * > > *Update Your Answers at* : Click > Here<http://dailybrainteaser.blogspot.com/2011/05/mystery-puzzle-servant-wish-25-may.html?lavesh=lavesh> > > Solution: > Will be updated after 1 day > > > > > -- > > "Never explain yourself. Your friends don’t need it and > your enemies won’t believe it" . > > -- > 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. > -- Thanks & Regards Arpit Bhatnagar (Computer Engineering) (MNIT JAIPUR) -- 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.
Re: [algogeeks] Google Q
if u knw the no. of 1's in no . I mean can afford the complexity of finding no. of 1's of no. den if no of 1' in say 101011 is 4 den largest is00 smalest is 00 On Fri, May 13, 2011 at 8:38 AM, Ashish Goel wrote: > Given an integer, print the next smallest and next largest numbers that > have the same number of 1’s in their binary representations > > > Best Regards > Ashish Goel > "Think positive and find fuel in failure" > +919985813081 > +919966006652 > > -- > 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. > -- Thanks & Regards Arpit Bhatnagar (Computer Engineering) (MNIT JAIPUR) -- 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.
[algogeeks] Re: n wires puzzle <<<>>
got it @ last sorry to disturb u guys if any one want answer feel free to ask On Mon, May 9, 2011 at 10:41 PM, ArPiT BhAtNaGaR < arpitbhatnagarm...@gmail.com> wrote: > You're an electrician working at a mountain. There are N wires running from > one side of the mountain to the other. The problem is that the wires are not > labeled, so you just see N wire ends on each side of the mountain. Your job > is to match these ends (say, by labeling the two ends of each > wire in the same way). > > In order to figure out the matching, you can twist together wire ends, thus > electrically connecting the wires. You can twist as many wire ends as you > want, into as many clusters as you want, at the side of the mountain where > you happen to be at the time. You can also untwist the wire ends at the side > of the mountain where you're at. You are equipped with an Ohm meter, which > lets you test the connectivity of any pair of wires. (Actually, it's an > abstract Ohm meter, in that it only tells you whether or not two things are > connected, not the exact resistance.) > > You are not charged [no pun intended] for twisting, untwisting, and using > the Ohm meter. You are only charged for each helicopter ride you make from > one side of the mountain to the other. What is the best way to match the > wires? (Oh, N>2, for there is no solution when N=2.) > > -- > Thanks & Regards > > Arpit Bhatnagar > (Computer Engineering) > (MNIT JAIPUR) > > -- Thanks & Regards Arpit Bhatnagar (Computer Engineering) (MNIT JAIPUR) -- 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.
[algogeeks] n wires puzzle <<<>>
You're an electrician working at a mountain. There are N wires running from one side of the mountain to the other. The problem is that the wires are not labeled, so you just see N wire ends on each side of the mountain. Your job is to match these ends (say, by labeling the two ends of each wire in the same way). In order to figure out the matching, you can twist together wire ends, thus electrically connecting the wires. You can twist as many wire ends as you want, into as many clusters as you want, at the side of the mountain where you happen to be at the time. You can also untwist the wire ends at the side of the mountain where you're at. You are equipped with an Ohm meter, which lets you test the connectivity of any pair of wires. (Actually, it's an abstract Ohm meter, in that it only tells you whether or not two things are connected, not the exact resistance.) You are not charged [no pun intended] for twisting, untwisting, and using the Ohm meter. You are only charged for each helicopter ride you make from one side of the mountain to the other. What is the best way to match the wires? (Oh, N>2, for there is no solution when N=2.) -- Thanks & Regards Arpit Bhatnagar (Computer Engineering) (MNIT JAIPUR) -- 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.
Re: [algogeeks] Re: If any one have algorithms for interviews by adnan aziz ebook... Please mail ...
dere is soln first person mail to first person on list n den the one who gets to next & so since we all need it :P On Fri, May 6, 2011 at 11:01 AM, vamsi achyuth wrote: > mail me++; > > > On 6 May 2011 10:52, naresh kumar wrote: > >> Pleas mail to me also... >> naresh.sac...@gmail.com >> Thanks in advance >> >> >> On Fri, May 6, 2011 at 1:46 AM, Ashish Modi wrote: >> >>> Hello, >>> Can you please mail me ashishrmod...@gmail.com >>> >>> Thanks in advance >>> >>> -- >>> With Regards >>> Ashish >>> >>> -- >>> 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. > -- Thanks & Regards Arpit Bhatnagar (Computer Engineering) (MNIT JAIPUR) -- 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.
Re: [algogeeks] ADULT SEX PHOTOS
yeah thats the soln On Thu, Apr 14, 2011 at 6:12 PM, Kunal Patil wrote: > @All : Please report it spam and then delete. Gmail will look into it if > reported spam by many people. > > -- > 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. > -- Arpit Bhatnagar (MNIT JAIPUR) -- 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.
Re: [algogeeks] ADULT SEX PHOTOS
kick him plzzz On Thu, Apr 14, 2011 at 11:44 AM, taocp wrote: > Plz ban him. > > > 2011/4/14 ramya raman > >> >> hot katrina kaif wallpapers >> http://cinyworld96.blogspot.com/2011/03/katrina-kaif.html >> new hot sruthi hassan stills >> http://cinyworld96.blogspot.com/2011/03/shruthi-hassan.html >> namitha hot sexy stills >> http://cinyworld96.blogspot.com/2011/04/namitha.html >> deepika padukone new stills >> http://cinyworld96.blogspot.com/2011/03/deepika-padukone.html >> hot tamanna sexy wallpapers >> http://cinyworld96.blogspot.com/2011/04/tamanna.html >>beautiful aishwariya rai >> http://cinyworld96.blogspot.com/2011/03/aishwariya-rai.html >> diya mirza sexy photos >> http://cinyworld96.blogspot.com/2011/03/diya-mirza.html >> stunning beauty sneha >> http://cinyworld96.blogspot.com/2011/03/sneha.html >>unbelivable iliyana photos >> http://cinyworld96.blogspot.com/2011/03/iliyana.html >> priyamani beautiful stills >> http://cinyworld96.blogspot.com/2011/03/priyamani.html >> pranitha in half saree >> http://cinyworld96.blogspot.com/2011/03/pranitha.html >> richa saree stills >> http://cinyworld96.blogspot.com/2011/03/richa-gangopadyay.html >> >> -- >> 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. > -- Arpit Bhatnagar (MNIT JAIPUR) -- 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.
Re: [algogeeks] Finding subarray
http://groups.google.com/group/algogeeks?hl=en. > >>>>> > >>>> > >>>> > >>>> > >>>> -- > >>>> Cheers, > >>>> hammett > >>>> http://hammett.castleproject.org/ > >>>> > >>>> -- > >>>> 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. > >> > > > > > > > > -- > > Cheers, > > hammett > > http://hammett.castleproject.org/ > > > > -- > > 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. > > -- Arpit Bhatnagar (MNIT JAIPUR) -- 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.
Re: [algogeeks] Re:
yes we do On Sun, Apr 10, 2011 at 6:12 PM, SANDEEP AAMIN wrote: > and if u want a solution tell me.. i hav solved it... > > > On Sun, Apr 10, 2011 at 6:11 PM, SANDEEP AAMIN wrote: > >> no need to laugh guys... >> that id is a fake one.. thats not the id of our sir... >> >> >> On Sun, Apr 10, 2011 at 2:49 PM, sukhmeet singh >> wrote: >> >>> do post the sln after attending the class >>> >>> On 4/10/11, himanshu kansal wrote: >>> > Rofl:D:D >>> > >>> > On Sun, Apr 10, 2011 at 12:01 AM, ArPiT BhAtNaGaR < >>> > arpitbhatnagarm...@gmail.com> wrote: >>> > >>> >> lol funniest moment of Algogeeks >>> >> >>> >> >>> >> On Sun, Apr 3, 2011 at 9:51 PM, Umer Farooq >>> wrote: >>> >> >>> >>> hhahahahahahahhahaha Bohat aalaa sir! :D caught red-handed :D :P >>> >>> >>> >>> Ow please tell us the solution, I'm interested in knowing the answer >>> :D >>> >>> >>> >>> >>> >>> On Sun, Apr 3, 2011 at 9:02 PM, Carl Barton >>> >>> wrote: >>> >>> >>> >>>> Haha >>> >>>> >>> >>>> >>> >>>> On 3 April 2011 15:28, Arpit Sood wrote: >>> >>>> >>> >>>>> assignment problem ? haha >>> >>>>> >>> >>>>> >>> >>>>> On Sun, Apr 3, 2011 at 7:16 PM, Dr. Deepak Garg >>> >>>>> wrote: >>> >>>>> >>> >>>>>> Beta, puchna hi tha, to mujhse puchte! >>> >>>>>> Anyways, you will get the solution in tomorrow's lecture @1pm. >>> >>>>>> I have gone through your profile. See me in my cabin after the >>> class. >>> >>>>>> Make sure that you attend tomorrow's lecture. For now, study >>> dynamic >>> >>>>>> programming.. >>> >>>>>> >>> >>>>>> On Apr 3, 6:03 pm, SANDEEP AAMIN wrote: >>> >>>>>> > hey guys please help me to solve this >>> >>>>>> > >>> >>>>>> > QUESTION : input a number C , an output all of the ways that a >>> >>>>>> > group >>> >>>>>> > of ascending positive numbers can be summed to give C. for e.g >>> if >>> >>>>>> > C=6,the output should be >>> >>>>>> > 1+2+3 >>> >>>>>> > 1+5 >>> >>>>>> > 2+4 >>> >>>>>> > [solve using dynamic programming] >>> >>>>>> > >>> >>>>>> > please tell me about this.. >>> >>>>>> >>> >>>>>> -- >>> >>>>>> 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. >>> >>>>>> >>> >>>>>> >>> >>>>> >>> >>>>> >>> >>>>> -- >>> >>>>> Regards, >>> >>>>> Arpit Sood >>> >>>>> >>> >>>>> -- >>> >>>>> 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 th
Re: [algogeeks] Re:
lol funniest moment of Algogeeks On Sun, Apr 3, 2011 at 9:51 PM, Umer Farooq wrote: > hhahahahahahahhahaha Bohat aalaa sir! :D caught red-handed :D :P > > Ow please tell us the solution, I'm interested in knowing the answer :D > > > On Sun, Apr 3, 2011 at 9:02 PM, Carl Barton wrote: > >> Haha >> >> >> On 3 April 2011 15:28, Arpit Sood wrote: >> >>> assignment problem ? haha >>> >>> >>> On Sun, Apr 3, 2011 at 7:16 PM, Dr. Deepak Garg wrote: >>> >>>> Beta, puchna hi tha, to mujhse puchte! >>>> Anyways, you will get the solution in tomorrow's lecture @1pm. >>>> I have gone through your profile. See me in my cabin after the class. >>>> Make sure that you attend tomorrow's lecture. For now, study dynamic >>>> programming.. >>>> >>>> On Apr 3, 6:03 pm, SANDEEP AAMIN wrote: >>>> > hey guys please help me to solve this >>>> > >>>> > QUESTION : input a number C , an output all of the ways that a group >>>> > of ascending positive numbers can be summed to give C. for e.g if >>>> > C=6,the output should be >>>> > 1+2+3 >>>> > 1+5 >>>> > 2+4 >>>> > [solve using dynamic programming] >>>> > >>>> > please tell me about this.. >>>> >>>> -- >>>> 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. >>>> >>>> >>> >>> >>> -- >>> Regards, >>> Arpit Sood >>> >>> -- >>> 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. >> > > > > -- > Umer > > -- > 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. > -- Arpit Bhatnagar (MNIT JAIPUR) -- 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.
Re: [algogeeks] please explain the output
thx pratik
On Sat, Apr 9, 2011 at 8:13 PM, Pratik Kathalkar
wrote:
> u can see the pre-processed file using gcc -E prog_name.cand @
> bottom u can see what actually the code is doing.
>
>
> On Tue, Apr 5, 2011 at 12:45 PM, Arvind wrote:
>
>> #include
>>
>> #define f(a,b) a##b
>> #define g(a) #a
>> #define h(a) g(a)
>>
>> int main()
>> {
>> printf("%s",g(f(1,2)));
>> printf("\t%s",h(f(1,2)));
>> return 0;
>> }
>>
>>
>>
>> i have run this program in gcc compiler and getting : f(1,2) 12 as
>> output.
>> can anyone explain the reason for getting this output?
>>
>> --
>> 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.
>>
>>
>
>
> --
> Pratik Kathalkar
> CoEP
> BTech IT
> 8149198343
>
>
> --
> 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.
>
--
Arpit Bhatnagar
(MNIT JAIPUR)
--
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.
Re: [algogeeks] website feedback
its really really coolll i love it can u tell somtnhg how to develop things like that some idea On Sat, Apr 9, 2011 at 10:08 PM, Carl Barton wrote: > Either way, it's a pretty boring idea. > > > On 9 April 2011 16:06, hary rathor wrote: > >> is it not some kind of fishing page ? >> >> -- >> 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. > -- Arpit Bhatnagar (MNIT JAIPUR) -- 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.
Re: [algogeeks] please explain the output
COOL BRO THIS IS A GOOD SOLN
On Tue, Apr 5, 2011 at 4:10 PM, Azhar Hussain wrote:
> Few Important things about macros, before I explain the output
> 1. Macros are replaced in passes.
> 2. Macros are not recursive.
>
> regarding the output remember the rule for expansion
> "A parameter in the replacement list, *UNLESS* preceded by a # or ##
> preprocessing token or followed by a ## preprocessing token, is replaced by
> the corresponding argument after all macros contained therein have been
> expanded".
> In other words, macros are replaced "inside out" unless # or ## exists
>
> printf("%s",g(f(1,2))); is replaced as #f(1,2) ---> "f(1,2)" according to
> the replacement rule.
> printf("\t%s",h(f(1,2))); As this does not replace with # or ## directly,
> "inside out" expansion leads to h("1,2") --> g('1,2") --> "1,2"
>
> for the first pass
> printf("%s", "f(1,2)"); ---> g(a) #a
> printf("\t%s", h("1,2"));
>
> second pass
> printf("%s", "f(1,2)"); >> not processed(exhausted)
> printf("\t%s", g("1,2")); --> h(a) g(a)
>
> Third pass
> printf("%s", "f(1,2)"); >> not processed(exhausted)
> printf("\t%s", "1,2"); --> g(a) #a
>
>
> Hope this answers your question.
>
> -
> Azhar.
>
>
>
>
> On Tue, Apr 5, 2011 at 3:22 PM, Vandana Bachani wrote:
>
>> Hi Arvind,
>> These are preprocessor specific operators. Check out
>> http://msdn.microsoft.com/en-us/library/wy090hkc(v=vs.80).aspx
>>
>> -Vandana
>>
>> On Tue, Apr 5, 2011 at 12:45 PM, Arvind wrote:
>>
>>> #include
>>>
>>> #define f(a,b) a##b
>>> #define g(a) #a
>>> #define h(a) g(a)
>>>
>>> int main()
>>> {
>>> printf("%s",g(f(1,2)));
>>> printf("\t%s",h(f(1,2)));
>>> return 0;
>>> }
>>>
>>>
>>>
>>> i have run this program in gcc compiler and getting : f(1,2) 12 as
>>> output.
>>> can anyone explain the reason for getting this output?
>>>
>>> --
>>> 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.
>
--
Arpit Bhatnagar
(MNIT JAIPUR)
--
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.
Re: [algogeeks] National Instruments face to face question
U sure those r binary tree's & not BST On Sat, Apr 9, 2011 at 10:26 AM, Anand wrote: > 1, You have 52 cards. How will you make your you distribute cards randomly. > > 2. You have given a binary tree. Given any node, print the all the nodes at > the same level. > > 3. You have given a binary tree and two given nodes. Find the distance > between two nodes. > > -- > 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. > -- Arpit Bhatnagar (MNIT JAIPUR) -- 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.
Re: [algogeeks] Google ques
WELL my answer is complexity is between n^2 to n
SOLUTION LIES WITHIN THE SOLUTION Array AS:
A= {3 4 5 15 19 20 25}
first we have in B={ 3,4}now we have PTR1 @ 5andPTR2 always
one less thab PTR1 means @ 4
now from B[0] upto the same element ie 4 add ptr2 and check
3+4>5 so we hav
B={3,4,5}now ptr1 @15 and ptr2 @ 5 checking with B[0]
3+5<15 &4+5 <15
so B={3,4,5,8,9}
Now we missed one thing that is 12
so we need one more check that is while we move to to each node we can
remeber sum that is while on 4 we have 7
on 5 we have 12
so we need to check also we SUM <15we add 12 so B={3,4,5,8,9,12}
""""""""""""""""""""""IMP NOTE : we check sum only if pointer moving from
B[0] to reaches the no. itself """"""""""""""""
next we hav ptr1 @ 19 ptr2 @ 15so 15+b[0] =15+3<19 & 15+4=19
so we insert B={3,4,5,8,9,12,15,18}
& sum=3+4+5+8 =12+8=20 as sum>19 so no change
3,4,5,8,9,12,15,18,19,20, 20+B[0] =23 ,20+b[1]=24 ,25 so
on
On Fri, Apr 8, 2011 at 11:44 PM, Akash Agrawal wrote:
> what do u mean by* top k values?*
> can't the answer be 3,4,5,15,3+15 etc
>
> Regards,
> Akash Agrawal
> http://tech-queries.blogspot.com/
>
>
>
> On Fri, Apr 8, 2011 at 7:22 PM, saurabh agrawal wrote:
>
>> ou are given an array A of k values which contain int values in sorted
>> (asec) order. Find top k values (asec) which can either be the number from
>> the array A, or sum of any two numbers from A or sum of any three numbers
>> from A. So, if A's values are represented as : a1,a2,...,ak , the possible
>> numbers can be: a(i), a(i)+a(j), a(i)+a(j)+a(l) for any i,j,l < k
>>
>> Ex: A[7] = {3,4,5,15,19,20,25}
>> output B[7] = {3,4,5,(3+4),(3+5),(4+5),(3+4+5)}
>>
>> --
>> 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.
>
--
Arpit Bhatnagar
(MNIT JAIPUR)
--
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.
Re: [algogeeks] Are U a Student Must Read this Frwd This Please If u Like We R student like You TOO
so soory its www.kampusattack.comagain sorry On Fri, Apr 1, 2011 at 1:17 AM, hary rathor wrote: > everybody want to be mark. > > -- > 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. > -- Arpit Bhatnagar (MNIT JAIPUR) -- 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.
[algogeeks] STUDENT SHOULD READ THIS AND PLEASE FORWARD THIS WE ARE STUDENTS LIKE YOU TOO
MNIT JAIPUR PRESENTS YOU KAMPUSATTACK.COM <http://ampusattack.com/> Biggest Social Platform For Students by Students - Enjoy Spiced up Social Networking With Hot Features! - Get Connected To Constillation Of Young Brains Like You! - Access & share useful collection of Ebooks,Notes, Ppt's,Codes,Programs. etc.. - Find Lot Of Humor & Fun Inside! - Chat With Spicy Kampus Messenger with new people , Play Amazing Games. *! STAND OUT FROM CROWD !* With Our Useful Resources You Will Never Be Same As Rest Of Crowd - GD 's With Pro's & Con's. - INTERVIEW preprations by personal experience of people. - PLACEMENT PAPERS - *College Previous Papers* - *Info About Latest **Technologies & Gadgets.* - *Project Ideas & help.* - *INTERNSHIP & TRANING GUIDANCE.* *! BE CONNECTED AND UPDATED!* - *Connect With Your Pal's , Senior's & Alumni's.* - *Exchange Idea's With People Across Kampuses.* *! EXCLUSIVE EXPERT ZONE !* - STEP OUT from other's with our *INDUSTRIAL GUINDANCE* from Adobe , Microsoft, NTPC, BPCL ,Accenture. - Field Experts & Career Consultant Inside. Register Today! *WWW.KAMPUSATTACK.COM* <http://www.kampusattack.com/> -- -- Arpit Bhatnagar (MNIT JAIPUR) -- 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.
[algogeeks] Are U a Student Must Read this Frwd This Please If u Like We R student like You TOO
NIT JAIPUR PRESENTS YOU KAMPUSATTACK.COM <http://ampusattack.com/> Biggest Social Platform For Students by Students - Enjoy Spiced up Social Networking With Hot Features! - Get Connected To Constillation Of Young Brains Like You! - Access & share useful collection of Ebooks,Notes, Ppt's,Codes,Programs. etc.. - Find Lot Of Humor & Fun Inside! - Chat With Spicy Kampus Messenger with new people , Play Amazing Games. *! STAND OUT FROM CROWD !* With Our Useful Resources You Will Never Be Same As Rest Of Crowd - GD 's With Pro's & Con's. - INTERVIEW preprations by personal experience of people. - PLACEMENT PAPERS - *College Previous Papers* - *Info About Latest **Technologies & Gadgets.* - *Project Ideas & help.* - *INTERNSHIP & TRANING GUIDANCE.* *! BE CONNECTED AND UPDATED!* - *Connect With Your Pal's , Senior's & Alumni's.* - *Exchange Idea's With People Across Kampuses.* *! EXCLUSIVE EXPERT ZONE !* - STEP OUT from other's with our *INDUSTRIAL GUINDANCE* from Adobe , Microsoft, NTPC, BPCL ,Accenture. - Field Experts & Career Consultant Inside. Register Today! *WWW.KAMPUSATTACK.COM* <http://www.kampusattack.com/> -- Arpit Bhatnagar (MNIT JAIPUR) -- 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.
[algogeeks] Re: C o/p gud one try
please do answer geeks me waiting
On Mon, Mar 28, 2011 at 11:14 PM, ArPiT BhAtNaGaR <
arpitbhatnagarm...@gmail.com> wrote:
> #include
> main()
> {
> long x;
> float t;
> scanf("%f",&t);
> printf("%d\n",t);
> x=90;
> printf("%f\n",x);
> {
> x=1;
> printf("%f\n",x);
> {
> x=30;
> printf("%f\n",x);
> }
> printf("%f\n",x);
> }
> x==9;
> printf("%f\n",x);
>
> }
>
> o/p on gcc compiler
> 20.3 (i/p given)
> -1073741824
> 20.299988
> 20.299988
> 20.299988
> 20.299988
> 20.299988
>
> plz explain the o/p
>
> --
> Arpit Bhatnagar
> (MNIT JAIPUR)
>
>
--
Arpit Bhatnagar
(MNIT JAIPUR)
--
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.
[algogeeks] C o/p gud one try
#include
main()
{
long x;
float t;
scanf("%f",&t);
printf("%d\n",t);
x=90;
printf("%f\n",x);
{
x=1;
printf("%f\n",x);
{
x=30;
printf("%f\n",x);
}
printf("%f\n",x);
}
x==9;
printf("%f\n",x);
}
o/p on gcc compiler
20.3 (i/p given)
-1073741824
20.299988
20.299988
20.299988
20.299988
20.299988
plz explain the o/p
--
Arpit Bhatnagar
(MNIT JAIPUR)
--
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.
Re: [algogeeks] Ties The Rope With Minimum Cost ..Interesting For Geeks
ost 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> >>>>> http://groups.google.com/group/algogeeks?hl=en. >>>>> >>>> >>>> >>>> >>>> -- >>>> Regards >>>> Gunjan Sharma >>>> Chairman IEEE Students Chapter IIT Roorkee >>>> B.Tech IV year CSE >>>> >>>> Contact No- +91 9997767077 >>>> >>>> -- >>>> 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> >>>> 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. >> > > > > -- > Regards > Gunjan Sharma > Chairman IEEE Students Chapter IIT Roorkee > B.Tech IV year CSE > > Contact No- +91 9997767077 > > -- > 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. > -- Arpit Bhatnagar (MNIT JAIPUR) -- 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.
[algogeeks] Student Please Read & Frwd This
NIT JAIPUR PRESENTS YOU KAMPUSATTACK.COM <http://ampusattack.com/> Biggest Social Platform For Students by Students - Enjoy Spiced up Social Networking With Hot Features! - Get Connected To Constillation Of Young Brains Like You! - Access & share useful collection of Ebooks,Notes, Ppt's,Codes,Programs. etc.. - Find Lot Of Humor & Fun Inside! - Chat With Spicy Kampus Messenger with new people , Play Amazing Games. *! STAND OUT FROM CROWD !* With Our Useful Resources You Will Never Be Same As Rest Of Crowd - GD 's With Pro's & Con's. - INTERVIEW preprations by personal experience of people. - PLACEMENT PAPERS - *College Previous Papers* - *Info About Latest **Technologies & Gadgets.* - *Project Ideas & help.* - *INTERNSHIP & TRANING GUIDANCE.* *! BE CONNECTED AND UPDATED!* - *Connect With Your Pal's , Senior's & Alumni's.* - *Exchange Idea's With People Across Kampuses.* *! EXCLUSIVE EXPERT ZONE !* - STEP OUT from other's with our *INDUSTRIAL GUINDANCE* from Adobe , Microsoft, NTPC, BPCL ,Accenture. - Field Experts & Career Consultant Inside. Register Today! *WWW.KAMPUSATTACK.COM* <http://www.kampusattack.com/> -- Arpit Bhatnagar (MNIT JAIPUR) -- 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.
