Re: [algogeeks] ubuntu help

[Saket Choudhary]

Just type "vlc" in terminal. Else if you want to run it as root : "sudo vlc"

Sent from my iPhone

On Sep 4, 2011, at 1:31 PM, UTKARSH SRIVASTAV  wrote:

> hi anyone knows how to play vlc in root .i know root  is 
> not allowed by default   but i want to know some mean
> 
> -- 
> UTKARSH SRIVASTAV
> CSE-3
> B-Tech 3rd Year
> @MNNIT 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] puzzle

[Saket Choudhary]

16x=15y. Multiple solutions. Actually Infinite.

On 19 July 2011 23:58, shiv narayan  wrote:

> There is a temple, whose premises have a garden and a pond. It has 4
> idols, each of Ram, Shiv, Vishnu and Durga. The priest plucks x
> flowers from the garden and places them in the pond. The number of
> flowers
> doubles up, and he picks y flowers out of them and goes to offer it to
> Lord Ram. By the time he reaches to the pond, he finds the remaining
> flowers also have doubled up in the meantime, so he again picks up y
> from
> the pond and goes to Lord Shiv.This process is repeated till all the
> Gods have y flowers offered to them, such that in the end no flower is
> left in the pond. Find x and y.
>
> --
> 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: Circle Circle & more Circles .........

[Saket Choudhary]

^The condition if d < r0+r1 means the circles are intersecting hence theres
no way a bigger circle will overshadow the smaller circle which will happen
only whne d < abs(r1-r0)

On 20 July 2011 00:00, Piyush Sinha  wrote:

> Just a simple thoughtI am assuming all points are unique
>
> Create a queue that is made to contain the points...
>
> say points queue [1000];
>
> for i:1 to n
>  for j:i+1 to n
>  Calculate d (distance between the two centers)
>   if (d >= r0 + r1) keep them in two separate queues
>   if(d< r0 + r1) ignore the point with smaller radius //as it
> will overshadowed the bigger circle completely
>keep both of them in one single queue
>
> Now calculate the area of the circles in those queues which have
> single element...
>
> those with more than one element..calculate the area using simple
> geometry...
>
> Hope the above algo is clear...
>
> On 7/19/11, SAMMM  wrote:
> > See the input will be :-
> >
> > 6< No of circles
> >
> > x1 y1 R1
> > x2 y2 R2
> > x3 y3 R3
> > x4 y4 R4
> > x5 y5 R5
> > x6 y6 R6
> >
> > Output:-
> > Area occupied by the above circles (one line) 4 decimal points .
> >
> >
> > On Jul 19, 9:01 pm, priyanka goel  wrote:
> >> can u pl tell wat is dis x & y coordinate?
> >> are dey centre coordinates or any point on circumference of circle..
> >
> > --
> > 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.
> >
> >
>
>
> --
> *Piyush Sinha*
> *IIIT, Allahabad*
> *+91-7483122727*
> *  "NEVER SAY
> NEVER"
> *
>
> --
> 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] is it possible to detect the first repeating number in a 2-D array (n X n) in O(n) time ?

[Saket Choudhary]

Ya. Have an extra array of size(nxn). the one that I have implemented above.

-- 
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] is it possible to detect the first repeating number in a 2-D array (n X n) in O(n) time ?

[Saket Choudhary]

Ruby Solution for 1d array. The logic for 2d array remains same.

a=[1,2,3,4,5,1]
b=[]
for m in a
  unless b.include?(m)
b< wrote:

> Have a hash Table. Read the elements and push it to the hash table. If it
> alraedy exists you are done.
>
>
> On 19 July 2011 01:02, Shubham Maheshwari wrote:
>
>> what would be the O(n^2) sol. to this ...!!
>>
>>
>> On Tue, Jul 19, 2011 at 12:41 AM, snehi jain wrote:
>>
>>> can it be solved in less than O(n^2) like O(nlogn ) types..
>>> i cant figure out any solution less than O(n^2).
>>>
>>>
>>> On Tue, Jul 19, 2011 at 12:37 AM, ankit sambyal 
>>> wrote:
>>>
 @Snehi :If the elements are random, then it seems that this problem
 can't be solved in O(n) time

 --
 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.
>>>
>>
>>
>>
>> --
>> Shubham Maheshwari
>> ShubZz
>> O.o o.O
>>
>> enJoY ...!!!
>>
>>  --
>> 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] is it possible to detect the first repeating number in a 2-D array (n X n) in O(n) time ?

[Saket Choudhary]

Have a hash Table. Read the elements and push it to the hash table. If it
alraedy exists you are done.

On 19 July 2011 01:02, Shubham Maheshwari wrote:

> what would be the O(n^2) sol. to this ...!!
>
>
> On Tue, Jul 19, 2011 at 12:41 AM, snehi jain wrote:
>
>> can it be solved in less than O(n^2) like O(nlogn ) types..
>> i cant figure out any solution less than O(n^2).
>>
>>
>> On Tue, Jul 19, 2011 at 12:37 AM, ankit sambyal 
>> wrote:
>>
>>> @Snehi :If the elements are random, then it seems that this problem
>>> can't be solved in O(n) time
>>>
>>> --
>>> 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.
>>
>
>
>
> --
> Shubham Maheshwari
> ShubZz
> O.o o.O
>
> enJoY ...!!!
>
>  --
> 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] ms ques

[Saket Choudhary]

Use logarithms and the properties that follow.
Let the number be n
Find log to the base 5 of n =*X*= *log*(n)/*log*(5) here *log* refers to
base 10
Find log to the base 9 = *X*/(log to the base 5 of 9)
Done!

On 18 July 2011 23:58, varun pahwa  wrote:

> is there any direct conversion possible like from 2 to 16 ??
>
>
> On Mon, Jul 18, 2011 at 11:56 PM, Nishant Mittal <
> mittal.nishan...@gmail.com> wrote:
>
>> 1st convert base 5 to base 10 and then base 10 to base 9
>>
>>
>> On Mon, Jul 18, 2011 at 11:54 PM, sivaviknesh s 
>> wrote:
>>
>>>
>>> convert a number in base 5  to  base 9 
>>>
>>> --
>>> Regards,
>>> $iva
>>>
>>>  --
>>> 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.
>>
>
>
>
> --
> Varun Pahwa
> B.Tech (IT)
> 7th Sem.
> Indian Institute of Information Technology Allahabad.
> Ph : 09793899112
> Official Email :: rit2008...@iiita.ac.in
> Another Email :: varunpahwa.ii...@gmail.com
>
> People who fail to plan are those who plan to fail.
>
>  --
> 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] is it possible to detect the first repeating number in a 2-D array (n X n) in O(n) time ?

[Saket Choudhary]

Yeah if they are in some order then its possible doing it in O(n) else
reading should itself take O(n^2) in the worst case.

On 18 July 2011 23:54, ankit sambyal  wrote:

> Are the elements of the array in some order, or are they random ?
>
> --
> 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: MICROSOFT

[Saket Choudhary]

^*constraint is not using division operator*
*
*
*
*
On 18 July 2011 01:44, hary rathor  wrote:

> assume that ; all element in array are short integer;
>
>
>
> int i;
> long long long long long int multi=1;
> for(i=0;i {
> multi*=a[i];
> }
>
> for(i=0;i {
> out[i]=mul[i]/a[i];
> }
>
> O(n)
>
>  --
> 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.