from:"Rel Guzman Apaza"

Re: [algogeeks] If any one have algorithms for interviews by adnan aziz ebook... Please mail ...

2011-04-18 Thread Rel Guzman Apaza

Send to me too. Please. rgap...@gmail.com

2011/4/18 Abhishek Goswami zeal.gosw...@gmail.com

I think we can share into email...that will not be any issue. :)

On Mon, Apr 18, 2011 at 10:07 PM, Abhishek Goswami zeal.gosw...@gmail.com
wrote:

can u please me also .. zeal_gosw...@yahoo.com

On Thu, Apr 14, 2011 at 11:50 AM, Himanshu Neema
potential.himansh...@gmail.com wrote:

Hi All ,
Yesterday I received an email from Author that this is *violation of
Intellectual Property Ownership* ,So kindly please delete pdfs please
remove all the sharing.

Thanks Guys.
Himanshu

On Thu, Apr 14, 2011 at 10:52 AM, Harshal hc4...@gmail.com wrote:

Thanks :)

On Thu, Apr 14, 2011 at 9:59 AM, Rajeev Kumar rajeevprasa...@gmail.com
wrote:

check this link:

https://docs.google.com/viewer?a=vpid=explorerchrome=truesrcid=1B5ady61W_93zq0st5FQpvzj4d6wFCdM3Vl8YGSqRt0_NVFWh3SGkNU24hIb3hl=en

If you have any problem in access,please inform me

On Thu, Apr 14, 2011 at 1:04 AM, Abhishek Goswami
zeal.gosw...@gmail.com wrote:

Hi,
I tried to open this book in google docs and got message that file is
not avaliable. does this file not available in google docs
if yes , can anybody share this book again

On Tue, Mar 22, 2011 at 10:41 PM, Himanshu Neema
potential.himansh...@gmail.com wrote:

Turns out that I cant send file larger than 4 MB , please download it
from here , let me know if you're still unable to download:

http://dl.dropbox.com/u/2681370/Algorithms%2Bfor%2BInterviews%2B%28scan%2Bocr%29%20%281%29.pdf

have fun !

On Tue, Mar 22, 2011 at 10:21 PM, Himanshu Neema
potential.himansh...@gmail.com wrote:

Enjoy :)

On Tue, Mar 22, 2011 at 10:09 PM, Saravanan T
mail2sarava...@gmail.com wrote:

On Tue, Mar 22, 2011 at 9:51 PM, Anurag atri
anu.anurag@gmail.com wrote:

and me too :)

On Tue, Mar 22, 2011 at 9:28 PM, Nikhil Mishra
mishra00...@gmail.com wrote:

count me too

On Tue, Mar 22, 2011 at 11:16 AM, kunal srivastav
kunal.shrivas...@gmail.com wrote:

plz send it to me too

On Tue, Mar 22, 2011 at 11:14 AM, D.N.Vishwakarma@IITR
deok...@gmail.com wrote:

*With Regards
Deoki Nandan Vishwakarma
IITR MCA
Mathematics Department
*

--
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.

--
thezeitgeistmovement.com

--
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
Anurag Atri

--
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.

--
Thank You
Rajeev Kumar

Re: [algogeeks] Mathematics Problem

2011-02-25 Thread Rel Guzman Apaza

Is there a maximum time complexity?

2011/2/25 vaibhav shukla vaibhav200...@gmail.com

 Find the sum of digits of all the numbers whose digits are all in ascending
 order from left to right. All these numbers lie between 500 to 1000 and
 satisfy M divides (M-1)* !* + 1 , where M is any natural number.
 (*  !  * denotes factorial of the number)
 --



 best wishes!!
 Vaibhav Shukla
 DU-MCA

  --
 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.

Re: [algogeeks] UVa - Gold Coins

2011-02-16 Thread Rel Guzman Apaza

I did it.

#include iostream
#include cmath
using namespace std;

int main(){
int n,ac,k,sum;
while(cinn  n){
ac=0;
k=ceil((sqrt(1+8*n)-1)/2)-1;
ac+=k*(k+1)*(2*k+1)/6;
sum=(k+1)*(k+2)/2;
ac+=(k+1)*((k+1)-(sum-n));
coutn acendl;
}
}

