one option cud be reverse the digits...i.e
(bt the first n d last do not satisfy d pattern howeva)
93 , 14,34,54,94,15,35,35,55
an increment is applied to the last 4th no each tme...
not very sure if its crckt...
Regards,
PAYAL GUPTA
On Tue, Feb 28, 2012 at 12:48 PM, Kartik Sachan
{39,41,43,45}incremented by 2
{49,51,53,55}incremented by 2
{64,?,?,?}
first number in each set is considered as base number.
3 is for the number of numbers in each set other than base number.
so in final set base number is 64 and other 3 numbers are incremented by 2.
On Tue, Feb 28,
0.5 ( G(h - 1, i - 1) + G(h - 1, i) ) should be 0.5 ( G(h - 1, i - 1) + G(h
- 1, i+1) )
i am not clear why the parents of a cup in upper row are consecutive?
Best Regards
Ashish Goel
Think positive and find fuel in failure
+919985813081
+919966006652
On Tue, Feb 28, 2012 at 10:43 AM, Gene
Use Mersenne Twister to generate 32-bit integers and do something like
this:
long long x = MT.gen();
x = (x32) + MT.gen();
Don
On Feb 27, 5:58 pm, Prakash D cegprak...@gmail.com wrote:
i've another doubt. what to do when I need to generate a random long long?
On Mon, Feb 27, 2012 at 9:07
Little Bob likes candy, and he wants to buy all the candy he can get
for the smallest price. At the store there is a big table with candy
arranged in an NxN grid. Each candy has a price, Pij where i is the
row and j is the column in which the candy is located. The store owner
gives Bob N tags
@Don: Based on your example, there seems to be an unstated requirement
that Bob can and must buy exactly one candy from each row and each
column.
This is an assignment problem (see en.wikipedia.org/wiki/
Assignment_problem), and can be solved in O(N^3) by the Hungarian
Algorithm (see
Yes, the tags constrain him to buy exactly one candy from each row and
each column.
There is a slightly better algorithm than Hungarian.
Don
On Feb 28, 11:33 am, Dave dave_and_da...@juno.com wrote:
@Don: Based on your example, there seems to be an unstated requirement
that Bob can and must buy
Dave's answer, the Hungarian Algorithm, is correct because it does
meet the requirements of the problem.
There is another algorithm called Jonker-Volgenant-Castanon (JVC)
which can be proven to be faster both on average and in worst case,
than the Hungarian Algorithm. Both solutions are sure to
hey Geeks thanx a lot .. for the valuable information in the
discussions
i got selected in Yatra.com (R n D profile)
thanx a lot for the algorithms explained by to guys
THANX A LOT
:D:D:D:D
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks
cool
On Tue, Feb 28, 2012 at 9:22 PM, Ravi Ranjan ravi.cool2...@gmail.comwrote:
hey Geeks thanx a lot .. for the valuable information in the
discussions
i got selected in Yatra.com (R n D profile)
thanx a lot for the algorithms explained by to guys
THANX A LOT
:D:D:D:D
--
congo :)
On Wed, Feb 29, 2012 at 5:30 AM, Varun Nagpal varun.nagp...@gmail.comwrote:
cool
On Tue, Feb 28, 2012 at 9:22 PM, Ravi Ranjan ravi.cool2...@gmail.comwrote:
hey Geeks thanx a lot .. for the valuable information in the
discussions
i got selected in Yatra.com (R n D
congrats :)
keep participating and keep learning.
On Wed, Feb 29, 2012 at 9:19 AM, atul anand atul.87fri...@gmail.com wrote:
congo :)
On Wed, Feb 29, 2012 at 5:30 AM, Varun Nagpal varun.nagp...@gmail.comwrote:
cool
On Tue, Feb 28, 2012 at 9:22 PM, Ravi Ranjan
congrats :-)
On Wed, Feb 29, 2012 at 10:56 AM, shady sinv...@gmail.com wrote:
congrats :)
keep participating and keep learning.
On Wed, Feb 29, 2012 at 9:19 AM, atul anand atul.87fri...@gmail.comwrote:
congo :)
On Wed, Feb 29, 2012 at 5:30 AM, Varun Nagpal varun.nagp...@gmail.comwrote:
Ntn else is provided..??
On Feb 28, 2012 12:51 PM, Gaurav Popli abeygau...@gmail.com wrote:
Given a sequance of natural numbers.
Find N'th term of this sequence.
a1=2, a2=4, a3=11, a4=36, a5=147, a6=778 ... ... ... ... aN.
this is a coding quesn and O(n) soln is also welcome...
--
@WgpShashank ++1 :)
Thanks
Ashu
CSE , IITD
On Tuesday, February 14, 2012 9:33:46 PM UTC+5:30, WgpShashank wrote:
HI , consider that each value could be the root. Recursively find the
size of the left and right subtrees. thats it .
lets try for n=2 e.g. 1,2 there ways to select the
Well the OP is not clear. You could be right. I solved this problem
once before, and there the glasses were arranged in a pyramid like
they do at weddings in my country (this will only look right if you
set the fixed-width font in Groups:
U
U U
U U U
U U U U
U U U U U
---
16 matches
Mail list logo
