Re: [algogeeks] preprocessor directive

2011-07-25 Thread Anurag Aggarwal
to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Anurag Aggarwal 4th Year B.E. Netaji Subhas Institue of Technology Delhi -- You received this message because you are subscribed to the Google Groups Algorithm Geeks

Re: [algogeeks] MICROSOFT

2011-07-17 Thread Anurag Aggarwal
...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. Anurag Aggarwal -- 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

Re: [algogeeks] A Tough Bit Manipulation

2011-07-10 Thread Anurag Aggarwal
Sunny Don.t you think your method is very slow as you are checking every number that for number of set bits and if it is a equal to desired than you are decreasing n i.e. required number. Even if when n=1 and k=32 your solution will start with 0 and go up to 2^31 but the answer could be found in

Re: [algogeeks] solve this

2011-07-06 Thread anurag aggarwal
93747 On Wed, Jul 6, 2011 at 5:28 PM, rupali chauhan chauhanrupal...@gmail.comwrote: Solve Dis! A Boy Forgot His Pin-Code Which Was Of 5 Digits, But Luckily He Remembered Some Hints How To 2 Remind That Password, ...Here Are Those Clues. 1.First Digit Is Equal To The Square Of Second