2011/2/16 nphard nphard nphard.nph...@gmail.com

 Let f(n) = n(n+1)/2
 We have to find n1 and n2 such that f(n1)  N = f(n2) and n2 = n1 + 1.
 Solution is n2.

 Can be done in O(1) as follows:

 Solve N = n(n+1)/2 for unknown n.
 Requires us to solve quadratic equation: n^2 + n - 2N = 0
 Find positive root of the equation which could be a real number. n2 =
 ceil(n).

 On Wed, Feb 16, 2011 at 5:14 PM, Pedro Rezende web...@gmail.com wrote:

 It seems to be a very easy problem, but I'm not finding an *equation *that
 solves it... could someone help me with the steps?

 Brief:
 A king pays 1 gold coin to a knight on the first day. 2 gold coins for the
 next 2 days, 3 gold coins for the next 3 days, and so on...
 Given a day N, how much gold coins the knight must receive?

 Link:
 http://acm.uva.es/archive/nuevoportal/data/problem.php?p=3045

 Thank you all! :-)

 --
 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.

Re: [algogeeks] Re: question at K10

2011-02-15 Thread Rel Guzman Apaza

Nothing... 10 in base 5   =   5 in base 10.

void change(){
printf(); //...?
}

2011/2/15 Don dondod...@gmail.com

 A semicolon is valid in the middle of a line in C or C++.

 For instance, no one says that

 for(i = 0; i  10; ++i)

 is three lines of code.

 Don

 On Feb 15, 11:31 am, jalaj jaiswal jalaj.jaiswa...@gmail.com wrote:
  after termination of semicolon , that will be considered a separate line
 i
  guess
 
 
 
  On Tue, Feb 15, 2011 at 10:59 PM, Don dondod...@gmail.com wrote:
   void change()
   {
printf(10); while(1) {}
   }
 
   On Feb 15, 10:17 am, Balaji S balaji.ceg...@gmail.com wrote:
Insert only one line in the function change() so that the output of
 the
program is 10.
You are not allowed to use exit(). You are not allowed to edit the
   function
main() or to
pass the parameter to change()
 
void change()
{
// Code here}
 
int main()
{
int i=5;
change();
printf(“%d” ,i);
return 0;
 
}
 
   --
   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)
  Software developer, Cisco Systems
  B.Tech 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.

Re: [algogeeks] Re: MINIMUM POSITIVE SUM

2011-02-09 Thread Rel Guzman Apaza

I think the only solution will be finding all subsets.

2011/2/9 MONSIEUR monsieur@gmail.com

 @jalaj: text missing.??? I think i've mentioned question
 properly.is there any thing more u require?

 n Feb 9, 9:45 pm, jalaj jaiswal jalaj.jaiswa...@gmail.com wrote:
  @monsieur ... text missing dude
 
 
 
  On Wed, Feb 9, 2011 at 10:12 PM, MONSIEUR monsieur@gmail.com
 wrote:
   Given: An array of integers(may be both positive and negative), we
   have to find out the  minimum positive sum of array(not necessarily
   continuous).
 
   example:-  {1,-5,7,10,-14,16,-17,20,21,22}
 
  here answer is -5,-17,22 having sum=0;
 
   --
   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)
  Software developer, Cisco Systems
  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.

Re: [algogeeks] m-permutation

2011-02-09 Thread Rel Guzman Apaza

maybe using a circular linked list.

2011/2/9 punnu punnu.gino...@gmail.com

 Suppose n people are arranged in a circle. Number the people from 1 to
 n. in the clockwise order. We are given an integer ,m = n. Beginning
 with the person with designated number 1, we proceed around the circle
 (in clockwise order) removing every mth person. After each person is
 removed, counting continues around the circle that
 remains. This process continues until all the n people have been
 removed. . The .m-permutation is defined as the order in which the
 people have been removed. As an example, if n = 7, m = 3, then the 3 -
 permutation is 3,6,2,7,5,1,4.
 Give an O(n log n) time algorithm which given m and n outputs the m-
 permutation.

 --
 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.

Re: [algogeeks] Re: Correctness of an algorithm

2011-01-16 Thread Rel Guzman Apaza

Yeah, but how the correctness?

2011/1/16 juver++ avpostni...@gmail.com

 This algorithm can be found on the TopCoder tutorials.

 --
 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.comalgogeeks%2bunsubscr...@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.

Re: [algogeeks] If any one have algorithms for interviews by adnan aziz ebook... Please mail ...

Re: [algogeeks] Mathematics Problem

Re: [algogeeks] UVa - Gold Coins

Re: [algogeeks] Re: question at K10

Re: [algogeeks] Re: MINIMUM POSITIVE SUM

Re: [algogeeks] m-permutation

Re: [algogeeks] Re: Correctness of an algorithm

7 matches

Site Navigation

Mail list logo

Footer information