[algogeeks] please help..
http://www.spoj.pl/problems/PIGBANK/ can anyone give me an idea how to solve this problem...?? I dont think the knapsack algo would be of help here as here we need to find minimum value..please refer to the link and if anyone can help, i would be very thankful. regards, aksha -- 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] Interpreting function declaration
What does the compiler do when it encounters a function declaration?For instance on encountering a variable declarations it reserves memory space.Does it do this for a function as well or simply takes it as an introduction to the function that will be called? -- 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: Lets C Who Really Loves Perfect Square .................
@dave..Can you please explain your logic ..
Regards,
Ashish
On Thu, Feb 24, 2011 at 6:32 AM, Dave dave_and_da...@juno.com wrote:
Try this:
int i,k,n;
long long j,nsq;
for( n = 31623 ; n 10 ; ++n )
{
nsq = (long long)n * (long long)n;
j = nsq;
k = 0;
for( i = 0 ; i 10; ++i )
{
k |= (1 (j % 10));
j /= 10;
}
if( k == 01777 )
printf(%i %lli\n,n,nsq);
}
It finds 76 answers in the blink of an eye, the first being 32043^2
and the last being 99066^2.
Dave
On Feb 22, 3:17 pm, bittu shashank7andr...@gmail.com wrote:
How to find a number of 10 digits (non repeated digits) which is a
perfect square? perfect square examples: 9 (3x3) 16 (4x4) 25(5x) etc.
Ten digit number example 1,234,567,890
Thanks Regards
Shashank
--
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] Pairwise Sum Array
I think.. As like no are a,b,c,d,e so sum will be a+b,a+c,a+d,a+e,b+c,b+d,b+e,c+d,c+e,d+e; so maximuum value will be d+e which is last element of array given take last three value 1.c+d 2.c+e 3.d+e eq(1)-eq(2)=d-e; solving it with 3rd eq will give d and e and with these value we can get other values On Thu, Feb 24, 2011 at 2:52 AM, radha krishnan radhakrishnance...@gmail.com wrote: This s a topcoder problem :) On Wed, Feb 23, 2011 at 7:16 PM, bittu shashank7andr...@gmail.com wrote: If pairwise sums of 'n' numbers are given in non-decreasing order identify the individual numbers. If the sum is corrupted print -1 Example: i/p: 4 5 7 10 12 13 o/p: 1 3 4 9 Thanks Regards Shashank -- 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] Pairwise Sum Array
There must be another good solution..please let me know . Thanks On Thu, Feb 24, 2011 at 5:09 PM, ashish agarwal ashish.cooldude...@gmail.com wrote: I think.. As like no are a,b,c,d,e so sum will be a+b,a+c,a+d,a+e,b+c,b+d,b+e,c+d,c+e,d+e; so maximuum value will be d+e which is last element of array given take last three value 1.c+d 2.c+e 3.d+e eq(1)-eq(2)=d-e; solving it with 3rd eq will give d and e and with these value we can get other values On Thu, Feb 24, 2011 at 2:52 AM, radha krishnan radhakrishnance...@gmail.com wrote: This s a topcoder problem :) On Wed, Feb 23, 2011 at 7:16 PM, bittu shashank7andr...@gmail.com wrote: If pairwise sums of 'n' numbers are given in non-decreasing order identify the individual numbers. If the sum is corrupted print -1 Example: i/p: 4 5 7 10 12 13 o/p: 1 3 4 9 Thanks Regards Shashank -- 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.
[algogeeks] Re: intel puzzle
The only way to get an acute triangle this way is to connect the diagonals of three adjacent faces. You can select 3 adjacent faces of a cube in (6*4*2)/(3*2*1) = 8 different ways. Regards Priyaranjan http://code-forum.blogspot.com On Feb 23, 12:10 am, jalaj jaiswal jalaj.jaiswa...@gmail.com wrote: answer is 8 ,,, duno how On Wed, Feb 23, 2011 at 12:31 AM, Sundi sundi...@gmail.com wrote: Is it not 8C3 = 56 On Feb 22, 9:55 pm, jalaj jaiswal jalaj.jaiswa...@gmail.com wrote: Think of the 8 vertices of a given cube. You are allowed to join three vertices to form a triangle. How many such unique acute triangles can you make ?? -- 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. -- 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.
Re: [algogeeks]
The basic solution which is coming to the mind is to covert string first palindrome and apply livishthein distance to both string(original one and changed string) to check how many substiutions you require for the palindrome. On Wed, Feb 23, 2011 at 9:11 PM, radha krishnan radhakrishnance...@gmail.com wrote: Dynamic Programming :P On Wed, Feb 23, 2011 at 7:19 PM, Balaji S balaji.ceg...@gmail.com wrote: can anyone help?? how to convert a string into a palindrome..with MINIMUM NUMBER OF SUBSTITUTIONS ( operations..) -- balaji ;-) -- 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]
how to solve it using DP?? -- 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] Pairwise Sum Array
Last three values could be: 1.b+e 2.c+e 3.d+e On Thu, Feb 24, 2011 at 5:09 PM, ashish agarwal ashish.cooldude...@gmail.com wrote: I think.. As like no are a,b,c,d,e so sum will be a+b,a+c,a+d,a+e,b+c,b+d,b+e,c+d,c+e,d+e; so maximuum value will be d+e which is last element of array given take last three value 1.c+d 2.c+e 3.d+e eq(1)-eq(2)=d-e; solving it with 3rd eq will give d and e and with these value we can get other values On Thu, Feb 24, 2011 at 2:52 AM, radha krishnan radhakrishnance...@gmail.com wrote: This s a topcoder problem :) On Wed, Feb 23, 2011 at 7:16 PM, bittu shashank7andr...@gmail.com wrote: If pairwise sums of 'n' numbers are given in non-decreasing order identify the individual numbers. If the sum is corrupted print -1 Example: i/p: 4 5 7 10 12 13 o/p: 1 3 4 9 Thanks Regards Shashank -- 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.
Re: [algogeeks] Re: intel puzzle
@priyaranjan No,Your triangle will be right angle triangle. In fact any triangle chosen will be right angle triangle. Proof: suppose there are 2 planes kept at parallel with each other.(top bottom) join corresponding vertices of up to down and form cube. Now 3 points chosen can be on same plane .(means 2 must be adjacent) so right angle triangle is only possible or at least 2 points are on same plane and 3rd point is other plane(pigeon hole as only 2 holes are there for 3 pegions) Now as 3 rd point always lies on perpendicular point so triagle formed will always be right angled. On Thu, Feb 24, 2011 at 5:23 PM, awesomeandroid priyaranjan@gmail.comwrote: The only way to get an acute triangle this way is to connect the diagonals of three adjacent faces. You can select 3 adjacent faces of a cube in (6*4*2)/(3*2*1) = 8 different ways. Regards Priyaranjan http://code-forum.blogspot.com On Feb 23, 12:10 am, jalaj jaiswal jalaj.jaiswa...@gmail.com wrote: answer is 8 ,,, duno how On Wed, Feb 23, 2011 at 12:31 AM, Sundi sundi...@gmail.com wrote: Is it not 8C3 = 56 On Feb 22, 9:55 pm, jalaj jaiswal jalaj.jaiswa...@gmail.com wrote: Think of the 8 vertices of a given cube. You are allowed to join three vertices to form a triangle. How many such unique acute triangles can you make ?? -- 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. -- 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] please help..
a small modification in normal knapsack algo ll do :) On Thu, Feb 24, 2011 at 4:06 PM, Akshata Sharma akshatasharm...@gmail.comwrote: http://www.spoj.pl/problems/PIGBANK/ can anyone give me an idea how to solve this problem...?? I dont think the knapsack algo would be of help here as here we need to find minimum value..please refer to the link and if anyone can help, i would be very thankful. regards, aksha -- 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.
[algogeeks] Re: intel puzzle
@Priyaranjan: Suppose that the cube has side 1 and is placed in standard position at the origin. Then the triangle with vertices (0,0,0), (1,0,1), and (1,1,0) is equilateral with side sqrt(2), and therefore is not a right triangle. Dave On Feb 24, 8:49 am, Vikas Kumar dev.vika...@gmail.com wrote: @priyaranjan No,Your triangle will be right angle triangle. In fact any triangle chosen will be right angle triangle. Proof: suppose there are 2 planes kept at parallel with each other.(top bottom) join corresponding vertices of up to down and form cube. Now 3 points chosen can be on same plane .(means 2 must be adjacent) so right angle triangle is only possible or at least 2 points are on same plane and 3rd point is other plane(pigeon hole as only 2 holes are there for 3 pegions) Now as 3 rd point always lies on perpendicular point so triagle formed will always be right angled. On Thu, Feb 24, 2011 at 5:23 PM, awesomeandroid priyaranjan@gmail.comwrote: The only way to get an acute triangle this way is to connect the diagonals of three adjacent faces. You can select 3 adjacent faces of a cube in (6*4*2)/(3*2*1) = 8 different ways. Regards Priyaranjan http://code-forum.blogspot.com On Feb 23, 12:10 am, jalaj jaiswal jalaj.jaiswa...@gmail.com wrote: answer is 8 ,,, duno how On Wed, Feb 23, 2011 at 12:31 AM, Sundi sundi...@gmail.com wrote: Is it not 8C3 = 56 On Feb 22, 9:55 pm, jalaj jaiswal jalaj.jaiswa...@gmail.com wrote: Think of the 8 vertices of a given cube. You are allowed to join three vertices to form a triangle. How many such unique acute triangles can you make ?? -- 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. -- 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.- 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 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: Lets C Who Really Loves Perfect Square .................
@Ashish: The code seems pretty straightforward, but okay. The outer
for-loop runs through the numbers that have 10-digit squares. The
squares are represented as 64 bit integers (type long long) because
some of them are larger than the maximum representable 32-bit
integers. For each number, the inner for-loop makes a tally of which
digits appear in the square of the number. The if-statement determines
whether the tally indicates that the square of the number has all ten
digits, in which case the digits are non-repeated as prescribed in the
problem statement.
Dave
On Feb 24, 5:25 am, ashish agarwal ashish.cooldude...@gmail.com
wrote:
@dave..Can you please explain your logic ..
Regards,
Ashish
On Thu, Feb 24, 2011 at 6:32 AM, Dave dave_and_da...@juno.com wrote:
Try this:
int i,k,n;
long long j,nsq;
for( n = 31623 ; n 10 ; ++n )
{
nsq = (long long)n * (long long)n;
j = nsq;
k = 0;
for( i = 0 ; i 10; ++i )
{
k |= (1 (j % 10));
j /= 10;
}
if( k == 01777 )
printf(%i %lli\n,n,nsq);
}
It finds 76 answers in the blink of an eye, the first being 32043^2
and the last being 99066^2.
Dave
On Feb 22, 3:17 pm, bittu shashank7andr...@gmail.com wrote:
How to find a number of 10 digits (non repeated digits) which is a
perfect square? perfect square examples: 9 (3x3) 16 (4x4) 25(5x) etc.
Ten digit number example 1,234,567,890
Thanks Regards
Shashank
--
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.- 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 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]
How do Levenshtein distance used.. For that u need to know the palindrome that is closest to it.. and if that is know than there is no point in calculating the distance .. we can easily see how many changes are to be made..!(correct me if I am wrong) Further my approach is this : taking the number in a string and then I can find the mid point of it. (for an even number digit i have 2 mid points). Now i can move one pointer to the left and other to the right to check whether there is a match in the string , if not i increase the value of cntr by 1 For eg 98099 mid is '0' so mantain to pointers and see that 8!=9 hence cntr+1 next 9=9 . and we reach the end . hence answer is 1. On Thu, Feb 24, 2011 at 7:36 PM, Balaji S balaji.ceg...@gmail.com wrote: how to solve it using DP?? -- 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.
[algogeeks] String of Max Length Which Repeats More Then Onep
Given a string (assume there no spaces or punctuations), write a program that returns the max. length of the string that has repeated more than once. Thanks Shashank -- 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: String of Max Length Which Repeats More Then Onep
@Bittu: Your statement of the problem doesn't make any sense. Apparently, you are given a string and somehow that string is repeated. Can you clarify it and give an example? Dave On Feb 24, 10:24 am, bittu shashank7andr...@gmail.com wrote: Given a string (assume there no spaces or punctuations), write a program that returns the max. length of the string that has repeated more than once. Thanks Shashank -- 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] OpenGL
hey guys... please tell me how to run OpenGl on eclipse. thanxx in advance.. -- 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: amazon
Declare it as *static.* On Wed, Feb 23, 2011 at 11:33 PM, Jammy xujiayiy...@gmail.com wrote: Are you talking about IPC? On Feb 22, 10:05 am, jaladhi dave jaladhi.k.d...@gmail.com wrote: What do you mean by data element here ? Also by file you mean the file where you wrote the code ? And above all which programming language are we talking ? You hit send button too early I guess :) On 22-Feb-2011 7:39 PM, jalaj jaiswal jalaj.jaiswa...@gmail.com wrote: Is there any way by which a data element in a file is accessible by another file, where the program has multiple files. That data element should be accessible to a particular file only and inaccessible to the rest.? declaring it as an extern will make it accessible to all i think .. what cud be the answer ? -- 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. -- S.Nishaanth, Computer Science and engineering, IIT Madras. -- 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] open cv
hey guys.. anyone working on implementing object tracking in open cv. please get back to me -- 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] The segmentation of a text document
Hello, Can you help me with tutorial about the segmentation of a text document ? I prefer the C + + but if it were in another language is no problem. Thank you very much. -- 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] Puzzle For Puzzled Minds -How Many Rounds..???
If you had 5,623 participants in a tournament, how many games would need to be played to determine the winner According to me if Tournament strategy is is used then i think its ok... After each round, you would have half the number that started the previous round; except if it were an odd number it would he half + 1. So 13 rounds. 2812 1 1406 2 703 3 352 4 176 5 88 6 44 7 22 8 11 9 6 10 3 11 2 12 1 13 Correct me if i am wrong Some Discussion Needed..??? Thanks Shashank The Best Way to Escape From The Problem is to Solve 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.
[algogeeks] In Place Merging of Two Sorted .Array...Not Easy as seems to be,....
we have two sorted array a[]={2,6,9,60}; b[]={1,3,5,34,80}; merge the
array in such way..
a[]={1,2,3,5}; b[]={6,9,34,60,80}; ..no extra space is allowed..i.e.
In-Place merging
Many of you thinks its easy..but here is q. of minimum complexity i
have done this but min e complexity high that not seems to be gud..i
know it can be done O(n) I have tried in O(n^2)...so i looking for
some gud solution for this
here is my approach lets take two array bigger smaller
void merge(int[] smaller, int[] bigger)
{
int ls=smaller.length;
int bs=bigger.length;
while(true)
{
if(smaller[ls-1]=bigger[0])
{
break;
}
//swap
int z=smaller[ls-1];
smaller[ls-1]=bigger[0];
bigger[0]=z;
//sort small
for(int j=ls-2; j=0;j--)
{
if(smaller[j]smaller[j+1])
{
break;
}
int s=smaller[j+1];
smaller[j+1]=smaller[j];
smaller[j]=s;
}
//sort bigger
for(int j=0;jbs-1;j++)
{
if(bigger[j]bigger[j+1])
{
break;
}
int s=bigger[j+1];
bigger[j+1]=bigger[j];
bigger[j]=s;
}
}
}
Correct me if anything missing or wrong i can improve complexity ???
Hurray up!!!
Thanks Regards
Shashank The Best Way to Escape From The Problem is ton solve 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.
[algogeeks] Construct Binary Tree From Ancestor Matrix
Given an ancestor matrix for an binary tree where a[i][j]=1 if i is parent to j, else a[i][j]=0 create the binary tree. from given ancestor matrix -- Algorithmor program or any approach will be appreciated Thanks Regards Shashank -- 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]
Using Dynamic programming. Divide array into two parts a and b. Run the minimum edit distance solution for each pair of (a,b)(except this time for b we need to start from the end of the array). Find the minimum among those. On Feb 24, 10:41 am, sukhmeet singh sukhmeet2...@gmail.com wrote: How do Levenshtein distance used.. For that u need to know the palindrome that is closest to it.. and if that is know than there is no point in calculating the distance .. we can easily see how many changes are to be made..!(correct me if I am wrong) Further my approach is this : taking the number in a string and then I can find the mid point of it. (for an even number digit i have 2 mid points). Now i can move one pointer to the left and other to the right to check whether there is a match in the string , if not i increase the value of cntr by 1 For eg 98099 mid is '0' so mantain to pointers and see that 8!=9 hence cntr+1 next 9=9 . and we reach the end . hence answer is 1. On Thu, Feb 24, 2011 at 7:36 PM, Balaji S balaji.ceg...@gmail.com wrote: how to solve it using DP?? -- 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.
[algogeeks] Re: Puzzle For Puzzled Minds -How Many Rounds..???
Simpler. Every game eliminates one participant. Since 5,622 participants must be eliminated to have one winner, it takes 5,622 games. Dave On Feb 24, 5:43 pm, bittu shashank7andr...@gmail.com wrote: If you had 5,623 participants in a tournament, how many games would need to be played to determine the winner According to me if Tournament strategy is is used then i think its ok... After each round, you would have half the number that started the previous round; except if it were an odd number it would he half + 1. So 13 rounds. 2812 1 1406 2 703 3 352 4 176 5 88 6 44 7 22 8 11 9 6 10 3 11 2 12 1 13 Correct me if i am wrong Some Discussion Needed..??? Thanks Shashank The Best Way to Escape From The Problem is to Solve 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.
[algogeeks] Re: intel puzzle
@dave i never said it will be a right angled triangle ,it will be a equilateral triangle and thus an acute angled triangle. On Feb 24, 8:38 pm, Dave dave_and_da...@juno.com wrote: @Priyaranjan: Suppose that the cube has side 1 and is placed in standard position at the origin. Then the triangle with vertices (0,0,0), (1,0,1), and (1,1,0) is equilateral with side sqrt(2), and therefore is not a right triangle. Dave On Feb 24, 8:49 am, Vikas Kumar dev.vika...@gmail.com wrote: @priyaranjan No,Your triangle will be right angle triangle. In fact any triangle chosen will be right angle triangle. Proof: suppose there are 2 planes kept at parallel with each other.(top bottom) join corresponding vertices of up to down and form cube. Now 3 points chosen can be on same plane .(means 2 must be adjacent) so right angle triangle is only possible or at least 2 points are on same plane and 3rd point is other plane(pigeon hole as only 2 holes are there for 3 pegions) Now as 3 rd point always lies on perpendicular point so triagle formed will always be right angled. On Thu, Feb 24, 2011 at 5:23 PM, awesomeandroid priyaranjan@gmail.comwrote: The only way to get an acute triangle this way is to connect the diagonals of three adjacent faces. You can select 3 adjacent faces of a cube in (6*4*2)/(3*2*1) = 8 different ways. Regards Priyaranjan http://code-forum.blogspot.com On Feb 23, 12:10 am, jalaj jaiswal jalaj.jaiswa...@gmail.com wrote: answer is 8 ,,, duno how On Wed, Feb 23, 2011 at 12:31 AM, Sundi sundi...@gmail.com wrote: Is it not 8C3 = 56 On Feb 22, 9:55 pm, jalaj jaiswal jalaj.jaiswa...@gmail.com wrote: Think of the 8 vertices of a given cube. You are allowed to join three vertices to form a triangle. How many such unique acute triangles can you make ?? -- 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. -- 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.-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 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: intel puzzle
@vikash kumar please read my answer then give your comment..it will be a equilateral triangle and not a right angled triangle i.e an acute angled triangle. On Feb 24, 7:49 pm, Vikas Kumar dev.vika...@gmail.com wrote: @priyaranjan No,Your triangle will be right angle triangle. In fact any triangle chosen will be right angle triangle. Proof: suppose there are 2 planes kept at parallel with each other.(top bottom) join corresponding vertices of up to down and form cube. Now 3 points chosen can be on same plane .(means 2 must be adjacent) so right angle triangle is only possible or at least 2 points are on same plane and 3rd point is other plane(pigeon hole as only 2 holes are there for 3 pegions) Now as 3 rd point always lies on perpendicular point so triagle formed will always be right angled. On Thu, Feb 24, 2011 at 5:23 PM, awesomeandroid priyaranjan@gmail.comwrote: The only way to get an acute triangle this way is to connect the diagonals of three adjacent faces. You can select 3 adjacent faces of a cube in (6*4*2)/(3*2*1) = 8 different ways. Regards Priyaranjan http://code-forum.blogspot.com On Feb 23, 12:10 am, jalaj jaiswal jalaj.jaiswa...@gmail.com wrote: answer is 8 ,,, duno how On Wed, Feb 23, 2011 at 12:31 AM, Sundi sundi...@gmail.com wrote: Is it not 8C3 = 56 On Feb 22, 9:55 pm, jalaj jaiswal jalaj.jaiswa...@gmail.com wrote: Think of the 8 vertices of a given cube. You are allowed to join three vertices to form a triangle. How many such unique acute triangles can you make ?? -- 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. -- 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.
[algogeeks] Re: Antipodal points
Dave's solution is best if numerical error is possible. If the points are precise, you can also do it in linear time. Just hash the points on abs(y/x). -- 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: intel puzzle
@Priyaranjan. Right. I should have directed my comment to Vikas. Sorry. Dave On Feb 24, 9:35 pm, awesomeandroid priyaranjan@gmail.com wrote: @dave i never said it will be a right angled triangle ,it will be a equilateral triangle and thus an acute angled triangle. On Feb 24, 8:38 pm, Dave dave_and_da...@juno.com wrote: @Priyaranjan: Suppose that the cube has side 1 and is placed in standard position at the origin. Then the triangle with vertices (0,0,0), (1,0,1), and (1,1,0) is equilateral with side sqrt(2), and therefore is not a right triangle. Dave On Feb 24, 8:49 am, Vikas Kumar dev.vika...@gmail.com wrote: @priyaranjan No,Your triangle will be right angle triangle. In fact any triangle chosen will be right angle triangle. Proof: suppose there are 2 planes kept at parallel with each other.(top bottom) join corresponding vertices of up to down and form cube. Now 3 points chosen can be on same plane .(means 2 must be adjacent) so right angle triangle is only possible or at least 2 points are on same plane and 3rd point is other plane(pigeon hole as only 2 holes are there for 3 pegions) Now as 3 rd point always lies on perpendicular point so triagle formed will always be right angled. On Thu, Feb 24, 2011 at 5:23 PM, awesomeandroid priyaranjan@gmail.comwrote: The only way to get an acute triangle this way is to connect the diagonals of three adjacent faces. You can select 3 adjacent faces of a cube in (6*4*2)/(3*2*1) = 8 different ways. Regards Priyaranjan http://code-forum.blogspot.com On Feb 23, 12:10 am, jalaj jaiswal jalaj.jaiswa...@gmail.com wrote: answer is 8 ,,, duno how On Wed, Feb 23, 2011 at 12:31 AM, Sundi sundi...@gmail.com wrote: Is it not 8C3 = 56 On Feb 22, 9:55 pm, jalaj jaiswal jalaj.jaiswa...@gmail.com wrote: Think of the 8 vertices of a given cube. You are allowed to join three vertices to form a triangle. How many such unique acute triangles can you make ?? -- 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. -- 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.-Hidequoted text - - Show quoted text -- 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 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: intel puzzle
@Vikas: Suppose that the cube has side 1 and is placed in standard position at the origin. Then the triangle with vertices (0,0,0), (1,0,1), and (1,1,0) is equilateral with side sqrt(2), and therefore is not a right triangle. Dave On Feb 24, 8:49 am, Vikas Kumar dev.vika...@gmail.com wrote: @priyaranjan No,Your triangle will be right angle triangle. In fact any triangle chosen will be right angle triangle. Proof: suppose there are 2 planes kept at parallel with each other.(top bottom) join corresponding vertices of up to down and form cube. Now 3 points chosen can be on same plane .(means 2 must be adjacent) so right angle triangle is only possible or at least 2 points are on same plane and 3rd point is other plane(pigeon hole as only 2 holes are there for 3 pegions) Now as 3 rd point always lies on perpendicular point so triagle formed will always be right angled. On Thu, Feb 24, 2011 at 5:23 PM, awesomeandroid priyaranjan@gmail.comwrote: The only way to get an acute triangle this way is to connect the diagonals of three adjacent faces. You can select 3 adjacent faces of a cube in (6*4*2)/(3*2*1) = 8 different ways. Regards Priyaranjan http://code-forum.blogspot.com On Feb 23, 12:10 am, jalaj jaiswal jalaj.jaiswa...@gmail.com wrote: answer is 8 ,,, duno how On Wed, Feb 23, 2011 at 12:31 AM, Sundi sundi...@gmail.com wrote: Is it not 8C3 = 56 On Feb 22, 9:55 pm, jalaj jaiswal jalaj.jaiswa...@gmail.com wrote: Think of the 8 vertices of a given cube. You are allowed to join three vertices to form a triangle. How many such unique acute triangles can you make ?? -- 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. -- 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.- 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 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.
